Mean-Field Solution of the Small-World Network Model

M. E. J. Newman, C. Moore and D. J. Watts

Working Papers from Santa Fe Institute

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: Small worlds; social networks; mean-field theory. (search for similar items in EconPapers)
Date: 1999-09
New Economics Papers: this item is included in nep-evo and nep-ind
References: View references in EconPapers View complete reference list from CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:safiwp:99-09-066

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel (krichel@openlib.org).