A new proof of the sharpness of the phase transition for Bernoulli percolation on Zd\mathbb Z^d

preprint2015arXivOpen access

Abstract

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for p<pcp<p_c, the probability that the origin is connected by an open path to distance nn decays exponentially fast in nn. - for p>pcp>p_c, the probability that the origin belongs to an infinite cluster satisfies the mean-field lower bound θ(p)≥p−pcp(1−pc)θ(p)\ge\tfrac{p-p_c}{p(1-p_c)}. This note presents the argument of \cite{DumTas15}, which is valid for long-range Bernoulli percolation (and for the Ising model) on arbitrary transitive graphs in the simpler framework of nearest-neighbour Bernoulli percolation on Zd\mathbb Z^d.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.