A note on percolation on $Z^d$: isoperimetric profile via exponential cluster repulsion

By G. Pete. 2007

68 citations recorded by the source corpus.

We show that for all $p>p_c(\mathbb{Z}^d)$ percolation parameters, the probability that the cluster of the origin is finite but has at least $t$ vertices at distance one from the infinite cluster is exponentially small in $t$. We use this to give a short proof of the strongest version of the important fact that the isoperimetric profile of the infinite cluster basically coincides with the profile of the original lattice. This implies, e.g., that simple random walk on the largest cluster of a finite box $[-n,n]^d$ with high probability has $L^\infty$-mixing time $\Theta(n^2)$, and that the heat kernel (return probability) on the infinite cluster a.s. decays like $p_n(o,o)=O(n^{-d/2})$. Versions of these results have been proven by Benjamini and Mossel (2003), Mathieu and Remy (2004), Barlow (2004) and Rau (2006). For general infinite graphs, we prove that anchored isoperimetric properties survive supercritical percolation, provided that the probability of the cluster of the origin being finite with large boundary decays rapidly; this is the case for a large class of graphs when $p$ is close to 1. As an application (with the help of some entropy inequalities), we give a short conceptual proof of a theorem of Angel, Benjamini, Berger and Peres (2006): the infinite percolation cluster of a wedge in $\mathbb{Z}^3$ is a.s. transient whenever the wedge itself is transient.

Subfields: Condensed Matter Physics, Mathematical Physics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/97aabf4c238c248b16fb5c89258b6910b4f00983

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Condensed Matter Physics

In Mathematical Physics

In Statistics and Probability

Citations in the corpus

Mean field conditions for coalescing random walks (2011, background): “• all graphs with bounded ratio of maximal to average degree and O ( |V|/ ln(5) |V| ) mixing time: this includes expanders [6] and supercritical percolation clusters in (Z/LZ) [5, 15]; • all graphs with maximal degree ≤ |V| (η > 0 fixed) and mixing time that is polylogarithmic in |V|: this includes ”
Probability on Trees and Networks (2017, background): “? A partial result is due to Pete (2008). A converse is known, namely, that if G is a transitive amenable graph, then for every invariant percolation on G, a.”