Lower bounds on the state complexity of population protocols
-
Published:2023-06-15
Issue:3
Volume:36
Page:209-218
-
ISSN:0178-2770
-
Container-title:Distributed Computing
-
language:en
-
Short-container-title:Distrib. Comput.
Author:
Czerner PhilippORCID, Esparza JavierORCID, Leroux JérômeORCID
Abstract
AbstractPopulation protocols are a model of computation in which an arbitrary number of indistinguishable finite-state agents interact in pairs. The goal of the agents is to decide by stable consensus whether their initial global configuration satisfies a given property, specified as a predicate on the set of configurations. The state complexity of a predicate is the number of states of a smallest protocol that computes it. Previous work by Blondin et al. has shown that the counting predicates $$x \ge \eta $$
x
≥
η
have state complexity $$\mathcal {O}(\log \eta )$$
O
(
log
η
)
for leaderless protocols and $$\mathcal {O}(\log \log \eta )$$
O
(
log
log
η
)
for protocols with leaders. We obtain the first non-trivial lower bounds: the state complexity of $$x \ge \eta $$
x
≥
η
is $$\Omega (\log \log \eta )$$
Ω
(
log
log
η
)
for leaderless protocols, and the inverse of a non-elementary function for protocols with leaders.
Funder
Technische Universität München
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference26 articles.
1. Abriola, S., Figueira, S., Senno, G.: Linearizing well quasi-orders and bounding the length of bad sequences. Theor. Comput. Sci. 603, 3–22 (2015) 2. Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in population protocols. In: SODA, pp. 2560–2579. SIAM, Philadelphia (2017) 3. Alistarh, D., Aspnes, J., Gelashvili, R.: Space-optimal majority in population protocols. In: SODA, pp. 2221–2239. SIAM, Philadelphia (2018) 4. Alistarh, D., Gelashvili, R.: Recent algorithmic advances in population protocols. SIGACT News 49(3), 63–73 (2018) 5. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC, pp 290–299. ACM (2004)
|
|