For majority dynamics on resampled sparse Erdős-Rényi graphs, the first update performs a Gaussian coin flip that decides the winner, and unanimity follows within (1+o(1)) log N / log log N rounds.
Fast and Exact Majority in Popula- tion Protocols
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.PR 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Majority Dynamics on Resampled Sparse Erd\H{o}s--R\'enyi Graphs: Gaussian Winner Selection and Pace to Unanimity
For majority dynamics on resampled sparse Erdős-Rényi graphs, the first update performs a Gaussian coin flip that decides the winner, and unanimity follows within (1+o(1)) log N / log log N rounds.