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

Research output: Contribution to journalArticlepeer-review

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].

Original languageEnglish
Pages (from-to)541-575
Number of pages35
JournalAnnals of Applied Probability
Volume22
Issue number2
DOIs
Publication statusPublished - 1 Jan 2012
Externally publishedYes

Keywords

  • Configuration model graph
  • Large network limit
  • Mathematical model for epidemiology
  • Measure-valued process
  • SIR model

Fingerprint

Dive into the research topics of 'Large graph limit for an sir process in random network with heterogeneous connectivity'. Together they form a unique fingerprint.

Cite this