Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Sattenspiel, C. Simon (1988)
The spread and persistence of infectious diseases in structured populationsBellman Prize in Mathematical Biosciences, 90
M. Newman, D. Watts (1999)
Renormalization Group Analysis of the Small-World Network ModelPhysics Letters A, 263
D. Watts, S. Strogatz (1998)
Collective dynamics of ‘small-world’ networksNature, 393
I. Longini (1988)
A mathematical model for predicting the geographic spread of new infectious agentsBellman Prize in Mathematical Biosciences, 90
We use the capital letter D to denote the dimension here, to distinguish it from the dimension d of the underlying lattice defined in Section II
Jonathan Machta, Yong-soo Choi, A. Lucke, T. Schweizer, L. Chayes (1995)
Invaded cluster algorithm for equilibrium critical points.Physical review letters, 75 15
T. Valente (1996)
Social network thresholds in the diffusion of innovationsSocial Networks, 18
D. Stauffer, A. Aharony, S. Redner (2018)
Introduction To Percolation Theory
N. Alon, J. Spencer (1992)
The Probabilistic Method
We are indebted to Prof. S. H. Strogatz for suggesting the use of a Padé approximant in this context
James Hanson, J. Kephart (1999)
Combatting Maelstroms in Networks of Communicating Agents
(1974)
Asymptotic Analysis of Coefficients
M. Barthelemy, L. Amaral (1999)
Small-World Networks: Evidence for a Crossover PicturePhysical Review Letters, 82
D. Strang (1991)
Adding Social Structure to Diffusion ModelsSociological Methods & Research, 19
T. Halsey, M. Jensen, L. Kadanoff, I. Procaccia, B. Shraiman (1987)
Fractal measures and their singularities: The characterization of strange sets.Physical review. A, General physics, 33 2
A naive recursive cluster-finding algorithm by contrast takes time proportional to L 2
A. Barrat (1999)
Comment on ``Small-world networks: Evidence for a crossover picture''arXiv: Statistical Mechanics
D. Mechanic, J. Coleman, E. Katz, H. Menzel (1967)
Medical Innovation: A Diffusion Study.American Sociological Review, 32
Sharon Milgram (1967)
The Small World ProblemPsychology today, 2
Jie Wu, Duncan Watts (1999)
Small Worlds: The Dynamics of Networks between Order and Randomness
R. Monasson (1999)
Diffusion, localization and dispersion relations on “small-world” latticesThe European Physical Journal B - Condensed Matter and Complex Systems, 12
J. Kephart, Steve White (1991)
Directed-graph epidemiological models of computer virusesProceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy
M. Menezes, C. Moukarzel, T. Penna (1999)
First-order transition in small-world networksEPL, 50
M. Newman, G. Barkema (1999)
Monte Carlo Methods in Statistical Physics
Cristopher Moore, M. Newman (2000)
Exact solution of site and bond percolation on small-world networks.Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 62 5 Pt B
B. Mandelbrot (1974)
Intermittent turbulence in self-similar cascades: divergence of high moments and dimension of the carrierJournal of Fluid Mechanics, 62
G. Barkema, M. Newman (1997)
New Monte Carlo Algorithms for Classical Spin SystemsAdvances in Chemical Physics, 105
(1995)
and L
M. Kretzschmar, M. Morris (1996)
Measures of concurrency in networks and the spread of infectious disease.Mathematical biosciences, 133 2
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 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 Padé 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.
Physical Review E – American Physical Society (APS)
Published: Dec 1, 1999
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.