Year: 2002
Type: article
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 approximately (ln N)(2)/N] and highly clustered (C=5/6) scale-free networks.
Authors: Konstantin Klemm, Víctor M. Eguíluz
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2042693705
