The deterministic Kermack-McKendrick model bounds the general stochastic epidemic

From MaRDI portal
Publication:2956508

DOI10.1017/JPR.2016.62zbMATH Open1353.92105arXiv1602.01730OpenAlexW2963371912MaRDI QIDQ2956508FDOQ2956508


Authors: Robert R. Wilkinson, Kieran J. Sharkey, Frank Ball Edit this on Wikidata


Publication date: 17 January 2017

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

Abstract: We prove that, for Poisson transmission and recovery processes, the classic Susceptible o Infected o Recovered (SIR) epidemic model of Kermack and McKendrick provides, for any given time t>0, a strict lower bound on the expected number of suscpetibles and a strict upper bound on the expected number of recoveries in the general stochastic SIR epidemic. The proof is based on the recent message passing representation of SIR epidemics applied to a complete graph.


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




Recommendations





Cited In (7)





This page was built for publication: The deterministic Kermack-McKendrick model bounds the general stochastic epidemic

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