Combinatorial games on Galton-Watson trees involving several-generation-jump moves

DOI10.2140/CNT.2024.13.1MaRDI QIDQ6547218zbMATH OpenFDO

Authors Dhruv Bhasin, Moumanti Podder

Publication date 30 May 2024

Published in Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/CNT.2024.13.1

zbMATH Keywords

fixed pointsgeneralized finite state tree automatamisère gamesnormal gamesPoisson offspringrooted Galton-Watson treestwo-player combinatorial games

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• Galton–Watson games
• Combinatorial games on multi-type Galton-Watson trees
• Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees
• Extended Sprague-Grundy theory for locally finite games, and applications to random game-trees
• Minimax functions on Galton-Watson trees

Cites work

• A new characterization of endogeny
• A phase transition between endogeny and nonendogeny
• A survey of max-type recursive distributional equations
• Biased games on random boards
• Complexity, appeal and challenges of combinatorial games
• Existential monadic second order logic on random rooted trees
• First order probabilities for Galton-Watson trees
• First order sentences about random graphs: small number of alternations
• First-Order Definability of Trees and Sparse Random Graphs
• Frozen percolation on the binary tree is nonendogenous
• Galton-Watson probability contraction
• Galton–Watson games
• How complex are random graphs in first order logic?
• scientific article; zbMATH DE number 1341924 (Why is no real title available?)
• scientific article; zbMATH DE number 1149174 (Why is no real title available?)
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• Logical laws for short existential monadic second-order sentences about graphs
• Maker-breaker games on random geometric graphs
• Maximum matching and the game of Slither
• Monadic second-order properties of very sparse random graphs
• On infinite spectra of first-order properties of random graphs
• Percolation games, probabilistic cellular automata, and the hard-core model
• Positional games
• Positional games on random graphs
• Random tree recursions: Which fixed points correspond to tangible sets of trees?
• Random unary predicates: Almost sure theories and countable models
• Recursive tree processes and the mean-field limit of stochastic flows
• Replica symmetry of the minimum matching
• Short monadic second order sentences about sparse random graphs
• The first order definability of graphs with separators via the Ehrenfeucht game
• The first order definability of graphs: Upper bounds for quantifier depth
• The first order theory of \(G(n, c/n)\)
• Threshold spectra via the Ehrenfeucht game
• Trapping games on random boards
• Zero-one laws for \(k\)-variable first-order logic of sparse random graphs

Cited in

(1)

• Galton–Watson games

This page was built for publication: Combinatorial games on Galton-Watson trees involving several-generation-jump moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547218)