pith. sign in

arxiv: 2103.07450 · v4 · submitted 2021-03-12 · 💻 cs.DC

Reaching Agreement in Competitive Microbial Systems

Victoria Andaur , Janna Burman , Matthias F\"ugger , Manish Kushwaha , Bilal Manssouri , Thomas Nowak , Joel Rybicki This is my paper

Pith reviewed 2026-05-24 13:02 UTC · model grok-4.3

classification 💻 cs.DC
keywords microbial consensusdistributed agreementstochastic population dynamicssynthetic biologymajority consensuscompetitive interactionspopulation dynamics
0
0 comments X

The pith

Direct competition allows microbial species to reach majority consensus with high probability from initial gaps of only Omega(sqrt(n log n)).

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates distributed agreement among two microbial species where the goal is for the initially more numerous species to eventually dominate. Under stochastic population dynamics with direct competition, this majority consensus occurs reliably even when the starting difference is relatively small. In the absence of direct competition the same task requires a much larger initial difference of linear size to succeed with constant probability. Simulations indicate that the competitive process completes on biologically realistic timescales. The work therefore shows how interaction rules shape the robustness of consensus in microbial systems.

Core claim

Direct competition dynamics reach majority consensus with high probability even when the initial gap between the species is small, i.e., Omega(sqrt(n log n)), where n is the initial population size, while absence of direct competition requires an initial gap of Omega(n) to solve majority consensus with constant probability.

What carries the argument

Stochastic population dynamics under direct competitive interaction rules that determine which input species prevails based on relative counts.

If this is right

  • Majority consensus becomes possible in microbial systems even when initial populations differ by only a sublinear amount provided direct competition is present.
  • Synthetic biology circuits can exploit competition to implement reliable agreement without needing large initial biases.
  • Systems lacking direct competition remain sensitive to small random fluctuations in starting counts.
  • Consensus under these rules occurs within practical biological time scales according to the simulations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Natural microbial communities that exhibit competition may spontaneously resolve dominance questions from modest initial differences.
  • Engineering additional competitive mechanisms into microbial consortia could raise the reliability of distributed decision-making tasks.
  • The threshold gap size may change if other biological factors such as spatial structure or resource limits are added to the model.

Load-bearing premise

The stochastic population dynamics and competitive interaction rules used in the model accurately capture the relevant biological processes.

What would settle it

An experiment that tracks whether real microbial populations converge to the initial majority when started with a count gap of order sqrt(n log n) under controlled competition, or whether they fail to converge.

Figures

Figures reproduced from arXiv: 2103.07450 by Bilal Manssouri, Janna Burman, Joel Rybicki, Manish Kushwaha, Matthias F\"ugger, Thomas Nowak, Victoria Andaur.

Figure 1
Figure 1. Figure 1: Stochastic simulation with initial population counts [PITH_FULL_IMAGE:figures/full_fig_p017_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Fraction of A in the bacterial pop￾ulation after 60 min and 120 min. N = 10 simulations per initial fraction. Error bars indi￾cate maximum and minimum, markers average fractions [PITH_FULL_IMAGE:figures/full_fig_p017_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: Same setting as in Figure [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Stochastic simulation as in Figure [PITH_FULL_IMAGE:figures/full_fig_p018_6.png] view at source ↗
read the original abstract

We study distributed agreement in microbial distributed systems under stochastic population dynamics and competitive interactions. Motivated by recent applications in synthetic biology, we examine how the presence and absence of direct competition among microbial species influences their ability to reach majority consensus. In this problem, two species are designated as input species, and the goal is to guarantee that eventually only the input species which had the highest initial count prevails. We show that direct competition dynamics reach majority consensus with high probability even when the initial gap between the species is small, i.e., $\Omega(\sqrt{n\log n})$, where $n$ is the initial population size. In contrast, we show that absence of direct competition is not robust: solving majority consensus with constant probability requires a large initial gap of $\Omega(n)$. To corroborate our analytical results, we use simulations to show that these consensus dynamics occur within practical biological time scales.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The manuscript studies majority consensus in two-species microbial systems under stochastic population dynamics. It claims that direct competition enables high-probability consensus on the initially larger species even from a small gap of Omega(sqrt(n log n)), while the absence of direct competition requires a gap of Omega(n) for constant-probability success. Analytical bounds are presented and corroborated by simulations showing convergence on practical timescales.

Significance. If the central claims hold, the work supplies concrete thresholds distinguishing competitive from non-competitive microbial dynamics, with direct relevance to synthetic-biology circuit design. The Omega(sqrt(n log n)) scaling matches the diffusion scale of standard fixed-population models (e.g., Moran or voter processes), and the explicit comparison between the two regimes is a useful contribution.

major comments (3)
  1. [Model Definition] Model section (definition of stochastic population dynamics): the manuscript must clarify whether birth and death rates are density-dependent (fixed total population) or independent. If the latter, N(t) fluctuates by Omega(sqrt(n)) before absorption, which rescales both drift and variance and can change the consensus threshold from Omega(sqrt(n log n)) to a different order; the current abstract statement leaves this ambiguity unresolved.
  2. [Analysis of Direct Competition] Analysis of direct-competition case (derivation of Omega(sqrt(n log n)) bound): the proof sketch must exhibit the martingale or concentration argument that controls the gap process when N(t) is allowed to vary; without an explicit error term or assumption that N(t) remains Theta(n) with high probability, the claimed probability bound does not necessarily follow from the stated dynamics.
  3. [Comparison of Regimes] Comparison with non-competitive case: the Omega(n) lower bound is stated for constant probability, yet the competitive upper bound is for high probability; the manuscript should either unify the probability statements or explain why the gap thresholds are compared across different success probabilities.
minor comments (2)
  1. [Simulations] Simulation section: the reported run times and population sizes should be accompanied by the exact parameter settings (birth/death rates, competition strength) so that the claimed practical timescales can be reproduced.
  2. [Notation] Notation: the symbol n is used both for initial population size and (implicitly) for total population; a consistent distinction between n_0 and N(t) would improve readability.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive comments, which help clarify the model and strengthen the presentation. We address each major point below and will revise the manuscript to resolve ambiguities and add missing details where needed.

read point-by-point responses

  1. Referee: [Model Definition] Model section (definition of stochastic population dynamics): the manuscript must clarify whether birth and death rates are density-dependent (fixed total population) or independent. If the latter, N(t) fluctuates by Omega(sqrt(n)) before absorption, which rescales both drift and variance and can change the consensus threshold from Omega(sqrt(n log n)) to a different order; the current abstract statement leaves this ambiguity unresolved.

    Authors: We agree that the model definition requires explicit clarification. Our stochastic population dynamics are density-dependent with fixed total population size n (standard Moran process with competition), so birth and death rates are normalized by current N(t) to keep the population constant. This matches the diffusion-scale analysis yielding the Omega(sqrt(n log n)) threshold. We will add a dedicated paragraph in Section 2 stating the density-dependent rates and the invariance of total population. revision: yes

  2. Referee: [Analysis of Direct Competition] Analysis of direct-competition case (derivation of Omega(sqrt(n log n)) bound): the proof sketch must exhibit the martingale or concentration argument that controls the gap process when N(t) is allowed to vary; without an explicit error term or assumption that N(t) remains Theta(n) with high probability, the claimed probability bound does not necessarily follow from the stated dynamics.

    Authors: The proof relies on a martingale argument for the normalized gap process under the fixed-population Moran dynamics; because total population is invariant, N(t) = n exactly and no additional concentration on N(t) is required. We will expand the proof sketch in the revised version to include the explicit Doob martingale, the optional stopping time at absorption, and the Azuma-Hoeffding tail bound that directly yields the high-probability Omega(sqrt(n log n)) result without error terms from fluctuating N. revision: yes

  3. Referee: [Comparison of Regimes] Comparison with non-competitive case: the Omega(n) lower bound is stated for constant probability, yet the competitive upper bound is for high probability; the manuscript should either unify the probability statements or explain why the gap thresholds are compared across different success probabilities.

    Authors: The differing probability statements are deliberate to emphasize robustness: even the weaker constant-probability guarantee for the non-competitive regime already demands an Omega(n) gap, while the competitive regime succeeds with high probability from a much smaller gap. This contrast is the central contribution. We will add a short paragraph after the theorems noting that the competitive high-probability bound implies the constant-probability threshold is at most O(sqrt(n log n)), thereby unifying the comparison while preserving the original statements. revision: partial

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained from stochastic model

full rationale

The paper presents analytical bounds on consensus thresholds derived from the defined stochastic population dynamics and competitive interaction rules. The Ω(√(n log n)) gap for direct competition and Ω(n) for its absence follow from probabilistic analysis of the birth-death processes (standard martingale or concentration arguments on the state evolution), without any reduction to fitted parameters, self-citations as load-bearing premises, or renaming of known results. No equations or claims in the provided text equate a derived prediction back to an input by construction. The model assumptions (including any implicit density dependence) are stated upfront and the results are presented as consequences of those rules, making the derivation independent.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review; no explicit free parameters, axioms, or invented entities are stated. The stochastic population model and competitive interaction rules are implicit background assumptions whose details are not provided.

pith-pipeline@v0.9.0 · 5695 in / 1072 out tokens · 17864 ms · 2026-05-24T13:02:36.714610+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

  1. [1]

    Recent algorithmic advances in population protocols

    Dan Alistarh and Rati Gelashvili. Recent algorithmic advances in population protocols. SIGACT News, 49(3):63–73, 2018. doi:10.1145/3289137.3289150

    work page doi:10.1145/3289137.3289150 2018

  2. [2]

    Fast and exact majority in population protocols

    Dan Alistarh, Rati Gelashvili, and Milan Vojnović. Fast and exact majority in population protocols. In Proc. 34th ACM Symposium on Principles of Distributed Computing (PODC 2015), pages 47–56, 2015. doi:10.1145/2767386.2767429

    work page doi:10.1145/2767386.2767429 2015

  3. [3]

    Time- space trade-offs in population protocols

    Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, and Ronald L Rivest. Time- space trade-offs in population protocols. InProc. 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2560–2579, 2017

    work page 2017

  4. [4]

    Fast graphical population protocols

    Dan Alistarh, Rati Gelashvili, and Joel Rybicki. Fast graphical population protocols. Manuscript, 2021. URLhttps://arxiv.org/abs/2102.08808

    work page arXiv 2021

  5. [5]

    Robust comparison in population protocols, 2021

    Dan Alistarh, Martin Töpfer, and Przemysław Uznański. Robust comparison in population protocols, 2021

    work page 2021

  6. [6]

    Fischer, and René Peralta

    Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Compu- tation in networks of passively mobile finite-state sensors.Distributed Computing, 18(4): 235–253, 2006. doi:10.1007/s00446-005-0138-3

    work page doi:10.1007/s00446-005-0138-3 2006

  7. [7]

    The computational power of population protocols.Distributed Computing, 20(4):279–304, 2007

    Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. The computational power of population protocols.Distributed Computing, 20(4):279–304, 2007. doi:10.1007/s00446- 007-0040-2

    work page doi:10.1007/s00446- 2007

  8. [8]

    A simple population protocol for fast robust approximate majority.Distributed Computing, 21(2):87–102, 2008

    Dana Angluin, James Aspnes, and David Eisenstat. A simple population protocol for fast robust approximate majority.Distributed Computing, 21(2):87–102, 2008

    work page 2008

  9. [9]

    In: Proc

    James Aspnes and Eric Ruppert. An introduction to population protocols. InMiddleware for Network Eccentric and Mobile Applications, pages 97–120. Springer, 2009. doi:10.1007/978- 3-540-89707-1_5

    work page doi:10.1007/978- 2009

  10. [10]

    Bacterially speaking.Cell, 125(2):237–246, 2006

    Bonnie L Bassler and Richard Losick. Bacterially speaking.Cell, 125(2):237–246, 2006. doi:10.1016/j.cell.2006.04.001

    work page doi:10.1016/j.cell.2006.04.001 2006

  11. [11]

    AnO(log3/2 n) parallel time population protocol for majority withO(log n) states

    Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, and Ely Porat. AnO(log3/2 n) parallel time population protocol for majority withO(log n) states. InProc. 2020 ACM Symposium on Principles of Distributed Computing, pages 191–199, 2020. doi:10.1145/3382734.3405747

    work page doi:10.1145/3382734.3405747 2020

  12. [12]

    A population protocol for exact majority withO(log5/3n) stabilization time and Θ(logn) states

    Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. A population protocol for exact majority withO(log5/3n) stabilization time and Θ(logn) states. In Proc. 32nd International Symposium on Distributed Computing (DISC 2018), pages 10:1–10:18, 2018. doi:10.4230/LIPIcs.DISC.2018.10

    work page doi:10.4230/lipics.disc.2018.10 2018

  13. [13]

    Distributed computation with continual population growth

    Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, and Quentin Soubeyran. Distributed computation with continual population growth. InProc. 34th International Symposium on Distributed Computing (DISC), pages 7:1–7:17, 2020. doi:10.4230/LIPIcs.DISC.2020.7

    work page doi:10.4230/lipics.disc.2020.7 2020

  14. [14]

    Approximate majority analyses using tri-molecular chemical reaction networks.Natural Computing, 19: 249–270, 2020

    Anne Condon, Monir Hajiaghayi, David Kirkpatrick, and Ján Maňuch. Approximate majority analyses using tri-molecular chemical reaction networks.Natural Computing, 19: 249–270, 2020. 19

    work page 2020

  15. [15]

    Spirakis, and Przemysław Uznański

    Jurek Czyzowicz, Leszek G˛asiniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, and Przemysław Uznański. On convergence and threshold properties of discrete Lotka- Volterra population protocols. In Proc. 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pages 393–405, 2015. doi:10.1007/978-3-662-47672- 7_32

    work page doi:10.1007/978-3-662-47672- 2015

  16. [16]

    Theory of algorithmic self-assembly.Communications of the ACM, 55(12): 78–88, 2012

    David Doty. Theory of algorithmic self-assembly.Communications of the ACM, 55(12): 78–88, 2012. doi:10.1145/2380656.2380675

    work page doi:10.1145/2380656.2380675 2012

  17. [17]

    A stable majority population protocol using logarithmic time and states, 2020

    David Doty, Mahsa Eftekhari, and Eric Severson. A stable majority population protocol using logarithmic time and states, 2020. URLhttps://arxiv.org/abs/2012.15800

    work page arXiv 2020

  18. [18]

    Convergence speed of binary interval consensus.SIAM Journal on Control and Optimization, 50(3):1087–1109, 2012

    Moez Draief and Milan Vojnović. Convergence speed of binary interval consensus.SIAM Journal on Control and Optimization, 50(3):1087–1109, 2012

    work page 2012

  19. [19]

    Recent results in population protocols for exact majority and leader election.Bulletin of the EATCS, 126, 2018

    Robert Elsässer and Tomasz Radzik. Recent results in population protocols for exact majority and leader election.Bulletin of the EATCS, 126, 2018. URLhttp://bulletin. eatcs.org/index.php/beatcs/article/view/549/546

    work page 2018

  20. [20]

    Theoretical distributed computing meets biology: A review

    Ofer Feinerman and Amos Korman. Theoretical distributed computing meets biology: A review. InProc. 9th International Conference on Distributed Computing and Internet Technology (ICDIT), pages 1–18, 2013. doi:10.1007/978-3-642-36071-8_1

    work page doi:10.1007/978-3-642-36071-8_1 2013

  21. [21]

    Henzinger

    Jasmin Fisher, David Harel, and Thomas A. Henzinger. Biology as reactivity.Communica- tions of the ACM, 54(10):72–82, 2011. doi:10.1145/2001269.2001289

    work page doi:10.1145/2001269.2001289 2011

  22. [22]

    Gardner, Charles R

    Timothy S. Gardner, Charles R. Cantor, and James J. Collins. Construction of a genetic toggle switch in Escherichia coli. Nature, 403(6767):339–342, January 2000. doi:10.1038/35002131

    work page doi:10.1038/35002131 2000

  23. [23]

    The ecology and evolution of microbial competition.Trends in microbiology, 24(10):833–845, 2016

    Melanie Ghoul and Sara Mitri. The ecology and evolution of microbial competition.Trends in microbiology, 24(10):833–845, 2016. doi:10.1016/j.tim.2016.06.011

    work page doi:10.1016/j.tim.2016.06.011 2016

  24. [24]

    Gillespie

    Daniel T. Gillespie. Exact stochastic simulation of coupled chemical reactions.The Journal of Physical Chemistry, 81(25):2340–2361, 1977. doi:10.1021/j100540a008

    work page doi:10.1021/j100540a008 1977

  25. [25]

    The evolution and ecology of bacterial warfare.Current biology, 29(11):R521–R537, 2019

    Elisa T Granato, Thomas A Meiller-Legrand, and Kevin R Foster. The evolution and ecology of bacterial warfare.Current biology, 29(11):R521–R537, 2019. doi:10.1016/j.cub.2019.04.024

    work page doi:10.1016/j.cub.2019.04.024 2019

  26. [26]

    The competitive exclusion principle.Science, 131(3409):1292–1297, 1960

    Garrett Hardin. The competitive exclusion principle.Science, 131(3409):1292–1297, 1960. doi:10.1126/science.131.3409.1292

    work page doi:10.1126/science.131.3409.1292 1960

  27. [27]

    Taylor.A First Course in Stochastic Processes

    Samuel Karlin and Howard M. Taylor.A First Course in Stochastic Processes. Academic Press, New York, 2 edition, 1975

    work page 1975

  28. [28]

    Javier Macía, Francesc Posas, and Ricard V. Solé. Distributed computation: the new wave of synthetic biology devices. Trends in Biotechnology, 30(6):342 – 349, 2012. doi:10.1016/j.tibtech.2012.03.006

    work page doi:10.1016/j.tibtech.2012.03.006 2012

  29. [29]

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

    George B Mertzios, Sotiris E Nikoletseas, Christoforos L Raptopoulos, and Paul G Spirakis. Determining majority in networks with local interactions and very small local memory. Distributed Computing, 30(1):1–16, 2017. doi:10.1007/s00446-016-0277-8

    work page doi:10.1007/s00446-016-0277-8 2017

  30. [30]

    Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

    Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, Cambridge, 2nd edition, 2017. 20

    work page 2017

  31. [31]

    The growth of bacterial cultures.Annual Review of Microbiology, 3(1): 371–394, 1949

    Jacques Monod. The growth of bacterial cultures.Annual Review of Microbiology, 3(1): 371–394, 1949

    work page 1949

  32. [32]

    Distributedinformationprocessinginbiologicalandcom- putational systems

    SaketNavlakhaandZivBar-Joseph. Distributedinformationprocessinginbiologicalandcom- putational systems. Communications of the ACM, 58(1):94–102, 2014. doi:10.1145/2678280

    work page doi:10.1145/2678280 2014

  33. [33]

    Béla Novák and John J. Tyson. Design principles of biochemical oscillators.Nature Reviews Molecular Cell Biology, 9(12):981–991, October 2008. doi:10.1038/nrm2530

    work page doi:10.1038/nrm2530 2008

  34. [34]

    The second wave of synthetic biology: from modules to systems

    Priscilla EM Purnick and Ron Weiss. The second wave of synthetic biology: from modules to systems. Nature reviews Molecular cell biology, 10(6):410–422, 2009. doi:10.1038/nrm2698

    work page doi:10.1038/nrm2698 2009

  35. [35]

    Distributed biological computation with multicellular engineered networks

    Sergi Regot, Javier Macia, Núria Conde, Kentaro Furukawa, Jimmy Kjellén, Tom Peeters, Stefan Hohmann, Eulàlia de Nadal, Francesc Posas, and Ricard Solé. Distributed biological computation with multicellular engineered networks. Nature, 469(7329):207–211, 2010. doi:10.1038/nature09679

    work page doi:10.1038/nature09679 2010

  36. [36]

    Death rate of e

    Severin J Schink, Elena Biselli, Constantin Ammar, and Ulrich Gerland. Death rate of e. coli during starvation is set by maintenance cost and biomass recycling.Cell Systems, 9(1): 64–73, 2019

    work page 2019

  37. [37]

    Bennett, William H

    Jesse Stricker, Scott Cookson, Matthew R. Bennett, William H. Mather, Lev S. Tsimring, and Jeff Hasty. A fast, robust and tunable synthetic gene oscillator.Nature, 456(7221): 516–519, October 2008. doi:10.1038/nature07389

    work page doi:10.1038/nature07389 2008

  38. [38]

    Measuring the rate of conjugal plasmid transfer in a bacterial population using quantitative PCR.Biophysical Journal, 101(1):237–244, 2011

    Zhenmao Wan, Joseph Varshavsky, Sushma Teegala, Jamille McLawrence, and Noel L Goddard. Measuring the rate of conjugal plasmid transfer in a bacterial population using quantitative PCR.Biophysical Journal, 101(1):237–244, 2011. 21

    work page 2011