Search arXivSearch

arXiv · 2504.04943

Emergence of microbial host dormancy during a persistent virus epidemic

Abstract

We study a minimal stochastic individual-based model for a microbial population challenged by a persistent (lytic) virus epidemic. We focus on the situation in which the resident microbial host population and the virus population are in stable coexistence upon arrival of a single new ``mutant'' host individual. We assume that this mutant is capable of switching to a reversible state of dormancy upon contact with virions as a means of avoiding infection by the virus. At the same time, we assume that this new dormancy trait comes with a cost, namely a reduced individual reproduction rate. We prove that there is a non-trivial range of parameters where the mutants can nevertheless invade the resident population with strictly positive probability (bounded away from 0) in the large population limit. Given the reduced reproductive rate, such an invasion would be impossible in the absence of either the dormancy trait or the virus epidemic. We explicitly characterize the parameter regime where this emergence of a (costly) host dormancy trait is possible, determine the success probability of a single invader and the typical amount of time it takes the successful mutants to reach a macroscopic population size. We conclude this study by an investigation of the fate of the population after the successful emergence of a dormancy trait. Heuristic arguments and simulations suggest that after successful invasion, either both host types and the virus will reach coexistence, or the mutants will drive the resident hosts to extinction while the virus will stay in the system.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jochen Blath, András Tóbiás. 2025-11-21. Emergence of microbial host dormancy during a persistent virus epidemic. https://arxiv.org/abs/2504.04943

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR