Growing Scale-Free Networks with Small World Behavior

Preprint

30 July 2001

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.cond-mat/0107607

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 logartihmically as in random networks, the clustering coefficient assumes a large value independent of system size. We derive expressions for the clustering coefficient in two limiting cases: random (C ~ (ln N)^2 / N) and highly clustered (C = 5/6) scale-free networks.

Keywords

DISTRIBUTION OF DEGREE
CLUSTERING COEFFICIENT
SCALE FREE NETWORKS
GROWING NETWORKS
WORLD BEHAVIOR
GROWING SCALE
SMALL WORLD

All Related Versions

Version 1, 2001-07-30, ArXiv
Published version: Physical Review E, 65 (5), 057102.

This publication has 0 references indexed in Scilit: