Computing Extinction Barriers in a Quorum-Sensing Reaction Network
Abstract
We introduce a simple reaction-network model of a quorum-sensing population that couples the cell density x to the signal density w. In the four-channel cell-signal network studied here, scaling signal production and removal by the same factor r leaves all deterministic equilibria, and their stability types, unchanged. Nevertheless, we show that r shifts the quasipotential barrier ΔV(r) for rare transitions towards extinction, and thus, under metastable exit assumptions, the mean time to reach a fixed neighbourhood of the extinction state on the exponential scale eNΔV(r). We compute the barrier by minimization of the path action with the signal retained as a fluctuating coordinate, and we check it against mean extinction times obtained without the action solver, i.e., from the backward equation of the jump process on a truncated lattice and from exact stochastic simulation. Over a range of r, the minimum-action barriers satisfy ΔV(r)=ΔV∞+O(1/r), where ΔV∞ is obtained by eliminating the signal first, and at r=1 the barrier is 55% larger than ΔV∞. A formal first-order expansion attributes this increase to the lag of the signal, of which the fluctuations of the signal remove a quarter. The saddle barrier ΔV(r) is also the least action needed to enter the basin of extinction, whereas the density threshold can be crossed more cheaply, by paths which keep the signal high and are usually followed by recovery. The mean extinction times of the backward equation, which include failed attempts, have a prefactor which tends to a constant, and they grow at a rate within 10−5 of ΔV(r) at every tested rate.
Related
- Remote sensing and artificial intelligence for crop pest and disease monitoring: A systematic review of sensing technologies, AI approaches, and barriers to field adoption
- MoBC-Net: computing network inter-module distance and module-based betweenness centrality
- DEMANet: A dehazing enhanced multi-branch attention network for remote sensing images
- Spatially resolved reaction–diffusion modeling reveals effects of intracellular spatial heterogeneity on yeast galactose network dynamics
- Benchmark validity in graph neural network scoring of metabolic reaction activity on Recon3D: detecting label leakage, memorized noise and input-invariant models
BibTeX
@misc{ayala2026computing,
title = {{Computing Extinction Barriers in a Quorum-Sensing Reaction Network}},
author = {Mario Ayala and Johannes Zimmer},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2609.39946},
eprint = {2609.39946},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39946},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Computing Extinction Barriers in a Quorum-Sensing Reaction Network
AU - Mario Ayala
AU - Johannes Zimmer
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2609.39946
UR - https://arxiv.org/abs/2609.39946
AB - We introduce a simple reaction-network model of a quorum-sensing population that couples the cell density x to the signal density w. In the four-channel cell-signal network studied here, scaling signal production and removal by the same factor r leaves all deterministic equilibria, and their stability types, unchanged. Nevertheless, we show that r shifts the quasipotential barrier ΔV(r) for rare transitions towards extinction, and thus, under metastable exit assumptions, the mean time to reach a fixed neighbourhood of the extinction state on the exponential scale e^NΔV(r). We compute the barrier by minimization of the path action with the signal retained as a fluctuating coordinate, and we check it against mean extinction times obtained without the action solver, i.e., from the backward equation of the jump process on a truncated lattice and from exact stochastic simulation. Over a range of r, the minimum-action barriers satisfy ΔV(r)=ΔV_∞+O(1/r), where ΔV_∞ is obtained by eliminating the signal first, and at r=1 the barrier is 55% larger than ΔV_∞. A formal first-order expansion attributes this increase to the lag of the signal, of which the fluctuations of the signal remove a quarter. The saddle barrier ΔV(r) is also the least action needed to enter the basin of extinction, whereas the density threshold can be crossed more cheaply, by paths which keep the signal high and are usually followed by recovery. The mean extinction times of the backward equation, which include failed attempts, have a prefactor which tends to a constant, and they grow at a rate within 10^−5 of ΔV(r) at every tested rate.
ER -