Decay of connection probability in high-dimensional continuum percolation
Matthew Dickson, Yucheng Liu

TL;DR
This paper analyzes the decay of connection probabilities in high-dimensional continuum percolation models, establishing asymptotic behavior using advanced mathematical techniques.
Contribution
It introduces a new proof method for decay estimates in high-dimensional percolation, simplifying previous approaches and extending results to continuum models.
Findings
Connection probability decays like |x|^{-(d-2)} for large |x| in high dimensions.
The proof applies to both continuum and lattice percolation models in high dimensions.
Simplifies and extends previous decay estimates in percolation theory.
Abstract
We study a percolation model on called the random connection model. For large, we use the lace expansion to prove that the critical two-point connection probability decays like as , with possible anisotropic decay. Our proof also applies to nearest-neighbour Bernoulli percolation on in and simplifies considerably the proof given by Hara in 2008. The method is based on the recent deconvolution strategy of Liu and Slade and uses an version of Hara's induction argument.
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.
