Mean-field behaviour of the random connection model on hyperbolic space
Matthew Dickson, Markus Heydenreich
TL;DR
This work analyzes the random connection model on hyperbolic spaces ${\mathbb{H}^d}$ for $d=2,3$, establishing a nontrivial percolation phase transition and proving mean-field critical exponents. The authors develop a half-space methodology linked to hyperbolic isoperimetry to bound susceptibility, magnetisation, and cluster tails, showing $\gamma=1$, $\beta=1$, $\delta=2$, and $\Delta=2$, and that $\lambda_c=\lambda_T$. They also prove a near-critical tail${}^{-1/2}$ behavior for the cluster size distribution and derive cluster-moment bounds via Greg-tree machinery, all under a long-distance assumption and a finite positive integral of the connection kernel. Unlike Euclidean high-dimensional results that rely on triangle diagrams, the proofs here exploit hyperbolic geometry and stepping-stone constructions, with detailed half-space proofs in ${\mathbb{H}^2}$ and ${\mathbb{H}^3}$. The findings connect continuum hyperbolic percolation to mean-field behavior observed in hyperbolic random graphs, while highlighting the geometric mechanisms that underpin these universal exponents.
Abstract
We study the random connection model on hyperbolic space $\mathbb{H}^d$ in dimension $d=2,3$. Vertices of the spatial random graph are given as a Poisson point process with intensity $λ>0$. Upon variation of $λ$ there is a percolation phase transition: there exists a critical value $λ_c>0$ such that for $λ<λ_c$ all clusters are finite, but infinite clusters exist for $λ>λ_c$. We identify certain critical exponents that characterize the clusters at (and near) $λ_c$, and show that they agree with the mean-field values for percolation. We derive the exponents through isoperimetric properties of critical percolation clusters rather than via a calculation of the triangle diagram.
