Clementi, Andrea E.F.
- Conference Paper
Rights / licenseCreative Commons Attribution 3.0 Unported
The Undecided-State Dynamics is a well-known protocol for distributed consensus. We analyze it in the parallel PULL communication model on the complete graph with n nodes for the binary case (every node can either support one of two possible colors, or be in the undecided state). An interesting open question is whether this dynamics is an efficient Self-Stabilizing protocol, namely, starting from an arbitrary initial configuration, it reaches consensus quickly (i.e., within a polylogarithmic number of rounds). Previous work in this setting only considers initial color configurations with no undecided nodes and a large bias (i.e., Theta(n)) towards the majority color. In this paper we present an unconditional analysis of the Undecided-State Dynamics that answers to the above question in the affirmative. We prove that, starting from any initial configuration, the process reaches a monochromatic configuration within O(log n) rounds, with high probability. This bound turns out to be tight. Our analysis also shows that, if the initial configuration has bias Omega(sqrt(n log n)), then the dynamics converges toward the initial majority color, with high probability. Show more
Book title43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
Journal / seriesLeibniz International Proceedings in Informatics
Pages / Article No.
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
SubjectDistributed Consensus; Self-Stabilization; PULL Model; Markov Chains
Organisational unit09587 - Ghaffari, Mohsen / Ghaffari, Mohsen
MoreShow all metadata