An introduction to population protocols

J Aspnes, E Ruppert - Middleware for Network Eccentric and Mobile …, 2009 - Springer
Population protocols are used as a theoretical model for a collection (or population) of tiny
mobile agents that interact with one another to carry out a computation. The agents are …

Consensus dynamics: An overview

L Becchetti, A Clementi, E Natale - ACM SIGACT News, 2020 - dl.acm.org
The term distributed system typically refers to a set of entities, called nodes, connected by
point-topoint communication links. The set of nodes together with the set of links form a …

Programmable chemical controllers made from DNA

YJ Chen, N Dalchau, N Srinivas, A Phillips… - Nature …, 2013 - nature.com
Biological organisms use complex molecular networks to navigate their environment and
regulate their internal state. The development of synthetic systems with similar capabilities …

Time-space trade-offs in population protocols

D Alistarh, J Aspnes, D Eisenstat, R Gelashvili… - Proceedings of the twenty …, 2017 - SIAM
Population protocols are a popular model of distributed computing, in which randomly-
interacting agents with little computational power cooperate to jointly perform computational …

The cell cycle switch computes approximate majority

L Cardelli, A Csikász-Nagy - Scientific reports, 2012 - nature.com
Both computational and biological systems have to make decisions about switching from
one state to another. The 'Approximate Majority'computational algorithm provides the …

Space-optimal majority in population protocols

D Alistarh, J Aspnes, R Gelashvili - Proceedings of the Twenty-Ninth Annual …, 2018 - SIAM
Population protocols are a popular model of distributed computing, in which n agents with
limited local state interact randomly, and cooperate to collectively compute global …

Fast computation by population protocols with a leader

D Angluin, J Aspnes, D Eisenstat - Distributed Computing, 2008 - Springer
Fast algorithms are presented for performing computations in a probabilistic population
model. This is a variant of the standard population protocol model, in which finite-state …

Fast and exact majority in population protocols

D Alistarh, R Gelashvili, M Vojnović - … of the 2015 ACM Symposium on …, 2015 - dl.acm.org
Population protocols, roughly defined as systems consisting of large numbers of simple
identical agents, interacting at random and updating their state following simple rules, are an …

Stable leader election in population protocols requires linear time

D Doty, D Soloveichik - Distributed Computing, 2018 - Springer
A population protocol stably elects a leader if, for all n, starting from an initial configuration
with n agents each in an identical state, with probability 1 it reaches a configuration yy that is …

Determining majority in networks with local interactions and very small local memory

GB Mertzios, SE Nikoletseas, CL Raptopoulos… - Distributed …, 2017 - Springer
We study the problem of determining the majority type in an arbitrary connected network,
each vertex of which has initially two possible types. The vertices may later change into …