For general update functions f in consensus protocols on the complete graph with o(sqrt(n)) adversarial changes per round, the consensus runtime R_n is asymptotically (1/2)log_γ n + log_m ln n plus a non-converging periodic fluctuation term.
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 general update functions f in consensus protocols on the complete graph with o(sqrt(n)) adversarial changes per round, the consensus runtime R_n is asymptotically (1/2)log_γ n + log_m ln n plus a non-converging periodic fluctuation term.