Galton–Watson games

DOI10.1002/rsa.21008arXiv1904.04150OpenAlexW3160569667MaRDI QIDQ6074666

Alexander E. Holroyd, James B. Martin

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionbranching processcombinatorial gamerandom game

Mathematics Subject Classification ID

2-person games (91A05) Applications of branching processes (60J85) Combinatorial games (91A46)

Related Items (3)

Friendly Frogs, Stable Marriage, and the Magic of Invariance ⋮ Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees ⋮ Percolation games, probabilistic cellular automata, and the hard-core model

Cites Work

• Replica symmetry of the minimum matching
• Trapping games on random boards
• On percolation in random graphs with given vertex degrees
• Existential monadic second order logic on random rooted trees
• Percolation games, probabilistic cellular automata, and the hard-core model
• Branching Processes That Grow Faster Than Binary Splitting
• Friendly Frogs, Stable Marriage, and the Magic of Invariance
• Positional games on random graphs
• Minimax functions on Galton–Watson trees
• Random tree recursions: Which fixed points correspond to tangible sets of trees?
• Recursive functions on conditional Galton‐Watson trees
• Maker‐breaker games on random geometric graphs
• Biased games on random boards

This page was built for publication: Galton–Watson games