arXiv Analytics

Sign in

arXiv:2107.14347 [math.PR]AbstractReferencesReviewsResources

Subcritical Connectivity and Some Exact Tail Exponents in High Dimensional Percolation

Shirshendu Chatterjee, Jack Hanson, Philippe Sosoe

Published 2021-07-29Version 1

In high dimensional percolation at parameter $p < p_c$, the one-arm probability $\pi_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $\pi_p(n) / \pi_{p_c}(n)$, establishing a form of a hypothesis of scaling theory. As part of our study, we provide sharp estimates (with matching upper and lower bounds) for several quantities of interest at the critical probability $p_c$. These include the tail behavior of volumes of, and chemical distances within, spanning clusters, along with the scaling of the two-point function at "mesoscopic distance" from the boundary of half-spaces. As a corollary, we obtain the tightness of the number of spanning clusters of a diameter $n$ box on scale $n^{d-6}$; this result complements a lower bound of Aizenman.

Related articles: Most relevant | Search more
arXiv:1003.0334 [math.PR] (Published 2010-03-01)
A lower bound on the critical parameter of interlacement percolation in high dimension
arXiv:0807.0839 [math.PR] (Published 2008-07-05, updated 2008-07-13)
On a Lower Bound for the Time Constant of First-Passage Percolation
arXiv:1306.3105 [math.PR] (Published 2013-06-13, updated 2015-10-29)
A lower bound on the two-arms exponent for critical percolation on the lattice