arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0810.3313cond-mat.stat-mechmath-phmath.MPphysics.soc-ph
收藏

Koch曲线到无标度小世界网络的映射

Mapping Koch curves into scale-free small-world networks

Zhongzhi Zhang, Shuyang Gao, Lichao Chen, Shuigeng Zhou, Hongjuan Zhang, Jihong Guan

摘要:

Koch分形是分形中最有趣的一类,对复杂网络的研究是科学界的一个中心问题。在本文中,受著名的Koch分形的启发,我们提出了一种映射技术,将Koch分形转换成一族确定性网络,称为Koch网络。这种新型的网络结合了大多数现实生活中的网络系统的一些关键特性-指数在2和3之间的幂律分布,高聚类系数,小直径和平均路径长度,以及度相关性。此外,我们列举了网络中生成树、生成森林和连通生成子图的确切数目。所有这些功能得到完全根据所考虑的网络的建议生成算法。网络表示方法可以从复杂网络的角度来研究现实世界中某些系统的复杂性。

英文摘要:

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks, called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems---a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, small diameter and average path length, and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests, and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

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

↑