Abstract：The Koch Fractal Island, which is starting from a regular polygon, is mapped to complex evolving Koch networks. The informative labels are given to nodes, the labels are based on the time and location when nodes are accessing to Koch networks. By the advantages of the informative labels, we get the exact solution of main structural properties of Koch networks, including degree distribution and cumulative degree distribution function, as well as the clustering coefficient, average shortest path length and the correlation function of degree, betweenness centrality and the shortest path routing and length. The results show that, Koch network is a scale-free and small-world network; its clustering coefficient tends to relatively large constant; average shortest path length is proportional to the logarithm of the size of networks; degree correlation function is exponential function relationship with node's degree.
翟因虎, 王银河. 基于节点标号的Koch网络结构性质研究[J]. 复杂系统与复杂性科学, 2016, 13(3): 58-68.
ZHAI Yinhu, WANG Yinhe. The Structural Properties of Koch Networks Based on Node Labels[J]. Complex Systems and Complexity Science, 2016, 13(3): 58-68.
[1] Watts D J, Strogatz S H. Collective dynamics of ‘small-world’networks[J].nature, 1998, 393(6684): 440-442. [2] Barabási A L, Albert R. Emergence of scaling in random networks[J].science, 1999, 286(5439): 509-512. [3] 章忠志, 周水庚, 方锦清. 复杂网络确定性模型研究的最新进展[J].复杂系统与复杂性科学, 2008, 5(4):29-46. Zhang Zhongzhi, Zhou Shuigeng, Fan|Jinqing. Recent progress of deterministic models forcomplex networks[J].Complex Systems and Complexity Science, 2008, 5(4):29-46. [4] Comellas F, Ozon J, Peters J G. Deterministic small-world communication networks[J].Information Processing Letters, 2000, 76(1): 83-90. [5] Zhang Z, Zhou S, Qi Y, et al. Topologies and Laplacian spectra of a deterministic uniform recursive tree[J].The European Physical Journal B-Condensed Matter and Complex Systems, 2008, 63(4): 507-513. [6] Barabási A L, Ravasz E, Vicsek T. Deterministic scale-free networks[J].Physica A: Statistical Mechanics and its Applications, 2001, 299(3): 559-564. [7] Zhou T, Wang B H, Hui P M, et al. Topological properties of integer networks[J].Physica A: Statistical Mechanics and its Applications, 2006, 367: 613-618. [8] 李永,方锦清,刘强. 多种确定性广义Farey组织的网络金字塔[J].物理学报,2010,05:2991-3000. Li Yong, Fan Jingqing, Liu Qiang. Determinate generalized Farey organized network pyramid[J].Acta Physica Sinina, 2010,05:2991-3000. [9] Andrade Jr J S, Herrmann H J, Andrade R F S, et al. Apollonian networks: simultaneously scale-free, small world, euclidean, space filling, and with matching graphs[J].Physical Review Letters, 2005, 94(1): 018702. [10] Zhang Z, Chen L, Zhou S, et al. Exact analytical solution of average path length for Apollonian networks[J].arXiv preprint arXiv:0706.3491, 2007.[DB/OL].[2014-05-06].http://arxiv.org/abs/0706.3491. [11] 邢长明,刘方爱.基于Sierpinski分形垫的确定性复杂网络演化模型研究[J].物理学报,2010,59(3):1608-1614. Xing Chang-ming, Liu Fan-ai.[J].Research on the determinstic complex network model based on the Sierpinski network[J].ACTA PHYSICA SININA, 2010,59(3):1608-1614. [12] Zhang Z, Zhou S, Fang L, et al. Maximal planar scale-free Sierpinski networks with small-world effect and power law strength-degree correlation[J].EPL (Europhysics Letters), 2007, 79(3): 38007. [13] Zhang ZH ZH, Qi Y, Zhou SH G,et al. Explicit determination of mean first-passage time for random walks on deterministic uniform recursive trees[J].Physical Review E, 2010, 81:016114. [14] Zhang ZH ZH, Yang Y H, Gao SH Y. Role of fractal dimension in random walks on scale-free networks[J].European Physical Journal B, 2011, 84:331-338. [15] Wu B, Zhang|ZH ZH, Chen G R. Properties and applications of Laplacian spectra for the Koch networks[J].Journal of Physics A: Mathematical and Theoretical, 2012, 45:025102. [16] Zhang ZH ZH, Shan T, Chen G R. Random walks on weighted networks[J].Physical Review E, 2013, 87:012112. [17] Zhang Z, Wu B, Comellas F. The number of spanning trees in Apollonian networks[J].Discrete Applied Mathematics, 2014, 169: 206-213. [18] Zhang Z, Gao S, Chen L, et al. Mapping Koch curves into scale-free small-world networks[J].Journal of Physics A: Mathematical and Theoretical, 2010, 43(39): 395101. [19] Zhang Z, Zhou S, Xie W, et al. Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect[J].Physical Review E, 2009, 79(6): 061113. [20] Zhang Z, Gao S, Xie W. Impact of degree heterogeneity on the behavior of trapping in Koch networks[J].Chaos: an Interdisciplinary Journal of Nonlinear Science, 2010, 20(4): 043112. [21] Zhang Z, Gao S. Scaling of mean first-passage time as efficiency measure of nodes sending information on scale-free Koch networks[J].The European Physical Journal B-Condensed Matter and Complex Systems, 2011, 80(2): 209-216. [22] 刘甲雪,孔祥木.无标度立体Koch网络的建立及其结构性质研究[J].物理学报,2010,4:2244-2249. Liu Jia-xue, Kong Xiang-mu. Establishment and structure properties on scale-free Koch network[J].Acta Physica Sinna, 2010,4:2244-2249. [23] Chen R, Fu X, Wu Q. On topological properties of the octahedral Koch network[J].Physica A: Statistical Mechanics and its Applications, 2012, 391(3): 880-886. [24] Zhang J, Sun W. The structural properties of the generalized Koch network[J].Journal of Statistical Mechanics: Theory and Experiment, 2010, (7): P07011. [25] Zhang J Y, Sun W G, Chen G R. Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap[J].Chinese Physics B, 2012, 21(3): 8901. [26] Sun W, Zhang J, Wu Y. Novel evolving small-world scale-free Koch networks[J].Journal of Statistical Mechanics: Theory and Experiment, 2011, 2011(3): P03021. [27] Wu Z K, Hou B Y, Zhang H S, et al. Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks[J].International Journal of Modern Physics B, 2014, 28(28):2699-2700. [28] Zhang Z, Comellas F, Fertin G, et al. Vertex labeling and routing in expanded Apollonian networks[J].Journal of Physics A: Mathematical and Theoretical, 2008, 41(3): 035004. [29] Comellas F, Miralles A. Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks[J].Journal of Physics A: Mathematical and Theoretical, 2009, 42(42): 425001. [30] Comellas F, Miralles A. Label-based routing for a family of scale-free, modular, planar and unclustered graphs[J].Journal of Physics A: Mathematical and Theoretical, 2011, 44(20): 205102.
