Clustering of random scale-free networks

Pol Colomer-de-Simon and Marián Boguñá
Phys. Rev. E 86, 026120 – Published 30 August 2012

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 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.

  • Figure
  • Figure
  • Figure
  • Received 17 May 2012

DOI:https://doi.org/10.1103/PhysRevE.86.026120

©2012 American Physical Society

Authors & Affiliations

Pol Colomer-de-Simon and Marián Boguñá

  • Departament de Física Fonamental, Universitat de Barcelona, Martí i Franquès 1, 08028 Barcelona, Spain

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 86, Iss. 2 — August 2012

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×