Search arXivSearch

arXiv · 1707.02758

Approximating time to extinction for endemic infection models

Abstract

Approximating the time to extinction of infection is an important problem in infection modelling. A variety of different approaches have been proposed in the literature. We study the performance of a number of such methods, and characterize their performance in terms of simplicity, accuracy, and generality. To this end, we consider first the classic stochastic susceptible-infected-susceptible (SIS) model, and then a multi-dimensional generalization of this which allows for Erlang distributed infectious periods. We find that (i) for a below-threshold infection initiated by a small number of infected individuals, approximation via a linear branching process works well; (ii) for an above-threshold infection initiated at endemic equilibrium, methods from Hamiltonian statistical mechanics yield correct asymptotic behaviour as population size becomes large; (iii) the widely-used Ornstein-Uhlenbeck diffusion approximation gives a very poor approximation, but may retain some value for qualitative comparisons in certain cases; (iv) a more detailed diffusion approximation can give good numerical approximation in certain circumstances, but does not provide correct large population asymptotic behaviour, and cannot be relied upon without some form of external validation (eg simulation studies).

Explore related subjects

Keep this discovery

BibTeXRIS

Damian Clancy, Elliott Tjia. 2017-07-10. Approximating time to extinction for endemic infection models. https://arxiv.org/abs/1707.02758

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

KEEP EXPLORING

Related papers

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

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

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