• Corpus ID: 232222251

Reaching Agreement in Competitive Microbial Systems

@article{Andaur2021ReachingAI,
  title={Reaching Agreement in Competitive Microbial Systems},
  author={Victoria Andaur and Janna Burman and Matthias F{\"u}gger and Manish Kushwaha and Bilal Manssouri and Thomas Nowak and Joel Rybicki},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.07450}
}
. In this work, we consider distributed agreement tasks in microbial distributed systems under stochastic population dynamics and competitive interactions. We examine how competitive exclusion can be used to solve distributed agreement tasks in the microbial setting. To this end, we develop a new technique for analyzing the time to reach competitive exclusion in systems with several competing species under biologically realistic population dynamics. We use this technique to analyze a protocol… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 38 REFERENCES

Distributed computation with continual population growth

A fast protocol is presented in systems with continuous population growth for the majority consensus problem and it is proved that it correctly identifies the initial majority among two inputs with high probability if the initial difference is Ω(nlogn)\documentclass[12pt]{minimal}.

A stable majority population protocol using logarithmic time and states

It is shown that the protocol can be modified to be uniform, while increasing the state complexity to Θ(logn log log n), making it state-optimal for that class of stable protocols that are “output dominant” and “monotone”.

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States

This paper designs a population protocol that solves the majority problem in O(log3/2 n) parallel time, both with high probability and in expectation, while using O( log n) states.

Robust Comparison in Population Protocols

A natural generalization of majority/consensus, which relates the evolution of a population protocol to its expected (steady-state) analysis, which should be broadly applicable in the context of population protocols and opinion dynamics.

Approximate majority analyses using tri-molecular chemical reaction networks

It is proved that the tri-molecular CRN is robust even when there is some uncertainty in the reaction rates, when some molecules are Byzantine (i.e., adversarial), or when activation of molecules is triggered by epidemic.

The Evolution and Ecology of Bacterial Warfare

Recent Results in Population Protocols for Exact Majority and Leader Election

This paper focuses on the random scheduler, which selects in each step two nodes uniformly at random for interaction, and on the problems of exact majority and leader election, and gives an overview of the population protocols for these problems.

Recent Algorithmic Advances in Population Protocols

This work states that a population protocol consists of n agents with limited local state that interact randomly in pairs, according to an underlying communication graph, and cooperate to collectively compute global predicates.

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Θ(log n) States

This work presents a fast population protocol for the exact-majority problem, which uses Θ(logn) states (per agent) and stabilizes in O(log5/3 n) parallel time in expectation and with high probability, and shows how this framework can be tightened with weak synchronization to break the O( log2 n) upper bound of previous protocols.