Multifractal analysis of complex networks  

作　　者：王丹龄 喻祖国 Anh V 

机构地区：[1]School of Mathematical Sciences,Queensland University of Technology [2]School of Mathematics&Physics,University of Science&Technology Beijing [3]Hunan Key Laboratory for Computation&Simulation in Science&Engineering,and School of Mathematics&Computational Science,Xiangtan University

出　　处：《Chinese Physics B》2012年第8期85-95,共11页中国物理B（英文版）

基　　金：Project supported by the Australian Research Council (Grant No. DP0559807);the National Natural Science Foundation of China (Grant No. 11071282);the Science Fund for Changjiang Scholars and Innovative Research Team in University (PCSIRT)(Grant No. IRT1179);the Program for New Century Excellent Talents in University (Grant No. NCET-08-06867);the Research Foundation of the Education Department of Hunan Province of China (Grant No. 11A122);the Natural Science Foundationof Hunan Province of China (Grant No. 10JJ7001);the Science and Technology Planning Project of Hunan Province of China(Grant No. 2011FJ2011);the Lotus Scholars Program of Hunan Province of China,the Aid Program for Science and Technology Innovative Research Team in Higher Education Institutions of Hunan Province of China,and a China Scholarship Council-Queensland University of Technology Joint Scholarship

摘　　要：Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions Dq of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of Dq due to changes in the parameters of the theoretical network models is also discussed.Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions Dq of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of Dq due to changes in the parameters of the theoretical network models is also discussed.

关 键 词：complex networks MULTIFRACTALITY box covering algorithm 

分 类 号：O157.5[理学—数学]