English

Chemical distance in graphs of polynomial growth

Probability 2025-07-15 v1

Abstract

We prove an Antal-Pisztora type theorem for transitive graphs of polynomial growth. That is, we show that if GG is a transitive graph of polynomial growth and p>pc(G)p > p_c(G), then for any two sites x,yx, y of GG which are connected by a pp-open path, the chemical distance from xx to yy is at most a constant times the original graph distance, except with probability exponentially small in the distance from xx to yy. We also prove a similar theorem for general Cayley graphs of finitely presented groups, for pp sufficiently close to 1. Lastly, we show that all time constants for the chemical distance on the infinite supercritical cluster of a transitive graph of polynomial growth are Lipschitz continuous as a function of pp away from pcp_c.

Keywords

Cite

@article{arxiv.2507.09120,
  title  = {Chemical distance in graphs of polynomial growth},
  author = {Christian Gorski and Eviatar B. Procaccia},
  journal= {arXiv preprint arXiv:2507.09120},
  year   = {2025}
}

Comments

30 pages 4 figures