Table of Contents
Fetching ...

Short, Quantitative Construction of the IIC in Planar Percolation

Malo Hillairet

TL;DR

The paper proves a concise, self-contained convergence result for the Incipient Infinite Cluster in planar critical percolation by introducing a site-by-site coupling that samples conditioned configurations $\omega^{(m)}$ and $\omega^{(n)}$ above a common underlying percolation $\omega$. The main technical advance is revealing an outer black circuit to couple the conditioned configurations, which yields a quantitative bound in total variation to the IIC controlled by the dual one-arm probability, and in particular by the one-arm exponent $5/48$ up to subpolynomial factors. This provides the first explicit, explicit upper bound on the convergence speed and highlights a simple, robust method for obtaining convergence rates in planar models. The results connect classical transfer-matrix and scale-by-scale approaches with a transparent site-by-site exploration framework, offering a new perspective on the structure of conditional measures at criticality and opening questions about sharpness and higher-arm extensions.

Abstract

It is standard to construct the Incipient Infinite Cluster as the limit of the critical percolation measure conditioned on 0 being connected to radius n, as n tends to infinity. We provide a short proof of that convergence in the planar setting. A key step in the proof is to introduce an unbiased percolation configuration above which are coupled two percolations conditioned on 0 being connected to different radii. It implies a speed of convergence in total variation distance to the IIC measure upper-bounded by the dual one-arm probability, which is the first occurrence of an explicit upperbound.

Short, Quantitative Construction of the IIC in Planar Percolation

TL;DR

The paper proves a concise, self-contained convergence result for the Incipient Infinite Cluster in planar critical percolation by introducing a site-by-site coupling that samples conditioned configurations and above a common underlying percolation . The main technical advance is revealing an outer black circuit to couple the conditioned configurations, which yields a quantitative bound in total variation to the IIC controlled by the dual one-arm probability, and in particular by the one-arm exponent up to subpolynomial factors. This provides the first explicit, explicit upper bound on the convergence speed and highlights a simple, robust method for obtaining convergence rates in planar models. The results connect classical transfer-matrix and scale-by-scale approaches with a transparent site-by-site exploration framework, offering a new perspective on the structure of conditional measures at criticality and opening questions about sharpness and higher-arm extensions.

Abstract

It is standard to construct the Incipient Infinite Cluster as the limit of the critical percolation measure conditioned on 0 being connected to radius n, as n tends to infinity. We provide a short proof of that convergence in the planar setting. A key step in the proof is to introduce an unbiased percolation configuration above which are coupled two percolations conditioned on 0 being connected to different radii. It implies a speed of convergence in total variation distance to the IIC measure upper-bounded by the dual one-arm probability, which is the first occurrence of an explicit upperbound.

Paper Structure

This paper contains 9 sections, 5 theorems, 28 equations.

Key Result

Theorem 1.1

For all $\eta \in (0, \frac{1}{2})$, for all $k \leq m \leq n \in {\mathbb{N}}$ such that $\frac{m}{k}$ is large enough, where the supremum is taken over events $E$ depending only on hexagons in $\Lambda_k$.

Theorems & Definitions (9)

  • Theorem 1.1: ke86, Transfer-matrix-method speed of convergence
  • Theorem 1.2: schgps13, Scale-by-scale coupling speed of convergence
  • Theorem 1.3: Site-by-site coupling speed of convergence
  • proof : Sketch of proof of Theorem \ref{['1armbound']}
  • Lemma 2.1
  • proof : Proof of Lemma \ref{['couplingworks']}.
  • Lemma 2.2
  • proof : Proof of Lemma \ref{['blackcircuitsmp']}.
  • proof : Proof of Theorem \ref{['1armbound']}.