Arkiv för Matematik
- Ark. Mat.
- Volume 50, Number 1 (2012), 41-58.
Percolation in invariant Poisson graphs with i.i.d. degrees
Let each point of a homogeneous Poisson process in ℝd independently be equipped with a random number of stubs (half-edges) according to a given probability distribution μ on the positive integers. We consider translation-invariant schemes for perfectly matching the stubs to obtain a simple graph with degree distribution μ. Leaving aside degenerate cases, we prove that for any μ there exist schemes that give only finite components as well as schemes that give infinite components. For a particular matching scheme which is a natural extension of Gale–Shapley stable marriage, we give sufficient conditions on μ for the absence and presence of infinite components.
Ark. Mat., Volume 50, Number 1 (2012), 41-58.
Received: 6 February 2010
First available in Project Euclid: 31 January 2017
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
2011 © Institut Mittag-Leffler
Deijfen, Maria; Häggström, Olle; Holroyd, Alexander E. Percolation in invariant Poisson graphs with i.i.d. degrees. Ark. Mat. 50 (2012), no. 1, 41--58. doi:10.1007/s11512-010-0139-8. https://projecteuclid.org/euclid.afm/1485907158