arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.15944physics.soc-phcond-mat.dis-nnphysics.data-an
收藏

通过消息传递算法将网络划分为同步节点集群:一种无偏可扩展的方法

Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach

Instituto de Física, Universidade Federal da Bahia(巴伊亚联邦大学物理研究所)

Massimo Ostilli

AI总结:

本文提出了一种基于消息传递算法的无偏可扩展方法,用于将网络划分为同步节点集群,通过有效Ising-like模型识别动态一致的集群,并在真实世界网络中验证了该方法的效果。

摘要:

将大型网络划分为稳定的同步节点集群是一个具有挑战性的任务。基于谱分析的最新方法可以在特定动态下提供精确结果,但难以应用于非常大的网络。此外,在随机框架中,不清楚应选择哪种动态来研究同步。在这里,我们提出了一种无偏且可扩展的方法,基于消息传递算法。通过利用有效Ising-like模型在临界点上出现的集体行为,我们识别出动态一致的同步节点集群,并在一些大型真实世界网络上展示了该方法。我们发现,与连续时间动态不同,在简单的图中即使没有引入更高阶相互作用,也会出现突然的异步现象。然而,当引入噪声时,同步转换变得平滑,并通过形成平台进行,尽管这需要更大的耦合强度。

英文摘要:

Partitioning large networks into stable clusters of synchronized nodes is a challenging task. Recent approaches based on spectral analysis can provide exact results on specific dynamics but remain unfeasible for very large networks. Moreover, within a stochastic framework, it is unclear which dynamics should be chosen to study synchronization. Here we propose an unbiased and scalable method based on the message-passing algorithm. By exploiting the collective behavior emerging across critical points of an effective Ising-like model, we identify dynamically coherent clusters of synchronized nodes and illustrate the approach on some large real-world networks. We find that, unlike continuous-time dynamics, abrupt desyncrhronization occurs even in simple graphs, without the need to invoke higher order interactions. However, when noise is included, the transition to synchronization becomes smoother and proceeds through the formation of plateaus, albeit at the cost of requiring larger coupling strengths.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑