Metraipolis › archive › dc_7c3c10ce8fce

Computing Extinction Barriers in a Quorum-Sensing Reaction Network — arXiv:2609.39946

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39946
License (as archived)
CC0-1.0
Archived
2026-10-07T14:15:08.450Z
SHA-256 of the archived text
cbc5c4c6fe9070a9778ab775108776d58c96cb7db8d0ecfdae0fb5dbade1fc9f
Stable URL of this page
https://metraipolis.com/documento/dc_7c3c10ce8fce

How to cite

Computing Extinction Barriers in a Quorum-Sensing Reaction Network — arXiv:2609.39946 — arXiv (en), https://arxiv.org/abs/2609.39946 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7c3c10ce8fce (Metraipolis archive dc_7c3c10ce8fce, sha256 cbc5c4c6fe9070a9778ab775108776d58c96cb7db8d0ecfdae0fb5dbade1fc9f)
BibTeX
@misc{dc7c3c10ce8fce,
  title = {Computing Extinction Barriers in a Quorum-Sensing Reaction Network — arXiv:2609.39946},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39946},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7c3c10ce8fce; sha256 cbc5c4c6fe9070a9778ab775108776d58c96cb7db8d0ecfdae0fb5dbade1fc9f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39946. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\Delta 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\Delta V(r)}$. We compute the barrier by minimization of the path action with the signal retained as a fluctuating coordinate, and we compare it with exact stochastic simulation of population-threshold crossing times regressed in $N$. Over a range of $r$, the minimum-action barriers satisfy $\Delta V(r)=\Delta V_\infty+O(1/r)$, where $\Delta V_\infty$ is obtained by eliminating the signal first. At $r=1$, the barrier is 55% larger than $\Delta V_\infty$. The saddle barrier $\Delta V(r)$ is also the least action needed to enter the basin of extinction, but the density threshold can be crossed more cheaply: at $r=0.5$ the cheapest crossing costs 7.7% less action, keeps the signal high, and is usually followed by recovery. Simulated arrival times in this neighbourhood, which include failed attempts, grow with slopes within two fitted standard errors of the saddle barrier at every tested rate, and within $0.004$ of it if the logarithmic prefactor term is omitted. Under either regression model they exclude $\Delta V_\infty$ at $r\le2$ by at least $4.4$ fitted standard errors, without using the action solver.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.PR).
Categorie arXiv: Probability (math.PR) ; Statistical Mechanics (cond-mat.stat-mech); Numerical Analysis (math.NA); Populations and Evolution (q-bio.PE).
Pagina del lavoro: https://arxiv.org/abs/2609.39946 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:04:17.225Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).