Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
Gemini 2.5 Pro
GPT-5
GPT-4o
DeepSeek R1 via Azure
2000 character limit reached

Decay of connection probability in high-dimensional continuum percolation (2507.19288v1)

Published 25 Jul 2025 in math.PR, math-ph, and math.MP

Abstract: We study a percolation model on $\mathbb Rd$ called the random connection model. For $d$ large, we use the lace expansion to prove that the critical two-point connection probability decays like $|x|{-(d-2)}$ as $|x| \to \infty$, with possible anisotropic decay. Our proof also applies to nearest-neighbour Bernoulli percolation on $\mathbb Zd$ in $d \ge 11$ 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 $Lp$ version of Hara's induction argument.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com