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

From MaRDI portal
Publication:417072

DOI10.1214/11-AAP773zbMATH Open1263.92040arXiv1007.3958MaRDI QIDQ417072FDOQ417072


Authors: Laurent Decreusefond, Jean-Stéphane Dhersin, Pascal Moyal, Viet Chi Tran Edit this on Wikidata


Publication date: 13 May 2012

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1007.3958




Recommendations




Cites Work


Cited In (49)





This page was built for publication: Large graph limit for an SIR process in random network with heterogeneous connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417072)