An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915273895837696 |
|---|---|
| author | El-Hayek, Antoine Elsässer, Robert Schmid, Stefan |
| author_facet | El-Hayek, Antoine Elsässer, Robert Schmid, Stefan |
| contents | We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of $n$ nodes, has initially one of $k$ different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics.
Our main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias $Δ= ω(\sqrt{n\log n})$, where stabilization requires $Ω(kn\log \frac {\sqrt n} {k \log n})$ interactions, or equivalently, $Ω(k\log \frac {\sqrt n} {k \log n})$ parallel time for any $k = o\left(\frac {\sqrt n}{\log n}\right)$. This bound is tight for any $ k \le n^{\frac 1 2 - ε}$, where $ε>0$ can be any small constant, as Amir et al.~(PODC'23) gave a $O(k\log n)$ parallel time upper bound for $k = O\left(\frac {\sqrt n} {\log ^2 n}\right)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02765 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model El-Hayek, Antoine Elsässer, Robert Schmid, Stefan Distributed, Parallel, and Cluster Computing We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of $n$ nodes, has initially one of $k$ different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics. Our main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias $Δ= ω(\sqrt{n\log n})$, where stabilization requires $Ω(kn\log \frac {\sqrt n} {k \log n})$ interactions, or equivalently, $Ω(k\log \frac {\sqrt n} {k \log n})$ parallel time for any $k = o\left(\frac {\sqrt n}{\log n}\right)$. This bound is tight for any $ k \le n^{\frac 1 2 - ε}$, where $ε>0$ can be any small constant, as Amir et al.~(PODC'23) gave a $O(k\log n)$ parallel time upper bound for $k = O\left(\frac {\sqrt n} {\log ^2 n}\right)$. |
| title | An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2505.02765 |