License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2021.14
URN: urn:nbn:de:0030-drops-157897
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15789/
Alistarh, Dan ;
Gelashvili, Rati ;
Rybicki, Joel
Fast Graphical Population Protocols
Abstract
Let G be a graph on n nodes. In the stochastic population protocol model, a collection of n indistinguishable, resource-limited nodes collectively solve tasks via pairwise interactions. In each interaction, two randomly chosen neighbors first read each other’s states, and then update their local states. A rich line of research has established tight upper and lower bounds on the complexity of fundamental tasks, such as majority and leader election, in this model, when G is a clique. Specifically, in the clique, these tasks can be solved fast, i.e., in n polylog n pairwise interactions, with high probability, using at most polylog n states per node.
In this work, we consider the more general setting where G is an arbitrary regular graph, and present a technique for simulating protocols designed for fully-connected networks in any connected regular graph. Our main result is a simulation that is efficient on many interesting graph families: roughly, the simulation overhead is polylogarithmic in the number of nodes, and quadratic in the conductance of the graph. As a sample application, we show that, in any regular graph with conductance φ, both leader election and exact majority can be solved in φ^{-2} ⋅ n polylog n pairwise interactions, with high probability, using at most φ^{-2} ⋅ polylog n states per node. This shows that there are fast and space-efficient population protocols for leader election and exact majority on graphs with good expansion properties. We believe our results will prove generally useful, as they allow efficient technology transfer between the well-mixed (clique) case, and the under-explored spatial setting.
BibTeX - Entry
@InProceedings{alistarh_et_al:LIPIcs.OPODIS.2021.14,
author = {Alistarh, Dan and Gelashvili, Rati and Rybicki, Joel},
title = {{Fast Graphical Population Protocols}},
booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-219-8},
ISSN = {1868-8969},
year = {2022},
volume = {217},
editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15789},
URN = {urn:nbn:de:0030-drops-157897},
doi = {10.4230/LIPIcs.OPODIS.2021.14},
annote = {Keywords: population protocols, leader election, exact majority, graphs}
}
Keywords: |
|
population protocols, leader election, exact majority, graphs |
Collection: |
|
25th International Conference on Principles of Distributed Systems (OPODIS 2021) |
Issue Date: |
|
2022 |
Date of publication: |
|
28.02.2022 |