All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance
arXiv:2412.12796 · doi:10.1007/s10959-025-01467-0
Abstract
This note provides a sufficient condition for linear lower bounds on chemical distances (compared to the Euclidean distance) in general spatial random graphs. The condition is based on the scarceness of long edges in the graph and weak correlations at large distances and is valid for all translation invariant and locally finite graphs that fulfil these conditions. The proof is based on a renormalisation scheme introduced by Berger [arXiv: 0409021 (2004)].
16 pages
References in corpus (7)
- On the scaling of the chemical distance in long-range percolation models
- On chemical distances and shape theorems in percolation models with long-range correlations
- On the internal distance in the interlacement set
- Large deviations for the chemical distance in supercritical Bernoulli percolation
- Recurrence versus Transience for Weight-Dependent Random Connection Models
- Ellipses Percolation
- Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension