• Corpus ID: 7537681

# Tight Analysis for the 3-Majority Consensus Dynamics

@article{Ghaffari2017TightAF,
title={Tight Analysis for the 3-Majority Consensus Dynamics},
author={Mohsen Ghaffari and Johannes Lengler},
journal={ArXiv},
year={2017},
volume={abs/1705.05583}
}
• Published 16 May 2017
• Computer Science, Mathematics
• ArXiv
We present a tight analysis for the well-studied randomized 3-majority dynamics of stabilizing consensus, hence answering the main open question of Becchetti et al. [SODA'16]. Consider a distributed system of n nodes, each initially holding an opinion in {1, 2, ..., k}. The system should converge to a setting where all (non-corrupted) nodes hold the same opinion. This consensus opinion should be \emph{valid}, meaning that it should be among the initially supported opinions, and the (fast…
9 Citations

### A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors

• Computer Science, Mathematics
MFCS
• 2018
It is proved that, starting from any initial configuration, the process reaches a monochromatic configuration within O(log n) rounds, with high probability, and this bound turns out to be tight.

### On the Parallel Undecided-State Dynamics with Two Colors

• Computer Science
DISC
• 2017
This analysis shows that, starting from any initial configuration, the Undecided-State Dynamics reaches a monochromatic configuration within $O(\log^2 n)$ rounds, with high probability, and proves that if the initial configuration has bias $\Omega(\sqrt{n\log n})$, then the dynamics converges toward the initial majority color within a polylogarithmic number of rounds.

### Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise

• Computer Science
ArXiv
• 2018
In models that allow noiseless communication, a reduction of (a suitable variant of) Broadcast to binary Consensus is proved, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol.

### Fast Plurality Consensus in Regular Expanders

• Mathematics, Computer Science
DISC
• 2017

### A simple population protocol for fast robust approximate majority

• Computer Science, Mathematics
Distributed Computing
• 2008
It is proved that with high probability n agents reach consensus in O(n log n) interactions and the value chosen is the majority provided that its initial margin is at least $${\omega(\sqrt{n} \,{\rm log}\, n)}$$.

### Plurality Consensus in the Gossip Model

• Mathematics, Computer Science
SODA
• 2015
The Undecided-State Dynamics is considered, a well-known protocol which uses just one more state than those necessary to store colors, and it is shown that the speed of convergence of this protocol depends on the initial color configuration as a whole, not just on the gap between the plurality and the second largest color community.