Papers
Topics
Authors
Recent
2000 character limit reached

Sharpness of Bernoulli percolation via couplings

Published 20 Jan 2022 in math.PR, math-ph, and math.MP | (2201.08223v2)

Abstract: In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path of $p$-open edges from $0$ to the sphere of radius $n$: [ \forall p\in [0,1],\forall m,n \ge 1, \quad \theta_{2n} (p-2\theta_m(p))\le C\frac{\theta_n(p)}{2{n/m}}. ] This result implies that $\theta_n(p)$ decays exponentially fast in the subcritical phase. It also implies the mean-field lower bound in the supercritical phase. We thus provide a new proof of the sharpness of the phase transition for Bernoulli percolation. Contrary to the previous proofs of sharpness, we do not rely on any differential formula. The main novelty is a stochastic domination result which is inspired by [Russo, 1982]. We also discuss a consequence of our result for percolation in high dimensions, where it can be seen as a near-critical sharpness estimate.

Citations (4)

Summary

Paper to Video (Beta)

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.

Authors (1)

Collections

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