Scaling and percolation in the small-world network model.

@article{Newman1999ScalingAP,
  title={Scaling and percolation in the small-world network model.},
  author={Mark E. J. Newman and Duncan J. Watts},
  journal={Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics},
  year={1999},
  volume={60 6 Pt B},
  pages={
          7332-42
        }
}
  • M. Newman, D. Watts
  • Published 28 April 1999
  • Mathematics, Physics, Medicine
  • Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
In 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 nontrivial 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 crossover… 
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
Scaling properties of random walks on small-world networks.
TLDR
This work studies the behavior of a random walker on a one-dimensional small-world network and finds that the random walk obeys a characteristic scaling form that has three characteristic time regimes.
Scaling properties of a random walk on small-world networks with an open boundary
We study the behaviors of a random walk on two-dimensional small-world networks with an open boundary, where the random walker starts at a random chosen site and eventually falls off the edge. Using
The Mixing Time of the Newman-Watts Small-World Model
TLDR
The principal contribution of this paper is to show that for a famous small-world random graph model known as the Newman-Watts small- world model, the mixing time is of order log2 n.
Structural properties of scale‐free networks
Many networks have been reported recently to follow a scalefre degree distribution in which the fraction of sites having k connections follows a power law: P (k) = k . In this chapter we study the
Critical behavior of propagation on small-world networks.
  • D. Zanette
  • Mathematics, Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
We report numerical evidence that an epidemiclike model, which can be interpreted as the propagation of a rumor, exhibits critical behavior at a finite randomness of the underlying small-world
Mean-field solution of the small-world network model.
TLDR
A mean-field solution for the average path length and for the distribution of path lengths in the small-world network model is presented, which is exact in the limit of large system size and either a large or small number of shortcuts.
Dynamical scaling behavior of percolation clusters in scale-free networks.
TLDR
A replica formalism is used to develop analytically, based on an integral equation, a systematic way to determine the ensemble averaged eigenvalue spectrum for a general type of treelike networks.
PARALLELISM AND COMPLEXITY OF A SMALL-WORLD NETWORK MODEL
TLDR
The outcome of this study is the realization of a neuronal-axon network simulator that exhibits small-world characteristics of clustering with a logarithmic degree of separation between nodes without the need for long-range communication edges.
Random spreading phenomena in annealed small world networks
Here we study simple random walk dynamics in an annealed version of a small world network (SWN) consisting of N nodes. This is done by calculating the mean number of distinct sites visited, S(t), and
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 27 REFERENCES
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.
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.
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
Introduction to percolation theory
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in
Fractal measures and their singularities: The characterization of strange sets.
Abstract We propose a description of normalized distributions (measures) lying upon possibly fractal sets; for example those arising in dynamical systems theory. We focus upon the scaling properties
Measures of concurrency in networks and the spread of infectious disease.
An investigation is made into the impact of concurrent partnerships on epidemic spread. Starting from a definition of concurrency on the level of individuals, the authors define ways to quantify
Small Worlds: The Dynamics of Networks between Order and Randomness
small worlds the dynamics of networks between order and. download small worlds the dynamics of networks between. small worlds and the dynamics of networks. small world networks oxford handbooks.
Erratum: Fractal measures and their singularities: The characterization of strange sets
TLDR
A description of normalized distributions (measures) lying upon possibly fractal sets; for example those arising in dynamical systems theory, focusing upon the scaling properties of such measures, which are characterized by two indices: \ensuremath{\alpha}, which determines the strength of their singularities; and f, which describes how densely they are distributed.
Directed-graph epidemiological models of computer viruses
  • J. Kephart, S. R. White
  • Computer Science
    Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
  • 1991
TLDR
It is concluded that an imperfect defense against computer viruses can still be highly effective in preventing their widespread proliferation, provided that the infection rate does not exceed a well-defined critical epidemic threshold.
Social network thresholds in the diffusion of innovations
Abstract Threshold models have been postulated as one explanation for the success or failure of collective action and the diffusion of innovations. The present paper creates a social network
...
1
2
3
...