Large graph limit for an sir process in random network with heterogeneous connectivity

70Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

Abstract

We consider an SIR epidemic model propagating on a configuration model network, where the degree distribution of the vertices is given and where the edges are randomly matched. The evolution of the epidemic is summed up into three measure-valued equations that describe the degrees of the susceptible individuals and the number of edges from an infectious or removed individual to the set of susceptibles. These three degree distributions are sufficient to describe the course of the disease. The limit in large population is investigated. As a corollary, this provides a rigorous proof of the equations obtained by Volz [Mathematical Biology 56 (2008) 293-310]. © Institute of Mathematical Statistics, 2012.

Cite

CITATION STYLE

APA

Decreusefond, L., Dhersin, J. S., Moyal, P., & Tran, V. C. (2012). Large graph limit for an sir process in random network with heterogeneous connectivity. Annals of Applied Probability, 22(2), 541–575. https://doi.org/10.1214/11-AAP773

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free