Search arXivSearch

arXiv · 1805.05034

A stochastic SIR model on a graph with epidemiological and population dynamics occurring over the same time scale

Abstract

We define and study an open stochastic SIR (Susceptible -- Infected -- Removed) model on a graph in order to describe the spread of an epidemic on a cattle trade network with epidemiological and demographic dynamics occurring over the same time scale. Population transition intensities are assumed to be density-dependent with a constant component, the amplitude of which determines the overall scale of the population process. Standard branching approximation results for the epidemic process are first given, along with a numerical computation method for the probability of a major epidemic outbreak. This procedure is illustrated using real data on trade-related cattle movements from a densely populated livestock farming region in western France (Finist\`ere) and epidemiological parameters corresponding to an infectious epizootic disease. Then we exhibit an exponential lower bound for the extinction time and the total size of the epidemic in the stable endemic case as a scaling parameter goes to infinity using results inspired by the Freidlin-Wentzell theory of large deviations from a dynamical system.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Montagnon. 2018-05-14. A stochastic SIR model on a graph with epidemiological and population dynamics occurring over the same time scale. https://arxiv.org/abs/1805.05034

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