Spread-out percolation on transitive graphs of polynomial growth

TL;DR

This paper investigates the asymptotic behavior of the critical probability for percolation on expanded graphs derived from vertex-transitive graphs with polynomial growth, extending previous results and supporting a new notion of dimension in groups.

Contribution

It establishes the asymptotic relation between critical probability and degree for spread-out percolation on such graphs, generalizing prior work on lattice graphs.

Findings

Critical probability $p_c(G_r)$ behaves like $1/\mathrm{deg}(G_r)$ as $r\to\infty$

Extends known results from lattice graphs to broader classes of graphs

Supports a new group dimension concept in parallel research

Abstract

Let $G$ be a vertex-transitive graph of superlinear polynomial growth. Given $r>0$, let $G_r$ be the graph on the same vertex set as $G$, with two vertices joined by an edge if and only if they are at graph distance at most $r$ apart in $G$. We show that the critical probability $p_c(G_r)$ for Bernoulli bond percolation on $G_r$ satisfies $p_c(G_r) \sim 1/\mathrm{deg}(G_r)$ as $r\to\infty$. This extends work of Penrose and Bollob\'as-Janson-Riordan, who considered the case $G=\mathbb{Z}^d$. Our result provides an important ingredient in parallel work of Georgakopoulos in which he introduces a new notion of dimension in groups. It also verifies a special case of a conjecture of Easo and Hutchcroft.