Growing scale-free networks with tunable clustering

Petter Holme and Beom Jun Kim
Phys. Rev. E 65, 026107 – Published 11 January 2002
PDFExport Citation

Abstract

We extend the standard scale-free network model to include a “triad formation step.” We analyze the geometric properties of networks generated by this algorithm both analytically and by numerical calculations, and find that our model possesses the same characteristics as the standard scale-free networks such as the power-law degree distribution and the small average geodesic length, but with the high clustering at the same time. In our model, the clustering coefficient is also shown to be tunable simply by changing a control parameter—the average number of triad formation trials per time step.

  • Received 21 September 2001

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

©2002 American Physical Society

Authors & Affiliations

Petter Holme* and Beom Jun Kim

  • Department of Theoretical Physics, Umeȧ University, 901 87 Umeȧ, Sweden

  • *Electronic address: holme@tp.umu.se
  • Electronic address: kim@tp.umu.se

References (Subscription Required)

Click to Expand
Issue

Vol. 65, Iss. 2 — February 2002

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
×