Combinatorial games on Galton-Watson trees involving several-generation-jump moves
Abstract
We study the -jump normal and -jump mis\`{e}re games on rooted Galton-Watson trees, expressing the probabilities of various outcomes of these games as specific fixed points of certain functions that depend on and the offspring distribution. We discuss results on phase transitions pertaining to draw probabilities when the offspring distribution is Poisson (i.e. for which values of , the draw probability is strictly positive). We compare the probabilities of the various outcomes of the -jump normal game with those of the -jump mis\`{e}re game, and a similar comparison is drawn between the -jump normal game and the -jump normal game, under the Poisson regime. We describe the rate of decay of the probability that the first player loses the -jump normal game as . Finally, we discuss a sufficient condition for the average duration of the -jump normal game to be finite.
Keywords
Cite
@article{arxiv.2205.02124,
title = {Combinatorial games on Galton-Watson trees involving several-generation-jump moves},
author = {Moumanti Podder and Dhruv Bhasin},
journal= {arXiv preprint arXiv:2205.02124},
year = {2024}
}
Comments
Substantial improvements to the presentation of the entire paper, including more detailed explanations in all sections, providing outlines for how we plan to execute the proofs etc. have been incorporated. The main body of the paper is 32 pages, and the appendix is 16 pages