Upper bounds on the percolation correlation length
Abstract
We study the size of the near-critical window for Bernoulli percolation on Zd. 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 (C/|p-pc|2). Improving on this bound would be a further step towards the conjecture that there is no infinite cluster at criticality on Zd for every d2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.