Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1802.04037

Extinction time for the weaker of two competing SIS epidemics

Fabio Lopes·Malwina Luczak
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a simple stochastic model for the spread of a disease caused by two virus strains in a closed homogeneously mixing population of size N. The spread of each strain in the absence of the other one is described by the stochastic logistic SIS epidemic process, and we assume that there is perfect cross-immunity between the two strains, that is, individuals infected by one are temporarily immune to re-infections and infections by the other. For the case where one strain has a strictly larger basic reproductive ratio than the other, and the stronger strain on its own is supercritical (that is, its basic reproductive ratio is larger than 1), we derive precise asymptotic results for the distribution of the time when the weaker strain disappears from the population, that is, its extinction time. We further extend our results to certain parameter values where the difference between the two reproductive ratios may tend to 0 as $N \to \infty$. In proving our results, we illustrate a new approach to a fluid limit approximation for a sequence of Markov chains in the vicinity of a stable fixed point of the limit.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Fabio Lopes, Malwina Luczak. 2018-02-12. Extinction time for the weaker of two competing SIS epidemics. https://arxiv.org/abs/1802.04037

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

KEEP EXPLORING

Related papers

arXiv2026

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR↗
arXiv2026

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR↗
arXiv2026

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR↗