On the scaling of the chemical distance in long-range percolation models

Abstract

We consider the (unoriented) long-range percolation on Z^d in dimensions d\ge1, where distinct sites x,y\in Z^d get connected with probability p_{xy}\in[0,1]. Assuming p_{xy}=|x-y|^{-s+o(1)} as |x-y|\to\infty, where s>0 and |\cdot| is a norm distance on Z^d, and supposing that the resulting random graph contains an infinite connected component C_{\infty}, we let D(x,y) be the graph distance between x and y measured on C_{\infty}. Our main result is that, for s\in(d,2d), D(x,y)=(\log|x-y|)^{Δ+o(1)},\qquad x,y\in C_{\infty}, |x-y|\to\infty, where Δ^{-1} is the binary logarithm of 2d/s and o(1) is a quantity tending to zero in probability as |x-y|\to\infty. Besides its interest for general percolation theory, this result sheds some light on a question that has recently surfaced in the context of ``small-world'' phenomena. As part of the proof we also establish tight bounds on the probability that the largest connected component in a finite box contains a positive fraction of all sites in the box.

Published at http://dx.doi.org/10.1214/009117904000000577 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (26)

• Critical phenomena in complex networks
• The acceleration of evolutionary spread by long-range dispersal
• Geographical threshold graphs with small-world and scale-free properties
• Physical realizability of small-world networks
• A lower bound for the chemical distance in sparse long-range percolation models
• A geometry-induced topological phase transition in random graphs
• Switchover phenomenon induced by epidemic seeding on geometric networks
• Distances in $\frac{1}{|x-y{|}^{2d}}$ percolation models for all dimensions
• Arithmetic oscillations of the chemical distance in long-range percolation on ${\mathbb{Z}}^d$
• One-dimensional long-range diffusion-limited aggregation I
• Universal scaling in real dimension
• Cluster-size decay in supercritical long-range percolation
• Euclidean and chemical distances in ellipses percolation
• All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance
• Behavior of the distance exponent for $\frac{1}{|x-y{|}^{2d}}$ long-range percolation
• Isoperimetric lower bounds for critical exponents for long-range percolation
• Long-range contact process and percolation on a random lattice
• Percolation in a hierarchical random graph
• Scale-free percolation in continuum space: quenched degree and clustering coefficient
• Long Range Percolation Mixing Time
• On the chemical distance exponent for the two-sided level-set of the 2D Gaussian free field
• Chemical distance in geometric random graphs with long edges and scale-free degree distribution
• Continuity of the critical value and a shape theorem for long-range percolation
• Disordered statistical physics in low dimensions: extremes, glass transition, and localization
• Scale-free percolation
• omega-Periodic graphs