Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
Authors: 
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John LazarsfeldAuthors Info & Claims
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, John LazarsfeldAuthors Info & ClaimsPages 13 - 23
Abstract
We analyze the convergence of the k-opinion Undecided State Dynamics (USD) in the population protocol model. For k=2 opinions it is well known that the USD reaches consensus with high probability within O(n log n) interactions. Proving that the process also quickly solves the consensus problem for k > 2 opinions has remained open, despite analogous results for larger k in the related parallel gossip model. In this paper we prove such convergence: under mild assumptions on k and on the initial number of undecided agents we prove that the USD achieves plurality consensus within O(kn log n) interactions with high probability, regardless of the initial bias. Moreover, if there is an initial additive bias of at least Ω (√n log n) we prove that the initial plurality opinion wins with high probability, and if there is a multiplicative bias the convergence time is further improved. Note that this is the first result for k > 2 for the USD in the population protocol model. Furthermore, it is the first result for the unsynchronized variant of the USD with k > 2 which does not need any initial bias.
References
[1]
Dan Alistarh, James Aspnes, and Rati Gelashvili. 2018. Space-Optimal Majority in Population Protocols. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. SIAM, 2221--2239.
[2]
Dan Alistarh and Rati Gelashvili. 2018. Recent Algorithmic Advances in Population Protocols. SIGACT News 49, 3 (2018), 63--73.
[3]
Dan Alistarh, Rati Gelashvili, and Milan Vojnovic. 2015. Fast and Exact Majority in Population Protocols. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015. ACM, 47--56.
[4]
Talley Amir, James Aspnes, Petra Berenbrink, Felix Biermeier, Christopher Hahn, Dominik Kaaser, and John Lazarsfeld. 2023. Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model. CoRR abs/2302.12508 (2023). arXiv:2302.12508
[5]
Dana Angluin, James Aspnes, and David Eisenstat. 2008. A simple population protocol for fast robust approximate majority. Distributed Computing 21, 2 (2008), 87--102.
[6]
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, and Peter Kling. 2022. Fast Consensus via the Unconstrained Undecided State Dynamics. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. SIAM, 3417--3429.
[7]
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, and Peter Kling. 2022. Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. In PODC '22: ACM Symposium on Principles of Distributed Computing. ACM, 224--234.
[8]
Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, and Matjaz Krnc. 2020. Positive Aging Admits Fast Asynchronous Plurality Consensus. In PODC '20: ACM Symposium on Principles of Distributed Computing. ACM, 385--394.
[9]
Luca Becchetti, Andrea E. F. Clementi, and Emanuele Natale. 2020. Consensus Dynamics: An Overview. SIGACT News 51, 1 (2020), 58--104.
[10]
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, and Riccardo Silvestri. 2015. Plurality Consensus in the Gossip Model. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. SIAM, 371--390.
[11]
Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, and Luca Trevisan. 2017. Simple dynamics for plurality consensus. Distributed Computing 30, 4 (2017), 293--306.
[12]
Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, and Ely Porat. 2020. An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. In PODC '20: ACM Symposium on Principles of Distributed Computing. ACM, 191--199.
[13]
Petra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, and Emanuele Natale. 2017. Ignore or Comply?: On Breaking Symmetry in Consensus. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017. ACM, 335--344.
[14]
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018. A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. In 32nd International Symposium on Distributed Computing, DISC 2018 (LIPIcs, Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 10:1--10:18.
[15]
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2021. Time-space trade-offs in population protocols for the majority problem. Distributed Computing 34, 2 (2021), 91--111.
[16]
Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling. 2016. Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11--15, 2016, Rome, Italy (LIPIcs, Vol. 55), Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 136:1--136:14.
[17]
Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, and Frederik Mallmann-Trenn. 2016. Bounds on the Voter Model in Dynamic Networks. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 146:1--146:15.
[18]
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah. 2006. Randomized gossip algorithms. IEEE Transactions on Information Theory 52, 6 (2006), 2508--2530.
[19]
Andrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, and Giacomo Scornavacca. 2018. A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (LIPIcs, Vol. 117). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 28:1--28:15.
[20]
Anne Condon, Monir Hajiaghayi, David G. Kirkpatrick, and Ján Manuch. 2017. Simplifying Analyses of Chemical Reaction Networks for Approximate Majority. In DNA Computing and Molecular Programming - 23rd International Conference, DNA 23 (Lecture Notes in Computer Science, Vol. 10467). Springer, 188--209.
[21]
Colin Cooper, Robert Elsässer, Hirotaka Ono, and Tomasz Radzik. 2012. Coalescing random walks and voting on graphs. In ACM Symposium on Principles of Distributed Computing, PODC '12. ACM, 47--56.
[22]
Colin Cooper, Robert Elsässer, and Tomasz Radzik. 2014. The Power of Two Choices in Distributed Voting. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014. Springer, 435--446.
[23]
Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, and Takeharu Shiraga. 2015. Fast Consensus for Voting on General Expander Graphs. In Distributed Computing - 29th International Symposium, DISC 2015. Springer, 248--262.
[24]
Colin Cooper, Tomasz Radzik, Nicolas Rivera, and Takeharu Shiraga. 2017. Fast Plurality Consensus in Regular Expanders. In 31st International Symposium on Distributed Computing, DISC 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 13:1--13:16.
[25]
Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, and Sara Rizzo. 2021. Phase Transitions of the k-Majority Dynamics in a Biased Communication Model. In ICDCN '21: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, January 5--8, 2021. ACM, 146--155.
[26]
Francesco D'Amore, Andrea E. F. Clementi, and Emanuele Natale. 2020. Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract). In Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12156), Andrea Werneck Richa and Christian Scheideler (Eds.). Springer, 255--272.
[27]
Francesco D'Amore and Isabella Ziccardi. 2022. Phase Transition of the 3-Majority Dynamics with Uniform Communication Noise. In Structural Information and Communication Complexity - 29th International Colloquium, SIROCCO 2022, Paderborn, Germany, June 27--29, 2022, Proceedings (Lecture Notes in Computer Science, Vol. 13298), Merav Parter (Ed.). Springer, 98--115.
[28]
Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. 2011. Stabilizing consensus with the power of two choices. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, 149--158.
[29]
David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, and Grzegorz Stachowiak. 2021. A time and space optimal stable population protocol solving exact majority. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE, 1044--1055.
[30]
Robert Elsässer and Tomasz Radzik. 2018. Recent Results in Population Protocols for Exact Majority and Leader Election. Bulletin of the EATCS 126 (2018), 34 pages. http://bulletin.eatcs.org/index.php/beatcs/article/view/549/546
[31]
Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, and Grzegorz Stachowiak. 2016. Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems, OPODIS 2016 (LIPIcs, Vol. 70). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 14:1--14:14.
[32]
Mohsen Ghaffari and Johannes Lengler. 2018. Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018. ACM, 305--313.
[33]
Mohsen Ghaffari and Merav Parter. 2016. A Polylogarithmic Gossip Algorithm for Plurality Consensus. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016. ACM, 117--126.
[34]
Yehuda Hassin and David Peleg. 2001. Distributed Probabilistic Polling and Applications to Proportionate Agreement. Information and Computation 171, 2 (2001), 248--268.
[35]
Varun Kanade, Frederik Mallmann-Trenn, and Thomas Sauerwald. 2019. On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019. SIAM, 956--965.
[36]
Johannes Lengler. 2020. Drift Analysis. In Theory of Evolutionary Computation - Recent Developments in Discrete Optimization, Benjamin Doerr and Frank Neumann (Eds.). Springer, 89--131.
[37]
Johannes Lengler and Angelika Steger. 2018. Drift analysis and evolutionary algorithms revisited. Combinatorics, Probability and Computing 27, 4 (2018), 643--666.
[38]
Toshio Nakata, Hiroshi Imahayashi, and Masafumi Yamashita. 2000. A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. Networks 35, 4 (2000), 266--273. <266::AID-NET5>3.0.CO;2-4
[39]
Emanuele Natale and Iliad Ramezani. 2019. On the Necessary Memory to Compute the Plurality in Multi-agent Systems. In Algorithms and Complexity - 11th International Conference, CIAC 2019 (Lecture Notes in Computer Science, Vol. 11485). Springer, 323--338.
[40]
Etienne Perron, Dinkar Vasudevan, and Milan Vojnovic. 2009. Using Three States for Binary Consensus on Complete Graphs. In INFOCOM 2009. 28th IEEE International Conference on Computer Communications. IEEE, 2527--2535.
[41]
Grant Schoenebeck and Fang-Yi Yu. 2018. Consensus of Interacting Particle Systems on Erdös-Rényi Graphs. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. SIAM, 1945--1964.
Index Terms
- Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model
Recommendations
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe consider the plurality consensus problem for population protocols. Here, n anonymous agents start each with one of k opinions. Their goal is to agree on the initially most frequent opinion (the plurality opinion) via random, pairwise interactions. ...
Fast and Exact Majority in Population Protocols
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed ComputingPopulation protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing ...
Near-Optimal Leader Election in Population Protocols on Graphs
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingIn the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this ...
Comments
Information & Contributors
Information
Published In
June 2023
392 pages
ISBN:9798400701214
DOI:10.1145/3583668
- Chair:
- Rotem Oshman,
- Proceedings Editor:
- Alexandre Nolin,
- Program Chair:
- Magnus Mar Halldorsson,
- Workshop Chair:
- Alkida Balliu
Copyright © 2023 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 16 June 2023
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
PODC '23: 2023 ACM Symposium on Principles of Distributed Computing
June 19 - 23, 2023
FL, Orlando, USA
Acceptance Rates
PODC '23 Paper Acceptance Rate 29 of 110 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 85Total Downloads
- Downloads (Last 12 months)69
- Downloads (Last 6 weeks)3
Reflects downloads up to 10 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in