arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.4244physics.soc-phcond-mat.stat-mech
收藏

用沙箱算法确定复杂网络的多重分形维数

Determination of multifractal dimensions of complex networks by means of the sandbox algorithm

Jin-Long Liu, Zu-Guo Yu, Vo Anh

摘要:

复杂网络在科学和技术的各个领域引起了广泛的关注。多重分形分析(MFA)是一种系统地描述理论和实验分形格局空间异质性的有效方法。在本文中,我们采用Tél等人(Physica A,159(1989)155-166)提出的沙箱(SB)算法,用于复杂网络的MFA。首先,我们将SB算法与复杂网络的MFA的两种现有算法进行比较:由Furuya和Yakubo提出的紧凑烧盒(CBB)算法(Phys. Rev. E,84(2011)036118),以及由Li等人提出的改进的盒计数(BC)算法(J. Stat.机械:Theor.实验,2014(2014)P02020)通过计算一些确定性模型网络的质量指数tau(q)。我们对这些模型网络的数值结果和理论结果进行了详细的比较。比较结果表明,SB算法是计算网络质量指数τ(q)和探索复杂网络多重分形行为的最有效、最可行的算法。然后,我们应用SB算法研究了一些经典网络模型的多重分形性质,如无标度网络、小世界网络和随机网络。结果表明,无标度网络中存在多重分形,小世界网络中的多重分形不明显,随机网络中几乎不存在多重分形。

英文摘要:

Complex networks have attracted much attention in diverse areas of science and technology. Multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we employ the sandbox (SB) algorithm proposed by Tél et al. (Physica A, 159 (1989) 155-166), for MFA of complex networks. First we compare the SB algorithm with two existing algorithms of MFA for complex networks: the compact-box-burning (CBB) algorithm proposed by Furuya and Yakubo (Phys. Rev. E, 84 (2011) 036118), and the improved box-counting (BC) algorithm proposed by Li et al. (J. Stat. Mech.: Theor. Exp., 2014 (2014) P02020) by calculating the mass exponents tau(q) of some deterministic model networks. We make a detailed comparison between the numerical and theoretical results of these model networks. The comparison results show that the SB algorithm is the most effective and feasible algorithm to calculate the mass exponents tau(q) and to explore the multifractal behavior of complex networks. Then we apply the SB algorithm to study the multifractal property of some classic model networks, such as scale-free networks, small-world networks, and random networks. Our results show that multifractality exists in scale-free networks, that of small-world networks is not obvious, and it almost does not exist in random networks.

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

↑