Searcharxiv⌕ Search

arXiv · 2610.32535

Stochastic predator-prey compartment model with cyclic and non-cyclic transition pathways and mortality

Abstract

We study variants of a stochastic SEIRS-SEID compartmental model incorporating presymptomatic infectiousness and disease-related mortality, with independent compartmental sojourn times drawn from arbitrary distributions, in particular Weibull distributions. We consider a large population of agents that occupy the states (compartments) S (susceptible to infection), E (exposed: infected but asymptomatic during the latency period and already infectious, including diseases with presymptomatic infections), I (infected and infectious, with symptoms), R (recovered, immune, and non-infectious), or D (dead). We consider (i) cyclic transmission pathways, where compartmental sojourn times are finite and immunity is temporary, and (ii) non-cyclic pathways, where immunity is permanent. In the absence of mortality, cyclic transmission pathways support an endemic equilibrium above the spreading threshold which is either globally stable or oscillatory (Hopf) unstable, whereas for non-cyclic pathways a stationary disease-free state is emerging. From a stochastic perspective, we elucidate the connection between compartmental sojourn-time distributions and the appearance of fractional operators in the evolution equations: fat-tailed compartment waiting-time distributions necessarily lead to fractional derivatives. For cyclic transition pathways we obtain an explicit expression for the expected number of infection cycles that an agent survives. Our model is validated by a combined Monte Carlo -- Runge -- Kutta simulation scheme and random-walk simulations on Barabasi-Albert networks. It has cross-disciplinary applications beyond epidemiology, including wildfire spreading, certain classes of chemical reactions, population dynamics, finance, economics, and biology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas M. Michelitsch, Ayten D. Baher, Michael Bestehorn, Andrzej F. Nowakowski, Alejandro P. Riascos, Bernard A. Collet. 2026-10-23. Stochastic predator-prey compartment model with cyclic and non-cyclic transition pathways and mortality. https://arxiv.org/abs/2610.32535

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

KEEP EXPLORING

Related papers

Dynamics of a Harvested Predator-Prey Model with a Generalized Holling Type~III Response Capturing Group Defense

We investigate a predator-prey model with constant prey harvesting and a generalized Holling type III functional response, focusing on the biological and dynamical consequences of allowing the parameter $b$ to be negative. In this regime, predation efficiency declines at high prey densities, potentially reflecting group defense. This change permits an additional coexistence equilibrium and introduces new bifurcation mechanisms affecting population persistence. We establish the existence of a codimension-three Bogdanov--Takens bifurcation, derive a codimension-three nilpotent-saddle unfolding, and investigate a codimension-two generalized Hopf bifurcation and the emergence of multiple limit cycles. Our analysis show that moderate harvesting weakens the protection conferred by high prey abundance; excessive harvesting leaves too few prey to sustain predator growth; and low harvesting preserves strong group defense, requiring high predator density for population persistence.

q-bio.PE↗

Structural properties of distance-bounded phylogenetic reconciliation

Phylogenetic reconciliation seeks to explain host-symbiont co-evolution by mapping parasite trees onto host trees through events such as cospeciation, duplication, host switching, and loss. Finding an optimal reconciliation that ensures time-consistency is computationally hard when timing information is incomplete, and the complexity remains open when host switches are restricted by a fixed maximum distance $d$. While the case $d = 2$ is known to be polynomial, larger values are unresolved. In this paper, we study the cases $d = 3$ and $d = 4$. We show that although arbitrarily large cycles may occur, it suffices to check only bounded-size cycles (we provide a complete list), provided the reconciliation satisfies acyclicity (i.e., time-consistency) in a stronger sense, which we call strong acyclicity. Strong acyclicity is associated with incorporating discrete time slices into the model.

q-bio.PE↗

Report the tolerance, not the count: exact phylogenetic distance deconvolution with incomplete references

Phylogenetic distance deconvolution represents mixture-to-reference distances by weighted sources placed on a reference tree. We study the minimum number of strictly interior sources that explains a distance profile, and what incomplete references cost. On a positive-rational reduced tree we give an exact algorithm with 2^O(K) poly(B) bit complexity for a free positive mean pendant and any nonempty set of observed leaves. With arbitrary missing references and a prescribed pendant the problem is W[1]-hard in the source budget K, even on positive binary trees supplied with a strict explanation using at most K+1 sources. We then use the algorithm as an instrument. Removing references can only lower the minimum source count, never raise it. The direction is a theorem at every error tolerance and held without exception in 23,545 draws, so which references are missing matters more than how many. Two adversarially chosen references suffice, at the median, to destroy uniqueness of the minimum explanation, and that number does not grow with panel size (Spearman 0.203, p = 0.15, over 20 to 353 references) where random loss scales linearly. Discarding 7,931 of 10,575 references from a real 16S panel at random costs 1.8% of the tolerance at which one source suffices. Discarding comparably many as whole clades costs 90%. That tolerance needs neither ground truth nor an error model, which makes the model measurable on real data. Published distance estimates exceed it in 296 of 296 cases. The mixture inferred by the published heuristic reproduces real observations better than the configuration that generated them in 282 of 296. The phenomenon is not unobservable in practice. It is unobservable through a point estimate of the count. Methods for this problem should report the tolerance at which an explanation of a given size exists.

q-bio.PE↗