Papers
Topics
Authors
Recent
Search
2000 character limit reached

Chemical distance in graphs of polynomial growth

Published 12 Jul 2025 in math.PR | (2507.09120v1)

Abstract: We prove an Antal-Pisztora type theorem for transitive graphs of polynomial growth. That is, we show that if $G$ is a transitive graph of polynomial growth and $p > p_c(G)$, then for any two sites $x, y$ of $G$ which are connected by a $p$-open path, the chemical distance from $x$ to $y$ is at most a constant times the original graph distance, except with probability exponentially small in the distance from $x$ to $y$. We also prove a similar theorem for general Cayley graphs of finitely presented groups, for $p$ 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 $p$ away from $p_c$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.