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

Abstract

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.

17 pages, 2 table, 10 figures

References in corpus (12)

• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Scaling theory of transport in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Fractality in complex networks: critical and supercritical skeletons
• Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
• A box-covering algorithm for fractal scaling in scale-free networks
• Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
• A statistical mechanics approach for scale-free networks and finite-scale networks
• Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions
• Fractal scale-free networks resistant to disease spread
• Statistical Self-Similar Properties of Complex Networks
• Impact of degree heterogeneity on the behavior of trapping in Koch networks

Cited by in corpus (11)

• Fractal and multifractal analysis of complex networks: Estonian network of payments
• Multifractal characterisation of particulate matter (PM10) time series in the Caribbean basin using visibility graphs
• Background PM10 atmosphere: In the seek of a multifractal characterization using complex networks
• Comparative Analysis of Box-Covering Algorithms for Fractal Networks
• Multifractality in random networks with power-law decaying bond strengths
• A Fixed-Mass multifractal approach for unweighted complex networks
• A computationally-efficient sandbox algorithm for multifractal analysis of large-scale complex networks with tens of millions of nodes
• Multifractality of complex networks is also due to geometry. The Geometric SandBox algorithm
• Bifractality of fractal scale-free networks
• Beyond traditional box-covering: Determining the fractal dimension of complex networks using a fixed number of boxes of flexible diameter
• Random walks on bifractal networks