English

Subcritical Connectivity and Some Exact Tail Exponents in High Dimensional Percolation

Probability 2021-08-02 v1 Mathematical Physics math.MP

Abstract

In high dimensional percolation at parameter p<pcp < p_c, the one-arm probability πp(n)\pi_p(n) is known to decay exponentially on scale (pcp)1/2(p_c - p)^{-1/2}. We show the same statement for the ratio πp(n)/πpc(n)\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 pcp_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 nn box on scale nd6n^{d-6}; this result complements a lower bound of Aizenman.

Keywords

Cite

@article{arxiv.2107.14347,
  title  = {Subcritical Connectivity and Some Exact Tail Exponents in High Dimensional Percolation},
  author = {Shirshendu Chatterjee and Jack Hanson and Philippe Sosoe},
  journal= {arXiv preprint arXiv:2107.14347},
  year   = {2021}
}

Comments

63 pages, 6 figures

R2 v1 2026-06-24T04:40:15.917Z