TY - UNPB
T1 - Resolution of a conjecture on majority dynamics: Rapid stabilisation in dense random graphs
AU - Fountoulakis, N.
AU - Kang, M.
AU - Makai, T.
PY - 2019
Y1 - 2019
N2 - We study majority dynamics on the binomial random graph G(n, p) with p = d/n and d > λn1/2, for some large λ > 0. In this process, each vertex has a state in {-1,+1} and at each round every vertex adopts the state of the majority of its neighbours, retaining its state in the case of a tie. We show that with high probability the process reaches unanimity in at most four rounds. This confirms a conjecture of Benjamini, Chan, O' Donnel, Tamuz and Tan.
AB - We study majority dynamics on the binomial random graph G(n, p) with p = d/n and d > λn1/2, for some large λ > 0. In this process, each vertex has a state in {-1,+1} and at each round every vertex adopts the state of the majority of its neighbours, retaining its state in the case of a tie. We show that with high probability the process reaches unanimity in at most four rounds. This confirms a conjecture of Benjamini, Chan, O' Donnel, Tamuz and Tan.
UR - http://www.scopus.com/inward/record.url?eid=2-s2.0-85094338393&partnerID=MN8TOARS
M3 - Preprint
BT - Resolution of a conjecture on majority dynamics: Rapid stabilisation in dense random graphs
ER -