For a broad class of consensus update functions on the complete graph with adversarial noise, the runtime R_n is asymptotically centered at (1/2)log_γ n + log_m ln n with non-convergent, asymptotically periodic fluctuations on both log n and log log n scales.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Limit Laws for Consensus Protocols on the Complete Graph
For a broad class of consensus update functions on the complete graph with adversarial noise, the runtime R_n is asymptotically centered at (1/2)log_γ n + log_m ln n with non-convergent, asymptotically periodic fluctuations on both log n and log log n scales.