Upper bounds on the percolation correlation length

preprint2020arXivOpen access

Abstract

We study the size of the near-critical window for Bernoulli percolation on Zd\mathbb Z^d. More precisely, we use a quantitative Grimmett-Marstrand theorem to prove that the correlation length, both below and above criticality, is bounded from above by exp⁡(C/∣p−pc∣2)\exp(C/|p-p_c|^2). Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on Zd\mathbb Z^d for every d≥2d\ge2.

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.