Moumanti Podder

Combinatorial games on multi-type Galton-Watson trees

2021 · arXiv (Cornell University)

When normal and misère games are played on bi-type binary Galton-Watson trees (with vertices coloured blue or red and each having either no child or precisely $2$ children), with one player allowed to move along …

Learning models on rooted regular trees with majority update policy: convergence and phase transition

2024 · arXiv (Cornell University)

We study a learning model in which an agent is stationed at each vertex of $\mathbb{T}_{m}$, the rooted tree in which each vertex has $m$ children. At any time-step $t \in \mathbb{N}_{0}$, they are allowed …