Fractality and degree correlations in scale-free networks
arXiv:1701.03606 · doi:10.1140/epjb/e2017-80031-x
Abstract
Fractal scale-free networks are empirically known to exhibit disassortative degree mixing. It is, however, not obvious whether a negative degree correlation between nearest neighbor nodes makes a scale-free network fractal. Here we examine the possibility that disassortativity in complex networks is the origin of fractality. To this end, maximally disassortative (MD) networks are prepared by rewiring edges while keeping the degree sequence of an initial uncorrelated scale-free network that is guaranteed to become fractal by rewiring edges. Our results show that most of MD networks with different topologies are not fractal, which demonstrates that disassortativity does not cause the fractal property of networks. In addition, we suggest that fractality of scale-free networks requires a long-range repulsive correlation in similar degrees.
arXiv comment9 pages, 7 figures
References in corpus (26)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Epidemic processes in complex networks
- Random graphs with arbitrary degree distributions and their applications
- Mixing patterns in networks
- Specificity and stability in topology of protein networks
- Critical phenomena in complex networks
- Self-similarity of complex networks
- Mitigation of Malicious Attacks on Networks
- Origins of fractality in the growth of complex networks
- Pseudofractal Scale-free Web
- A small-world of weak ties provides optimal global integration of self-similar modules in functional brain networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Entangled networks, synchronization, and optimal network topology
- Fractal and Transfractal Recursive Scale-Free Nets
- The entropic origin of disassortativity in complex networks
- Uncovering disassortativity in large scale-free networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Self-similar Scale-free Networks and Disassortativity
- Scaling of degree correlations and the influence on diffusion in scale-free networks
- Zero Pearson Coefficient for Strongly Correlated Growing Trees
- Smallest small-world network
- Spectral distances on graphs
- Measuring degree-degree association in networks
- Disassortativity of random critical branching trees
Cited by in corpus (10)
- Disassortativity of percolating clusters in random networks
- Scaling theory of fractal complex networks
- A general formulation of long-range degree correlations in complex networks
- Structure of percolating clusters in random clustered networks
- Emergence of Long-Range Correlations in Random Networks
- Analytic solution of the two-star model with correlated degrees
- Identification of intrinsic long-range degree correlations in complex networks
- Percolation on a maximally disassortative network
- Bifractality of fractal scale-free networks
- Simple model of fractal networks formed by self-organized critical dynamics