Majority dynamics on sparse random graphs

Abstract

Consider a simple undirected graph $G$ on $N$ vertices, with each vertex holding an opinion from one of two options. Starting from the initial opinions on day 1, we run majority dynamics: on each subsequent day, all vertices simultaneously adopt the majority opinion among their neighbors, retaining their current opinion in case of a tie. A well-studied conjecture of Benjamini, Chan, O'Donnell, Tamuz, and Tan states that if $G$ is drawn from the random binomial model $\mathbb{G}(N,p)$, and if the starting opinions are chosen uniformly at random, then as long as $pN \to \infty$ the network will converge to 99% consensus with high probability. We confirm this conjecture as long as $pN \ge N^{\varepsilon}$ for any fixed $\varepsilon>0$, showing that full unanimity is reached with high probability in $O(1/\varepsilon)$ days. This result improves on a line of results by Fountoulakis, Kang, and Makai, who achieve $\varepsilon = 1/2$; Chakraborti, Kim, Lee, and Tran, who achieve $\varepsilon = 2/5$; and Jaffe, who achieves $\varepsilon = 1/3$. The proof technique involves iteratively revealing the"opinion histories"for each vertex through time, keeping track of the degrees between every vertex and each of $2^k$ opinion history classes on day $k$. Our analysis of this process requires intricate estimates for degree-constrained random graph models using graph enumeration tools from the work of McKay and Wormald as well as Canfield, Greenhill, and McKay, and their extensions by Liebenau and Wormald. In doing so, we connect the discrete dynamics to a deterministic idealized process, whose leading-order behavior is described by conditional Gaussian probabilities and expectations.