Clustering of correlated networks
- 27 February 2004
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 69 (2) , 027104
- https://doi.org/10.1103/physreve.69.027104
Abstract
We obtain the clustering coefficient, the degree-dependent local clustering, and the mean clustering of networks with arbitrary correlations between the degrees of the nearest-neighbor vertices. The resulting formulas allow one to determine the nature of the clustering of a network.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsPublished by Elsevier ,2013
- Mean-field theory for clustering coefficients in Barabási-Albert networksPhysical Review E, 2003
- Origin of degree correlations in the Internet and other networksPhysical Review E, 2003
- Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlationsPhysical Review E, 2003
- Structural transitions in scale-free networksPhysical Review E, 2003
- Topology and correlations in structured scale-free networksPhysical Review E, 2003
- Correlated Random NetworksPhysical Review Letters, 2002
- Scale-free topology of e-mail networksPhysical Review E, 2002
- Hierarchical Organization of Modularity in Metabolic NetworksScience, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002