Clustering of random scale-free networks

We derive the finite-size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent 2<γ<3. Degree heterogeneity increases the presence of triangles in the network up to levels that compare to those found in many...

Full description

Saved in:
Bibliographic Details
Published in:Physical review. E, Statistical, nonlinear, and soft matter physics Vol. 86; no. 2; pp. 026120 - 26124
Main Authors: Colomer-de-Simon, Pol, Boguñá, Marián
Format: Journal Article
Language:English
Published: United States American Physical Society 30.08.2012
Subjects:
Algorithms
Cluster Analysis
Complex systems
Computer networks
Computer Simulation
Markov Chains
Models, Neurological
Models, Statistical
Models, Theoretical
Nerve Net - physiology
Physics - methods
Probability
Sistemes complexos
Thermodynamics
Xarxes d'ordinadors
ISSN:1539-3755, 1550-2376, 1550-2376
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We derive the finite-size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent 2<γ<3. 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 γ≈2, clustering is virtually size independent and, at the same time, becomes a 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1539-3755
1550-2376
1550-2376
DOI:10.1103/PhysRevE.86.026120