Flexible construction of hierarchical scale-free networks with general exponent
arXiv:cond-mat/0409119 · doi:10.1103/PhysRevE.71.036132
Abstract
Extensive studies have been done to understand the principles behind architectures of real networks. Recently, evidences for hierarchical organization in many real networks have also been reported. Here, we present a new hierarchical model which reproduces the main experimental properties observed in real networks: scale-free of degree distribution (frequency of the nodes that are connected to other nodes decays as a power-law ) and power-law scaling of the clustering coefficient . The major novelties of our model can be summarized as follows: {\it (a)} The model generates networks with scale-free distribution for the degree of nodes with general exponent , and arbitrarily close to any specified value, being able to reproduce most of the observed hierarchical scale-free topologies. In contrast, previous models can not obtain values of . {\it (b)} Our model has structural flexibility because {\it (i)} it can incorporate various types of basic building blocks (e.g., triangles, tetrahedrons and, in general, fully connected clusters of nodes) and {\it (ii)} it allows a large variety of configurations (i.e., the model can use more than copies of basic blocks of nodes). The structural features of our proposed model might lead to a better understanding of architectures of biological and non-biological networks.
arXiv commentRevTeX, 5 pages, 4 figures
References in corpus (18)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Community structure in social and biological networks
- Finding and evaluating community structure in networks
- Assortative mixing in networks
- The architecture of complex weighted networks
- Hierarchical organization of modularity in metabolic networks
- The large-scale organization of metabolic networks
- Classes of behavior of small-world networks
- Specificity and stability in topology of protein networks
- Mean-field theory for scale-free random networks
- Hierarchical Organization in Complex Networks
- Dynamical and correlation properties of the Internet
- Large-scale topological and dynamical properties of Internet
- Deterministic Scale-Free Networks
- A Geometric Fractal Growth Model for Scale Free Networks
- Assortative model for social networks
- Clustering under the line graph transformation: Application to reaction network
Cited by in corpus (7)
- Exact calculations of first-passage quantities on recursive networks
- A general geometric growth model for pseudofractal scale-free web
- Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Deterministic weighted scale-free small-world networks
- Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions
- Scale-free networks with a large- to hypersmall-world transition
- Deterministic scale-free networks created in a recursive manner