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 is a transitive graph of polynomial growth and , then for any two sites of which are connected by a -open path, the chemical distance from to is at most a constant times the original graph distance, except with probability exponentially small in the distance from to . We also prove a similar theorem for general Cayley graphs of finitely presented groups, for 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 away from .
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