Distributed computation with continual population growth

DOI10.1007/S00446-021-00404-8MaRDI QIDQ2104041zbMATH OpenOpenAlexFDO

Authors Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, Quentin Soubeyran

Publication date 9 December 2022

Published in Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2003.09972

zbMATH Keywords

birth-death processesmajority consensusmicrobiological circuits

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Fast computation by population protocols with a leader
• scientific article; zbMATH DE number 6850453
• scientific article; zbMATH DE number 7204593
• Brief Announcement
• Space-optimal proportion consensus with population protocols

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 432503 (Why is no real title available?)
• scientific article; zbMATH DE number 3164122 (Why is no real title available?)
• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 6850453 (Why is no real title available?)
• scientific article; zbMATH DE number 3185292 (Why is no real title available?)
• A population protocol for exact majority with \(O(\log^{5/3} n)\) stabilization time and \(\Theta(\log n)\) states
• A simple population protocol for fast robust approximate majority
• A survey of size counting in population protocols
• AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States
• Branching Processes Since 1873
• Competition between two species
• Computation with finite stochastic chemical reaction networks
• Deterministic function computation with chemical reaction networks
• Discrete Mathematics
• Extinction times and size of the surviving species in a two-species competition process
• Fast computation by population protocols with a leader
• Markov Chains
• On competition between two species
• Polya Urn Models
• Population stability. Regulating size in the presence of an adversary
• Simplifying analyses of chemical reaction networks for approximate majority
• The computational power of population protocols
• Time-space trade-offs in population protocols for the majority problem

Cited in

(3)

• Distributed computation with continual population growth
• Computing with Large Populations Using Interactions
• Distributed Computation with Continual Population Growth

Describes a project that uses

Uses Software

• COPASI

This page was built for publication: Distributed computation with continual population growth

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