Clustering of random scale-free networks
arXiv:1205.2877 · doi:10.1103/PhysRevE.86.026120
Abstract
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent . Degree heterogeneity increases the presence of triangles in the network up to levels that compare to those found in many real networks even for extremely large nets. We also find that for values of , clustering is virtually size independent and, at the same time, becomes a {\it de facto} non self-averaging topological property. This implies that a single instance network is not representative of the ensemble even for very large network sizes.
References in corpus (17)
- Generation of uncorrelated random scale-free networks
- Class of correlated random networks with hidden variables
- Entropy measures for complex networks: Toward an information theory of complex topologies
- Self-similarity of complex networks and hidden metric spaces
- Cut-offs and finite size effects in scale-free networks
- The origin of degree correlations in the Internet and other networks
- Maximum likelihood: extracting unbiased information from complex networks
- Efficient and exact sampling of simple graphs with given arbitrary degree sequence
- All scale-free networks are sparse
- Clustering in complex networks. I. General formalism
- The Shannon and the Von Neumann entropy of random networks with heterogeneous expected degree
- Rate equation approach for correlations in growing network models
- Uncorrelated Random Networks
- Loops structure of the Internet at the Autonomous System Level
- Percolation in self-similar networks
- Effect of degree correlations on the loop structure of scale-free networks
- Bias in generation of random graphs
Cited by in corpus (18)
- Scale-free networks with exponent one
- Local clustering in scale-free networks with hidden variables
- Critical behavior of the contact process on small-world networks
- Statistical Mechanics of Multi-Edge Networks
- Clustering Spectrum of scale-free networks
- Detecting hyperbolic geometry in networks: why triangles are not enough
- Duality between equilibrium and growing networks
- A geometry-induced topological phase transition in random graphs
- Fluctuations analysis in complex networks modeled by hidden variable models. Necessity of a large cut-off in hidden-variable models
- Scale-free network clustering in hyperbolic and other random graphs
- Hamiltonian Dynamics of Preferential Attachment
- Random graphs and real networks with weak geometric coupling
- Degree correlations in scale-free null models
- Exactly scale-free scale-free networks
- Fluctuations of motifs and non self-averaging in complex networks. A self- vs non-self-averaging phase transition scenario
- Sharpest possible clustering bounds using robust random graph analysis
- Factorization threshold models for scale-free networks generation
- Robust subgraph counting with distribution-free random graph analysis