All spatial random graphs with weak long-range effects have chemical distance comparable to Euclidean distance

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)].