---
_id: '10218'
abstract:
- lang: eng
  text: '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 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 an example, this implies 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.'
acknowledgement: This project has received funding from the European Union’s Horizon
  2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement
  No 840605.
alternative_title:
- LIPIcs
article_number: '43'
article_processing_charge: No
arxiv: 1
author:
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Rati
  full_name: Gelashvili, Rati
  last_name: Gelashvili
- first_name: Joel
  full_name: Rybicki, Joel
  id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
  last_name: Rybicki
  orcid: 0000-0002-6432-6646
citation:
  ama: 'Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical
    population protocols. In: <i>35th International Symposium on Distributed Computing</i>.
    Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href="https://doi.org/10.4230/LIPIcs.DISC.2021.43">10.4230/LIPIcs.DISC.2021.43</a>'
  apa: 'Alistarh, D.-A., Gelashvili, R., &#38; Rybicki, J. (2021). Brief announcement:
    Fast graphical population protocols. In <i>35th International Symposium on Distributed
    Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.DISC.2021.43">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>'
  chicago: 'Alistarh, Dan-Adrian, Rati Gelashvili, and Joel Rybicki. “Brief Announcement:
    Fast Graphical Population Protocols.” In <i>35th International Symposium on Distributed
    Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
    <a href="https://doi.org/10.4230/LIPIcs.DISC.2021.43">https://doi.org/10.4230/LIPIcs.DISC.2021.43</a>.'
  ieee: 'D.-A. Alistarh, R. Gelashvili, and J. Rybicki, “Brief announcement: Fast
    graphical population protocols,” in <i>35th International Symposium on Distributed
    Computing</i>, Freiburg, Germany, 2021, vol. 209.'
  ista: 'Alistarh D-A, Gelashvili R, Rybicki J. 2021. Brief announcement: Fast graphical
    population protocols. 35th International Symposium on Distributed Computing. DISC:
    Distributed Computing , LIPIcs, vol. 209, 43.'
  mla: 'Alistarh, Dan-Adrian, et al. “Brief Announcement: Fast Graphical Population
    Protocols.” <i>35th International Symposium on Distributed Computing</i>, vol.
    209, 43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href="https://doi.org/10.4230/LIPIcs.DISC.2021.43">10.4230/LIPIcs.DISC.2021.43</a>.'
  short: D.-A. Alistarh, R. Gelashvili, J. Rybicki, in:, 35th International Symposium
    on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
conference:
  end_date: 2021-10-08
  location: Freiburg, Germany
  name: 'DISC: Distributed Computing '
  start_date: 2021-10-04
date_created: 2021-11-07T23:01:24Z
date_published: 2021-10-04T00:00:00Z
date_updated: 2025-04-14T07:50:55Z
day: '04'
ddc:
- '000'
department:
- _id: DaAl
doi: 10.4230/LIPIcs.DISC.2021.43
ec_funded: 1
external_id:
  arxiv:
  - '2102.08808'
file:
- access_level: open_access
  checksum: fd2a690f6856d21247e9aa952b0e2885
  content_type: application/pdf
  creator: cchlebak
  date_created: 2021-11-12T08:16:44Z
  date_updated: 2021-11-12T08:16:44Z
  file_id: '10274'
  file_name: 2021_LIPIcsDISC_Alistarh.pdf
  file_size: 534219
  relation: main_file
  success: 1
file_date_updated: 2021-11-12T08:16:44Z
has_accepted_license: '1'
intvolume: '       209'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 26A5D39A-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '840605'
  name: Coordination in constrained and natural distributed systems
publication: 35th International Symposium on Distributed Computing
publication_identifier:
  isbn:
  - 9-783-9597-7210-5
  issn:
  - 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief announcement: Fast graphical population protocols'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 209
year: '2021'
...