Majority dynamics on a graph
is a deterministic process such that every vertex updates its
‐assignment according to the majority assignment on its neighbor simultaneously at each step. Benjamini, Chan, O'Donnell, Tamuz and Tan conjectured that, in the Erdős–Rényi random graph
, the random initial
‐assignment converges to a
...