The deterministic Kermack-McKendrick model bounds the general stochastic epidemic
From MaRDI portal
Publication:2956508
Abstract: We prove that, for Poisson transmission and recovery processes, the classic Susceptible Infected Recovered (SIR) epidemic model of Kermack and McKendrick provides, for any given time , 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.
Recommendations
- The relationships between message passing, pairwise, Kermack-McKendrick and stochastic SIR epidemic models
- Kermack-McKendrick epidemics vaccinated
- A class of stochastic epidemic models and its deterministic counterpart
- Deterministic and stochastic SIR epidemic models with power function transmission and recovery rates
- Epidemics Between Bailey and Reed-Frost: A Stochastic Version of the Kermack and Mckendrick Model
Cited in
(7)- The Kermack--McKendrick epidemic model revisited
- Dominating occupancy processes by the independent site approximation
- The relationships between message passing, pairwise, Kermack-McKendrick and stochastic SIR epidemic models
- Analysis of a spatially inhomogeneous stochastic partial differential equation epidemic model
- scientific article; zbMATH DE number 5788574 (Why is no real title available?)
- scientific article; zbMATH DE number 5269097 (Why is no real title available?)
- Elementary proof of convergence to the mean-field model for the SIR process
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)