Growing scale-free networks with small-world behavior

Konstantin Klemm, Víctor M. Eguíluz

Research output: Contribution to journalArticle

231 Citations (Scopus)

Abstract

In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [formula presented] and highly clustered [formula presented] scale-free networks.

Original languageEnglish
Number of pages1
JournalPhysical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics
Volume65
Issue number5
DOIs
Publication statusPublished - Jan 1 2002

Fingerprint

Growing Networks
Clustering Coefficient
Small World
Scale-free Networks
Random Networks
Path Length
Dynamical Model
Shortest path
Limiting
coefficients
Context

ASJC Scopus subject areas

  • Statistical and Nonlinear Physics
  • Mathematical Physics
  • Condensed Matter Physics
  • Physics and Astronomy(all)

Cite this

Growing scale-free networks with small-world behavior. / Klemm, Konstantin; Eguíluz, Víctor M.

In: Physical Review E - Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, Vol. 65, No. 5, 01.01.2002.

Research output: Contribution to journalArticle

@article{692e25f320074225842c889949c77577,
title = "Growing scale-free networks with small-world behavior",
abstract = "In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [formula presented] and highly clustered [formula presented] scale-free networks.",
author = "Konstantin Klemm and Egu{\'i}luz, {V{\'i}ctor M.}",
year = "2002",
month = "1",
day = "1",
doi = "10.1103/PhysRevE.65.057102",
language = "English",
volume = "65",
journal = "Physical review. E",
issn = "2470-0045",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Growing scale-free networks with small-world behavior

AU - Klemm, Konstantin

AU - Eguíluz, Víctor M.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [formula presented] and highly clustered [formula presented] scale-free networks.

AB - In the context of growing networks, we introduce a simple dynamical model that unifies the generic features of real networks: scale-free distribution of degree and the small-world effect. While the average shortest path length increases logarithmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive analytical expressions for the clustering coefficient in two limiting cases: random [formula presented] and highly clustered [formula presented] scale-free networks.

UR - http://www.scopus.com/inward/record.url?scp=85035291521&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85035291521&partnerID=8YFLogxK

U2 - 10.1103/PhysRevE.65.057102

DO - 10.1103/PhysRevE.65.057102

M3 - Article

VL - 65

JO - Physical review. E

JF - Physical review. E

SN - 2470-0045

IS - 5

ER -