Mean-field solution of the small-world network model
Statistical Mechanics
2009-10-31 v2 Disordered Systems and Neural Networks
Abstract
The small-world network model is a simple model of the structure of social networks, which simultaneously possesses characteristics of both regular lattices and random graphs. The model consists of a one-dimensional lattice with a low density of shortcuts added between randomly selected pairs of points. These shortcuts greatly reduce the typical path length between any two points on the lattice. We present a mean-field solution for the average path length and for the distribution of path lengths in the model. This solution is exact in the limit of large system size and either large or small number of shortcuts.
Keywords
Cite
@article{arxiv.cond-mat/9909165,
title = {Mean-field solution of the small-world network model},
author = {M. E. J. Newman and C. Moore and D. J. Watts},
journal= {arXiv preprint arXiv:cond-mat/9909165},
year = {2009}
}
Comments
14 pages, 2 postscript figures