Mean-Field Solution of the Small-World Network Model
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.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Sep 1999|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- A. Barrat & M. Weigt, 2000. "On the properties of small-world network models," The European Physical Journal B - Condensed Matter and Complex Systems, Springer, vol. 13(3), pages 547-560, 02.
When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-09-066. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.