Explicit and tight bounds of the convergence time of average-based population protocols

DOI10.1007/978-3-030-24922-9_29MaRDI QIDQ2303306zbMATH OpenOpenAlexFDO

Authors Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume

Publication date 3 March 2020

Full work available at URL https://hal-cnrs.archives-ouvertes.fr/hal-02380422/file/main.pdf

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Stochastic analysis of average-based distributed algorithms
• Automatic analysis of expected termination time for population protocols
• Brief Announcement
• On parallel time in population protocols
• Fast and exact majority in population protocols

Cited in

(3)

• On the convergence of population protocols when population goes to infinity
• A survey of size counting in population protocols
• Noidy conmunixatipn: on the convergence of the averaging population protocol

This page was built for publication: Explicit and tight bounds of the convergence time of average-based population protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303306)