复杂网络中的重整化流
Renormalization flows in complex networks
摘要:
复杂网络是近年来研究的热点问题之一,因为许多自然、社会和技术系统的图表示往往有助于描述和建模它们的现象学。此外,统计物理学的数学工具已被证明特别适合于研究和理解复杂网络。然而,这种理论方法的一个重要障碍仍然是难以在网络科学和统计物理学的更传统方面之间建立平行关系。在本文中,我们探讨了复杂网络和统计物理学的一个众所周知的话题:重整化之间的关系。介绍了一种分析复杂网络重正化流的一般方法。该方法可用于研究任何合适的重整化变换。可以在计算机生成的网络上执行有限尺寸标度,以便将它们分类在通用类中。我们还提出了实际网络上的方法的应用。
英文摘要:
Complex networks have acquired a great popularity in recent years, since the graph representation of many natural, social and technological systems is often very helpful to characterize and model their phenomenology. Additionally, the mathematical tools of statistical physics have proven to be particularly suitable for studying and understanding complex networks. Nevertheless, an important obstacle to this theoretical approach is still represented by the difficulties to draw parallelisms between network science and more traditional aspects of statistical physics. In this paper, we explore the relation between complex networks and a well known topic of statistical physics: renormalization. A general method to analyze renormalization flows of complex networks is introduced. The method can be applied to study any suitable renormalization transformation. Finite-size scaling can be performed on computer-generated networks in order to classify them in universality classes. We also present applications of the method on real networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。