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 C∼(lnN)2/N and highly clustered (C=5/6) scale-free networks.
%0 Journal Article
%1 Klemm2002a
%A Klemm, Konstantin
%A Eguíluz, Víctor M.
%D 2002
%I American Physical Society
%J Physical Review E
%K graphs networks preferential-attachment scale-free small-world-network
%N 5
%P 057102
%R 10.1103/PhysRevE.65.057102
%T Growing scale-free networks with small-world behavior
%V 65
%X 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 C∼(lnN)2/N and highly clustered (C=5/6) scale-free networks.
@article{Klemm2002a,
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 [{C∼(lnN}){2/N}] and highly clustered (C=5/6) scale-free networks.},
added-at = {2011-06-09T18:31:45.000+0200},
author = {Klemm, Konstantin and Eguíluz, Víctor M.},
biburl = {https://www.bibsonomy.org/bibtex/29d376fb2b7157300f7682a7a63c05dd8/rincedd},
doi = {10.1103/PhysRevE.65.057102},
interhash = {4de04b081eaf761fae2a44ae46980e20},
intrahash = {9d376fb2b7157300f7682a7a63c05dd8},
journal = {Physical Review E},
keywords = {graphs networks preferential-attachment scale-free small-world-network},
number = 5,
pages = 057102,
publisher = {American Physical Society},
timestamp = {2011-06-09T18:31:45.000+0200},
title = {Growing scale-free networks with small-world behavior},
volume = 65,
year = 2002
}