Anish Sarkar

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 …