arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.07093cond-mat.dis-nncond-mat.stat-mech
收藏

复杂网络中的拉普拉斯粗粒化

Laplacian Coarse Graining in Complex Networks

Matheus de C. Loures, Alan Albert Piovesana, José Antônio Brum

AI总结:

本研究提出一种基于拉普拉斯矩阵的粗粒化方法,将重整化群应用于复杂网络,通过场论计算相关函数合并节点,发现多数网络具有跨尺度自相似性。

摘要:

复杂网络可以对从人类大脑到社会联系的各种不同系统进行建模。其中一些网络具有大量的节点和链接,使得直接分析它们变得不切实际。简化这些系统的一种策略是创建保持其主要特性的网络微缩版本。应用该策略的一个便捷工具是重整化群(RG),这是统计物理学中用于改变物理系统尺度的一种方法。该方法包含两个步骤:一是粗粒化,即减小系统的规模;二是重标度相互作用,以补偿信息损失。本研究通过引入一种基于拉普拉斯矩阵的粗粒化方法,将RG应用于复杂网络。我们使用场论方法计算相关函数,并将最相关的节点粗粒化为超级节点,将我们的方法应用于多个人工和真实世界网络。结果令人鼓舞,大多数被分析的网络在不同尺度上表现出自相似特性。

英文摘要:

Complex networks can model a range of different systems, from the human brain to social connections. Some of those networks have a large number of nodes and links, making it impractical to analyze them directly. One strategy to simplify these systems is by creating miniaturized versions of the networks that keep their main properties. A convenient tool that applies that strategy is the renormalization group (RG), a methodology used in statistical physics to change the scales of physical systems. This method consists of two steps: a coarse grain, where one reduces the size of the system, and a rescaling of the interactions to compensate for the information loss. This work applies RG to complex networks by introducing a coarse-graining method based on the Laplacian matrix. We use a field-theoretical approach to calculate the correlation function and coarse-grain the most correlated nodes into super-nodes, applying our method to several artificial and real-world networks. The results are promising, with most of the networks under analysis showing self-similar properties across different scales.

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

↑