Trapping games on random boards

DOI10.1214/16-AAP1190zbMath1356.05088arXiv1505.07485OpenAlexW2563089161MaRDI QIDQ511487

Alexander E. Holroyd, Johan Wästlund, James B. Martin, Riddhipratim Basu

Publication date: 21 February 2017

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

boundary conditionspercolationmaximum matchingmaximum independent setcombinatorial game

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 2-person games (91A05) Games involving graphs (91A43) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Friendly Frogs, Stable Marriage, and the Magic of Invariance ⋮ Galton–Watson games ⋮ On a class of PCA with size-3 neighborhood and their applications in percolation games ⋮ Percolation games, probabilistic cellular automata, and the hard-core model

This page was built for publication: Trapping games on random boards