English

Supercritical phase of the random connection model

Probability 2025-09-11 v2

Abstract

Given dN,λ>0d \in {\bf N}, \lambda >0, the random connection model in a region ARdA \subseteq {\bf R}^d is a graph with vertex set given by a homogeneous Poisson point process of intensity λ\lambda in AA, with an edge placed between each pair x,yx,y of vertices with probability ϕ(xy)\phi(\|x-y\|), where ϕ:R+[0,1]\phi: {\bf R}_+ \to [0,1] is a nonincreasing finite-range connection function. We show that if d3d \geq 3 and λ\lambda is strictly supercritical for A=RdA = {\bf R}^d, then the model remains supercritical if it is restricted to a region AA of the form R2×[K/2,K/2]d2{\bf R}^2 \times [-K/2,K/2]^{d-2}, provided KK is sufficiently large. This is a continuum analogue of a well-known result of Grimmett and Marstrand for lattice percolation. We prove this by adapting Grimmett and Marstrand's original proof; Faggionato and Hartarsky have also proved this recently by other means.

Keywords

Cite

@article{arxiv.2508.11562,
  title  = {Supercritical phase of the random connection model},
  author = {Mathew D. Penrose},
  journal= {arXiv preprint arXiv:2508.11562},
  year   = {2025}
}

Comments

21 pages, 2 figures

R2 v1 2026-07-01T04:52:08.741Z