Learning models on rooted regular trees with majority update policy: convergence and phase transition (2405.12418v1)

Abstract: 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 to select one of two available technologies: $B$ and $R$. Let the technology chosen by the agent at vertex $v\in\mathbb{T}{m}$, at time-step $t$, be $C{t}(v)$. Let ${C_{0}(v):v\in\mathbb{T}{m}}$ be i.i.d., where $C{0}(v)=B$ with probability $\pi_{0}$. During epoch $t$, the agent at $v$ performs an experiment that results in success with probability $p_{B}$ if $C_{t}(v)=B$, and with probability $p_{R}$ if $C_{t}(v)=R$. If the children of $v$ are $v_{1},\ldots,v_{m}$, the agent at $v$ updates their technology to $C_{t+1}(v)=B$ if the number of successes among all $v_{i}$ with $C_{t}(v_{i})=B$ exceeds, strictly, the number of successes among all $v_{j}$ with $C_{t}(v_{j})=R$. If these numbers are equal, then the agent at $v$ sets $C_{t+1}(v)=B$ with probability $1/2$. Else, $C_{t+1}(v)=R$. We show that ${C_{t}(v):v\in\mathbb{T}{m}}$ is i.i.d., where $C{t}(v)=B$ with probability $\pi_{t}$, and ${\pi_{t}}{t \in \mathbb{N}{0}}$ converges to a fixed point $\pi$ of a function $g_{m}$. For $m \geqslant 3$, there exists a $p(m) \in (0,1)$ such that $g_{m}$ has a unique fixed point, $1/2$, when $p \leqslant p(m)$, and three distinct fixed points, of the form $\alpha$, $1/2$ and $1-\alpha$, when $p > p(m)$. When $m=3$, $p_{B}=1$ and $p_{R} \in [0,1)$, we show that $g_{3}$ has a unique fixed point, $1$, when $p_{R} < \sqrt{3}-1$, two distinct fixed points, one of which is $1$, when $p_{R} = \sqrt{3}-1$, and three distinct fixed points, one of which is $1$, when $p_{R} > \sqrt{3}-1$. When $g_{m}$ has multiple fixed points, we also specify which of these fixed points $\pi$ equals, depending on $\pi_{0}$. For $m=2$, we describe the behaviour of $g_{3}$ for all $p_{B}$ and $p_{R}$.