Scaling and Percolation in the Small-World Network Model
AbstractIn this paper we study the small-world network model of Watts and Strogatz, which mimics some aspects of the structure of networks of social interactions. We argue that there is one non-trivial length-scale in the model, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit. This length-scale governs the cross-over from large- to small-world behavior in the model, as well as the number of vertices in a neighborhood of given radius on the network. We derive the value of the single critical exponent controlling behavior in the critical region and the finite size scaling form for the average vertex-vertex distance on the network, and, using series expansion and Pade approximants, find an approximate analytic form for the scaling function. We calculate the effective dimension of small-world graphs and show that this dimension varies as a function of the length-scale on which it is measured, in a manner reminiscent of multifractals. We also study the problem of site percolation on small-world networks as a simple model of disease propagation, and derive an approximate expression for the percolation probability at which a giant component of connected vertices first forms (in epidemiological terms, the point at which an epidemic occurs). The typical cluster radius satisfies the expected finite size scaling form with a cluster size exponent close to that for a random graph. All our analytic results are confirmed by extensive numerical simulations of the model. Appears in Phys. Rev. E 60, 7332-7342 (1999).
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.
Bibliographic InfoPaper provided by Santa Fe Institute in its series Working Papers with number 99-05-034.
Date of creation: May 1999
Date of revision:
Contact details of provider:
Postal: 1399 Hyde Park Road, Santa Fe, New Mexico 87501
Web page: http://www.santafe.edu/sfi/publications/working-papers.html
More information through EDIRC
Small world; social interaction; networks; graph theory; phase transitions; percolation;
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Li, Chunguang, 2009. "Memorizing morph patterns in small-world neuronal network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(2), pages 240-246.
- Delre, S.A. & Jager, W. & Bijmolt, T.H.A. & Janssen, M.A., 2007. "Targeting and timing promotional activities: An agent-based model for the takeoff of new products," Journal of Business Research, Elsevier, vol. 60(8), pages 826-835, August.
- Uwe Cantner & Andreas Meder, 2006. "Die Wirkung von Forschungskooperationen auf den Unternehmenserfolg - eine Fallstudie zum Landkreis Saalfeld Rudolstadt," Jenaer Schriften zur Wirtschaftswissenschaft 24/2006, Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät.
- Grabowski, Franciszek, 2010. "Logistic equation of arbitrary order," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(16), pages 3081-3093.
- Cristopher Moore & M. E. J. Newman, 2000. "Exact Solution of Site and Bond Percolation on Small-World Networks," Working Papers 00-01-007, Santa Fe Institute.
- Zheng, Yan Hong & Lu, Qi Shao, 2008. "Spatiotemporal patterns and chaotic burst synchronization in a small-world neuronal network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(14), pages 3719-3728.
- Lu, Zhe-Ming & Guo, Shi-Ze, 2012. "A small-world network derived from the deterministic uniform recursive tree," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 87-92.
- Doménech, Antonio, 2009. "A topological phase transition between small-worlds and fractal scaling in urban railway transportation networks?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(21), pages 4658-4668.
- Alfarano, Simone & Milakovic, Mishael, 2009. "Network structure and N-dependence in agent-based herding models," Journal of Economic Dynamics and Control, Elsevier, vol. 33(1), pages 78-92, January.
- Lahtinen, Jani & Kertész, János & Kaski, Kimmo, 2005. "Sandpiles on Watts–Strogatz type small-worlds," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 349(3), pages 535-547.
- Floortje Alkemade & Carolina Castaldi, 2005. "Strategies for the Diffusion of Innovations on Social Networks," Computational Economics, Society for Computational Economics, vol. 25(1), pages 3-23, February.
- Zengwang Xu & Daniel Sui, 2007. "Small-world characteristics on transportation networks: a perspective from network autocorrelation," Journal of Geographical Systems, Springer, vol. 9(2), pages 189-205, June.
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.