Majority dynamics on sparse random graphs

Debsoumya Chakraborti, Jeong Han Kim, Joonkyung Lee +1

Majority dynamics on a graph $G$ is a deterministic process such that every vertex updates its $\pm 1$-assignment according to the majority assignment on its neighbor simultaneousl…