A lower bound for the chemical distance in sparse long-range percolation models

Abstract

We consider long-range percolation in dimension $d\ge 1$, where distinct sites $x$ and $y$ are connected with probability $p_{x,y}\in [0,1]$. Assuming that $p_{x,y}$ is translation invariant and that $p_{x,y}=\Vert x-y{\Vert }^{-s+o(1)}$ with $s>2d$, we show that the graph distance is at least linear with the Euclidean distance.

9 pages

References in corpus (2)

• On the scaling of the chemical distance in long-range percolation models
• Transience, Recurrence and Critical Behavior for Long-Range Percolation

Cited by in corpus (7)

• The growth of the infinite long-range percolation cluster
• Arithmetic oscillations of the chemical distance in long-range percolation on ${\mathbb{Z}}^d$
• Graph distances in scale-free percolation: the logarithmic case
• Graph distances of continuum long-range percolation
• Scale-free percolation
• Inhomogeneous Long-Range Percolation for Real-Life Network Modeling
• Percolation on fitness landscapes: effects of correlation, phenotype, and incompatibilities