Local majority dynamics on preferential attachment graphs

Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis

Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If i…