Exact results and scaling properties of small-world networks
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsPublished 1 April 2000Open access
Rahul Kulkarni, Eivind Almaas, D. Stroud
Citations50
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Using the general form of this distribution function for minimal paths in small-world networks, exact expressions for the average minimal distance &lmacr; and its variance sigma(2) are derived.
Abstract
We study the distribution function for minimal paths in small-world networks. We derive its general form, which we verify numerically, and also discuss its scaling properties. Using the general form of this distribution function, we derive exact expressions for the average minimal distance &lmacr; and its variance sigma(2). Finally, we study the limit of large system sizes and obtain some approximate results.
Keywords
Computer ScienceMathematicsPhysics and Astronomy
NatureCollective dynamics of ‘small-world’ networks
43,160 Citations1998Duncan J. Watts, Steven H. Strogatz
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Springer series in synergeticsChemical Oscillations, Waves, and Turbulence
7,124 Citations1984Yoshiki Kuramoto
NatureDiameter of the World-Wide Web
4,285 Citations1999Réka Albert, Hawoong Jeong +1 more
The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it.
Physica A Statistical Mechanics and its ApplicationsMean-field theory for scale-free random networks
2,251 Citations1999Albert-Ĺaszló Barabási, Réka Albert +1 more
A mean-field method is developed to predict the growth dynamics of the individual vertices of the scale-free model, and this is used to calculate analytically the connectivity distribution and the scaling exponents.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsScaling and percolation in the small-world network model
1,213 Citations1999M. E. J. Newman, Duncan J. Watts
There is one nontrivial length-scale in the small-world network model of Watts and Strogatz, 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.
Physical Review LettersSmall-World Networks: Evidence for a Crossover Picture
303 Citations1999Marc Barthélemy, Luı́s A. Nunes Amaral
The hypothesis that the appearance of small-world behavior is not a phase transition but a crossover phenomenon which depends both on the network size and on the degree of disorder is tested.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsMonte Carlo simulations of the violation of the fluctuation-dissipation theorem in domain growth processes
155 Citations1998Alain Barrat
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsSpreading and shortest paths in systems with sparse long-range connections
112 Citations1999Cristian F. Moukarzel
From this,
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsCharacterization and control of small-world networks
91 Citations1999Sagar A. Pandit, R. E. Amritkar
The concept of a "faraway" connection in a network is concretized by defining a far edge, which is algorithmic and independent of any external parameters such as topology of the underlying space of the network.
Physical Review LettersErratum: Small-World Networks: Evidence for a Crossover Picture [Phys. Rev. Lett. 82, 3180 (1999)]
78 Citations1999Marc Barthélemy, Luı́s A. Nunes Amaral