2026-07-22T13:38:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9610 2024-03-06T10:44:32Z ddc:004 open_access

A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors Clementi, Andrea Ghaffari, Mohsen Gualà, Luciano Natale, Emanuele Pasquale, Francesco Scornavacca, Giacomo Distributed Consensus Self-Stabilization PULL Model Markov Chains 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andrea Clementi and Mohsen Ghaffari and Luciano Gualà and Emanuele Natale and Francesco Pasquale and Giacomo Scornavacca 2018 Is Part Of LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2018.28 urn:nbn:de:0030-drops-96107 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.28 eng https://creativecommons.org/licenses/by/3.0/legalcode