arXiv · cond-mat/9909165
Mean-field solution of the small-world network model
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. E. J. Newman, C. Moore, D. J. Watts. 1999-09-21. Mean-field solution of the small-world network model. https://doi.org/10.1103/physrevlett.84.3201
Cite the original work for its findings. Save a collection to share your selection of sources.