Search arXivSearch

arXiv · 1808.08100

A stochastic SIR network epidemic model with preventive dropping of edges

Abstract

A Markovian SIR (Susceptible-Infectious-Recovered) model is considered for the spread of an epidemic on a configuration model network, in which susceptible individuals may take preventive measures by dropping edges to infectious neighbours. An effective degree formulation of the model is used in conjunction with the theory of density dependent population processes to obtain a law of large numbers and a functional central limit theorem for the epidemic as the population size $N \to \infty$, assuming that the degrees of individuals are bounded. A central limit theorem is conjectured for the final size of the epidemic. The results are obtained for both the Molloy-Reed (in which the degrees of individuals are deterministic) and Newman-Strogatz-Watts (in which the degrees of individuals are independent and identically distributed) versions of the configuration model. The two versions yield the same limiting deterministic model but the asymptotic variances in the central limit theorema are greater in the Newman-Strogatz-Watts version. The basic reproduction number $R_0$ and the process of susceptible individuals in the limiting deterministic model, for the model with dropping of edges, are the same as for a corresponding SIR model without dropping of edges but an increased recovery rate, though, when $R_0>1$, the probability of a major outbreak is greater in the model with dropping of edges. The results are specialised to the model without dropping of edges to yield conjectured central limit theorems for the final size of Markovian SIR epidemics on configuration-model networks, and for the giant components of those networks. The theory is illustrated by numerical studies, which demonstrate that the asymptotic approximations are good, even for moderate $N$.

Explore related subjects

Keep this discovery

BibTeXRIS

Frank Ball, Tom Britton, Ka Yin Leung, David Sirl. 2018-08-24. A stochastic SIR network epidemic model with preventive dropping of edges. https://arxiv.org/abs/1808.08100

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