Self-similar Scale-free Networks and Disassortativity
arXiv:cond-mat/0507198 · doi:10.1103/PhysRevE.72.045105
Abstract
Self-similar networks with scale-free degree distribution have recently attracted much attention, since these apparently incompatible properties were reconciled in a paper by Song et al. by an appropriate box-counting method that enters the measurement of the fractal dimension. We study two genetic regulatory networks ({\it Saccharomyces cerevisiae} and {\it Escherichai coli} and show their self-similar and scale-free features, in extension to the datasets studied by Song et al. Moreover, by a number of numerical results we support the conjecture that self-similar scale-free networks are not assortative. From our simulations so far these networks seem to be disassortative instead. We also find that the qualitative feature of disassortativity is scale-invariant under renormalization, but it appears as an intrinsic feature of the renormalization prescription, as even assortative networks become disassortative after a sufficient number of renormalization steps.
arXiv comment4 pages, 6 figures
References in corpus (6)
Cited by in corpus (37)
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Skeleton and fractal scaling in complex networks
- Network Geometry
- Fractality in complex networks: critical and supercritical skeletons
- Betweenness Centrality of Fractal and Non-Fractal Scale-Free Model Networks and Tests on Real Networks
- Statistical properties of sampled networks by random walks
- Self-similarity, small-world, scale-free scaling, disassortativity, and robustness in hierarchical lattices
- Horizontal visibility graphs transformed from fractional Brownian motions: Topological properties versus Hurst index
- Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling
- Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
- Fractal scale-free networks resistant to disease spread
- Disassortativity of percolating clusters in random networks
- Renormalization flows in complex networks
- Scaling theory of fractal complex networks
- Fractality and degree correlations in scale-free networks
- A general formulation of long-range degree correlations in complex networks
- Observability transitions in correlated networks
- Topological fractal networks introduced by mixed degree distribution
- Metabolic networks are almost nonfractal: A comprehensive evaluation
- Structure of percolating clusters in random clustered networks
- Diffusion-annihilation proecesses in weighted scale-free networks with identical degree sequence
- Random Sequential Renormalization and Agglomerative Percolation in Networks: Application to Erd"os-R'enyi and Scale-free Graphs
- Transfinite fractal dimension of trees and hierarchical scale-free graphs
- Emergence of Long-Range Correlations in Random Networks
- Identification of intrinsic long-range degree correlations in complex networks
- Segregation in the annihilation of two-species reaction-diffusion processes on fractal scale-free networks
- Degree distributions under general node removal: Power-law or Poisson?
- Disassortativity of random critical branching trees
- Beyond traditional box-covering: Determining the fractal dimension of complex networks using a fixed number of boxes of flexible diameter
- Simple model of fractal networks formed by self-organized critical dynamics
- Model-based reconstruction of real-world fractal complex networks
- Optimal box-covering algorithm for fractal dimension of complex networks
- Hub-collision avoidance and leaf-node options algorithm for fractal dimension and renormalization of complex networks
- Universal scaling hypothesis of quantum spatial search in complex networks
- A Fractal and Scale-free Model of Complex Networks with Hub Attraction Behaviors
- Scaling Concepts in Graph Thoery: Self-Avoiding Walk on Fractal Complex Networks
- Modeling for evolving biological networks with scale-free connectivity, hierarchical modularity, and disassortativity