Expansion of the Critical Intensity for the Random Connection Model
Matthew Dickson, Markus Heydenreich
TL;DR
The paper analyzes continuum percolation in the Random Connection Model by developing a lace expansion for the two-point function and establishing an asymptotic expansion of the critical intensity $\lambda_c$ as the ambient dimension $d$ grows large. The expansion expresses $\lambda_c$ in terms of convolutions $\varphi^{\star n}(0)$ and a hierarchy of lace-expansion coefficients, with rigorous upper and lower bounds for the leading terms. The authors apply the general result to four kernels—the Gilbert disk / Hyper-Sphere, Hyper-Cube, Gaussian, and Coordinate-wise Cauchy—deriving explicit high-dimensional expansions (often exponentially decaying in $d$) for each case. A key methodological contribution is the precise control of lace-expansion coefficients via Mecke’s equation and the BK inequality, together with diagrammatic (graphical) notation for complex convolution structures. The results highlight a marked contrast with lattice percolation, where corrections decay algebraically in $d$, and provide a robust framework for understanding high-dimensional continuum percolation phenomena with potential extensions to marked models.
Abstract
We derive an asymptotic expansion for the critical percolation density of the random connection model as the dimension of the encapsulating space tends to infinity. We calculate rigorously the first expansion terms for the Gilbert disk model, the hyper-cubic model, the Gaussian connection kernel, and a coordinate-wise Cauchy kernel.
