Supercritical phase of the random connection model
Abstract
Given d ∈ N, λ >0, the random connection model in a region A ⊂eq Rd is a graph with vertex set given by a homogeneous Poisson point process of intensity λ in A, with an edge placed between each pair x,y of vertices with probability φ(\|x-y\|), where φ: R+ [0,1] is a nonincreasing finite-range connection function. We show that if d ≥ 3 and λ is strictly supercritical for A = Rd, then the model remains supercritical if it is restricted to a region A of the form R2 × [-K/2,K/2]d-2, provided K 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.