Friendly Frogs, Stable Marriage, and the Magic of Invariance

DOI10.4169/amer.math.monthly.124.5.387zbMath1394.05077arXiv1604.03161OpenAlexW2962689032WikidataQ58255973 ScholiaQ58255973MaRDI QIDQ4575260

Maria Deijfen, Alexander E. Holroyd, James B. Martin

Publication date: 13 July 2018

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.03161

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (5)

Stable matchings in high dimensions via the Poisson-weighted infinite tree ⋮ Galton–Watson games ⋮ Multicolour Poisson matching ⋮ Minimal matchings of point processes ⋮ Bipartite choices

Cites Work

• Unnamed Item
• Unnamed Item
• Insertion and deletion tolerance of point processes
• Replica symmetry of the minimum matching
• Trapping games on random boards
• Stable Poisson graphs in one dimension
• Percolation in invariant Poisson graphs with i.i.d. degrees
• Poisson matching
• Topological games: on the 50th anniversary of the Banach-Mazur game
• Group-invariant percolation on graphs
• Infinite clusters in dependent automorphism invariant percolation on trees
• Percolation games, probabilistic cellular automata, and the hard-core model
• Bipartite stable Poisson graphs on R
• Positional Games
• Nearest neighbor and hard sphere models in continuum percolation
• Descending chains, the lilypond model, and mutual-nearest-neighbour matching
• An Introduction to the Theory of Point Processes
• College Admissions and the Stability of Marriage
• The strange logic of random graphs
• Galton–Watson games

This page was built for publication: Friendly Frogs, Stable Marriage, and the Magic of Invariance