Graph diameter in long-range percolation
arXiv:math/0406379 · doi:10.1002/rsa.20349
Abstract
We study the asymptotic growth of the diameter of a graph obtained by adding sparse "long" edges to a square box in . We focus on the cases when an edge between and is added with probability decaying with the Euclidean distance as when . For we show that the graph diameter for the graph reduced to a box of side scales like where . In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance . We also show that a ball of radius in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius in the Euclidean metric.
17 pages, extends the results of arXiv:math.PR/0304418 to graph diameter, substantially revised and corrected, added a result on volume growth asymptotic
References in corpus (3)
Cited by in corpus (12)
- Rare region effects in the contact process on networks
- The growth of the infinite long-range percolation cluster
- Sharp asymptotic for the chemical distance in long-range percolation
- Genuine localisation transition in a long-range hopping model
- Long-range percolation on the hierarchical lattice
- Distances in percolation models for all dimensions
- Quenched Invariance Principle for a class of random conductance models with long-range jumps
- Arithmetic oscillations of the chemical distance in long-range percolation on
- Long-range contact process and percolation on a random lattice
- Isoperimetric lower bounds for critical exponents for long-range percolation
- Behavior of the distance exponent for long-range percolation
- Continuity of the critical value and a shape theorem for long-range percolation