Work

Growing scale-free networks with small-world behavior

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.
Language: English
Open Access status: bronze
OpenAlex ID: W2042693705
FWCI: 8.681
Cites: 20
Cited by: 395
Related to: 9