Mean-field solution of the small-world network model.

@article{Newman2000MeanfieldSO,
  title={Mean-field solution of the small-world network model.},
  author={Mark E. J. Newman and Cristopher Moore and Duncan J. Watts},
  journal={Physical review letters},
  year={2000},
  volume={84 14},
  pages={
          3201-4
        }
}
The small-world network model is a simple model of the structure of social networks, which 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… 

Figures and Topics from this paper

Discrete small world networks
Small world models are networks consisting of many local links and fewer long range `shortcuts', used to model networks with a high degree of local clustering but relatively small diameter. Here, we
The clustering coefficient and the diameter of small-world networks
The small-world network, proposed by Watts and Strogatz, has been extensively studied for the past over ten years. In this paper, a generalized small-world network is proposed, which extends several
Average path length in random networks.
TLDR
The result for 2<alpha<3 shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing than ultra-small world behavior noticed in pure scale- free structures and for large system sizes N-->infinity there is a saturation effect for the average path length.
Small worlds
TLDR
This paper considers some particular instances of small world models, and rigorously investigates the distribution of their inter-point network distances, framed in terms of approximations, whose accuracy increases with the size of the network.
Small-world network models and their average path length
Small-World Network Models and Their Average Path Length Samah Taha Department of Mathematical Sciences, University of Stellenbosch, Private Bag X1, Matieland 7602, South Africa. Thesis: April 2014
A NOVEL SMALL-WORLD NETWORK MODEL: KEEPING CONNECTIVITY WITHOUT ADDING EDGES
Considering the problems of potentially generating a disconnected network in the WS small-world network model [Watts and Strogatz, Nature393, 440 (1998)] and of adding edges in the NW small-world
Long-Range connections based small-world network and its synchronizability
TLDR
This paper attempted to investigate some related questions by constructing a semi-random small-world network through only randomly adding 'long-range lattice distance connections' to a regular network, and confirmed that, the random coupling is the best candidate for such nonlocal coupling in the semi- random strategy.
Exact solution of site and bond percolation on small-world networks.
  • C. Moore, M. Newman
  • Mathematics, Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 2000
TLDR
An exact solution of the model for both site and bond percolation is given, including the position of thePercolation transition at which epidemic behavior sets in, the values of the critical exponents governing this transition, the mean and variance of the distribution of cluster sizes below the transition, and the size of the giant component (epidemic) above the transition.
Small-world graphs: characterization and alternative constructions
Small-world graphs are examples of random graphs which mimic empirically observed features of social networks. We propose an intrinsic definition of small-world graphs, based on a probabilistic
Structure of growing social networks.
  • E. Jin, M. Girvan, M. Newman
  • Computer Science, Medicine
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
Using computer simulations, it is found that models that incorporate all of these features reproduce many of the features of real social networks, including high levels of clustering or network transitivity and strong community structure in which individuals have more links to others within their community than to individuals from other communities.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 16 REFERENCES
Renormalization Group Analysis of the Small-World Network Model
We study the small-world network model, which mimics the transition between regular-lattice and random-lattice behavior in social networks of increasing size. We contend that the model displays a
Scaling and percolation in the small-world network model.
  • M. Newman, D. Watts
  • Mathematics, Physics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1999
TLDR
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.
On the properties of small-world network models
Abstract:We study the small-world networks recently introduced by Watts and Strogatz [Nature 393, 440 (1998)], using analytical as well as numerical tools. We characterize the geometrical properties
Collective dynamics of ‘small-world’ networks
TLDR
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.
First-order transition in small-world networks
The small-world transition is a first-order transition at zero density p of shortcuts, whereby the normalised shortest-path distance = /L undergoes a discontinuity in the thermodynamic limit. On
Spreading and shortest paths in systems with sparse long-range connections.
  • C. Moukarzel
  • Mathematics, Medicine
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1999
Spreading according to simple rules (e.g., of fire or diseases) and shortest-path distances are studied on d-dimensional systems with a small density p per site of long-range connections
Small-World Networks: Evidence for a Crossover Picture
Watts and Strogatz [Nature (London) 393, 440 (1998)] have recently introduced a model for disordered networks and reported that, even for very small values of the disorder $p$ in the links, the
The Small World Problem
Nonlinear Dynamics and Chaos
Nonlinear dynamics deals with more-or-less regular fluctuations in system variables caused by feedback intrinsic to the system (as opposed to external forces). Chaos is the most exotic form of
Phys
  • Rev. Lett. 82, 3180
  • 1999
...
1
2
...