Electronic Journal of Probability

Stable Poisson Graphs in One Dimension

Maria Deijfen, Alexander Holroyd, and Yuval Peres

Full-text: Open access

Abstract

Let each point of a homogeneous Poisson process on R independently be equipped with a random number of stubs (half-edges) according to a given probability distribution $\mu$ on the positive integers. We consider schemes based on Gale-Shapley stable marriage for perfectly matching the stubs to obtain a simple graph with degree distribution $\mu$. We prove results on the existence of an infinite component and on the length of the edges, with focus on the case $\mu(2)=1$. In this case, for the random direction stable matching scheme introduced by Deijfen and Meester we prove that there is no infinite component, while for the stable matching of Deijfen, Häggström and Holroyd we prove that existence of an infinite component follows from a certain statement involving a <em>finite</em> interval, which is overwhelmingly supported by simulation evidence

Article information

Source
Electron. J. Probab., Volume 16 (2011), paper no. 44, 1238-1253.

Dates
Accepted: 6 July 2011
First available in Project Euclid: 1 June 2016

Permanent link to this document
https://projecteuclid.org/euclid.ejp/1464820213

Digital Object Identifier
doi:10.1214/EJP.v16-897

Mathematical Reviews number (MathSciNet)
MR2827457

Zentralblatt MATH identifier
1228.60109

Subjects
Primary: 60D05: Geometric probability and stochastic geometry [See also 52A22, 53C65]
Secondary: 05C70: Factorization, matching, partitioning, covering and packing 05C80: Random graphs [See also 60B20]

Keywords
Poisson process random graph degree distribution matching percolation

Rights
This work is licensed under aCreative Commons Attribution 3.0 License.

Citation

Deijfen, Maria; Holroyd, Alexander; Peres, Yuval. Stable Poisson Graphs in One Dimension. Electron. J. Probab. 16 (2011), paper no. 44, 1238--1253. doi:10.1214/EJP.v16-897. https://projecteuclid.org/euclid.ejp/1464820213


Export citation

References

  • Benjamini, I., Lyons, R., Peres, Y. and Schramm, O. (1999): Group-invariant percolation on graphs, Geom. Funct. Anal. 9, 29-66.
  • Bollobas, B. and Stacey, A. (1997): Approximate upper bounds for the critical probability of oriented percolation in two dimensions based on rapidly mixing Markov chains, J. Appl. Probab. 34, 859-867.
  • Deijfen, M. (2009): Stationary random graphs with prescribed i.i.d. degrees on a spatial Poisson process, Electr. Comm. Probab. 14, 81-89.
  • Deijfen, M., Häggström, O. and Holroyd, A. (2010): Percolation in invariant Poisson graphs with i.i.d. degrees, Ark. Mat., to appear.
  • Deijfen, M. and Meester, R. (2006): Generating stationary random graphs on Z with prescribed i.i.d. degrees, Adv. Appl. Probab. 38, 287-298.
  • Gale, D. and Shapely, L. (1962): College admissions and stability of marriage, Amer. Math. Monthly 69, 9-15.
  • Häggström, O. and Meester, R. (1996): Nearest neighbor and hard sphere models in continuum percolation, Rand. Struct. Alg. 9, 295-315.
  • Holroyd, A., Pemantle, R., Peres, Y. and Schramm, O. (2008): Poisson matching, Ann. Inst. Henri Poincare 45, 266-287.
  • Holroyd, A. and Peres, Y. (2003): Trees and matchings from point processes, Elect. Comm. Probab. 8, 17-27.
  • Kallenberg, O. (1997): Foundations of Modern Probability, Springer.
  • Riordan, O. and Walters, M. (2007): Rigorous confidence intervals for critical probabilities, Phys. Rev. E 76, 011110.