Majority dynamics: The power of one

Consider n = ℓ + m individuals, where ℓ ≤ m, with ℓ individuals holding an opinion A and m holding an opinion B. Suppose that the individuals communicate via an undirected network G, and in each time step, each individual updates their opinion according to a majority rule (that is, according to the opinion of the majority of the individuals he or she can communicate with in the network). This simple and well studied process is known as “majority dynamics in social networks”. Here we consider the case where G is a random network, sampled from the binomial model \(\mathbb{G}(n,p)\) $$\mathbb{G}(n,p)$$ , where (log n)^−1/16 ≤ p ≤ 1 − (log n)^−1/16. We show that for n = ℓ + m with Δ = m − ℓ ≤ (log n)^1/4, the above process terminates whp after three steps when a consensus is reached. Furthermore, we calculate the (asymptotically) correct probability for opinion B to “win” and show it is \(\Phi \left({{{p\Delta \sqrt 2} \over {\sqrt {\pi p\left({1 - p} \right)}}}} \right) + O\left({{n^{- c}}} \right),\) $$\mathrm{\Phi }\left(\frac{p\mathrm{\Delta }\sqrt{2}}{\sqrt{\pi p\left(1-p\right)}}\right)+O\left(n^{-c}\right),$$ where Φ is the Gaussian CDF. This answers two conjectures of Tran and Vu and also a question raised by Berkowitz and Devlin.

The proof technique involves iterated degree revelation and analysis of the resulting degree-constrained random graph models via graph enumeration techniques of McKay and Wormald as well as Canfield, Greenhill, and McKay.