Multifractal analysis of weighted networks by a modified sandbox algorithm
arXiv:1511.07248 · doi:10.1038/srep17628
Abstract
Complex networks have attracted growing attention in many fields. As a generalization of fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. Some algorithms for MFA of unweighted complex networks have been proposed in the past a few years, including the sandbox (SB) algorithm recently employed by our group. In this paper, a modified SB algorithm (we call it SBw algorithm) is proposed for MFA of weighted networks.First, we use the SBw algorithm to study the multifractal property of two families of weighted fractal networks (WFNs): "Sierpinski" WFNs and "Cantor dust" WFNs. We also discuss how the fractal dimension and generalized fractal dimensions change with the edge-weights of the WFN. From the comparison between the theoretical and numerical fractal dimensions of these networks, we can find that the proposed SBw algorithm is efficient and feasible for MFA of weighted networks. Then, we apply the SBw algorithm to study multifractal properties of some real weighted networks ---collaboration networks. It is found that the multifractality exists in these weighted networks, and is affected by their edge-weights.
arXiv comment15 pages, 6 figures. Accepted for publication by Scientific Reports
References in corpus (20)
- Emergence of scaling in random networks
- Analysis of weighted networks
- Self-similarity of complex networks
- Origins of fractality in the growth of complex networks
- Analysis of the Airport Network of India as a complex weighted network
- Scaling theory of transport in complex networks
- Measure representation and multifractal analysis of complete genomes
- A box-covering algorithm for fractal scaling in scale-free networks
- Multifractality in Time Series
- Determination of multifractal dimensions of complex networks by means of the sandbox algorithm
- Weighted Fractal Networks
- Spectral dimensions of hierarchical scale-free networks with shortcuts
- Multifractality of complex networks
- Fractal and multifractal properties of a family of fractal networks
- Multifractal analysis of complex networks
- Recognition of an organism from fragments of its complete genome
- Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions
- Fractal and complex network analyses of protein molecular dynamics
- Multifractal characterisation of length sequences of coding and noncoding segments in a complete genome
- Statistical Self-Similar Properties of Complex Networks
Cited by in corpus (3)
- Fractal and multifractal analysis of complex networks: Estonian network of payments
- 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