Subcritical Connectivity and Some Exact Tail Exponents in High Dimensional Percolation
Shirshendu Chatterjee, Jack Hanson, Philippe Sosoe

TL;DR
This paper investigates high-dimensional percolation, establishing exponential decay of the one-arm probability ratio below criticality, and provides sharp estimates for critical quantities, advancing understanding of scaling and cluster behavior.
Contribution
It proves exponential decay of the one-arm probability ratio and offers sharp bounds for cluster volumes and distances at criticality, confirming aspects of scaling theory in high dimensions.
Findings
Exponential decay of the one-arm probability ratio below p_c.
Sharp bounds for cluster volume tail behavior.
Tightness of the number of spanning clusters at criticality.
Abstract
In high dimensional percolation at parameter , the one-arm probability is known to decay exponentially on scale . We show the same statement for the ratio , 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 . 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 box on scale ; this result complements a lower bound of Aizenman.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Theoretical and Computational Physics · Markov Chains and Monte Carlo Methods
