Percolation in invariant Poisson graphs with i.i.d. degrees
From MaRDI portal
Publication:691138
DOI10.1007/s11512-010-0139-8zbMath1254.05181arXiv1002.1943MaRDI QIDQ691138
Maria Deijfen, Olle Häggström, Alexander E. Holroyd
Publication date: 29 November 2012
Published in: Arkiv för Matematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.1943
05C80: Random graphs (graph-theoretic aspects)
60K35: Interacting random processes; statistical mechanics type models; percolation theory
60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)
05C07: Vertex degrees
Related Items
Friendly Frogs, Stable Marriage, and the Magic of Invariance, 1‐independent percolation on ℤ2×Kn, Minimal matchings of point processes, Long paths and connectivity in 1‐independent random graphs
Cites Work
- Poisson matching
- Generating simple random graphs with prescribed degree distribution
- Invariant random graphs with iid degrees in a general geography
- Stationary random graphs with prescribed iid degrees on a spatial Poisson process
- Group-invariant percolation on graphs
- Domination by product measures
- Trees and matchings from point processes
- Connected components in random graphs with given expected degree sequences
- Stationary random graphs on \(\mathbb Z\) with prescribed iid degrees and finite mean connections
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Foundations of Modern Probability
- A critical point for random graphs with a given degree sequence
- Nearest neighbor and hard sphere models in continuum percolation
- On the cost of generating an equivalence relation
- The phase transition in inhomogeneous random graphs
- The average distances in random graphs with given expected degrees
- Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- College Admissions and the Stability of Marriage
