Literature DB >> 20866683

Message passing approach for general epidemic models.

Brian Karrer1, M E J Newman.   

Abstract

In most models of the spread of disease over contact networks it is assumed that the probabilities per unit time of disease transmission and recovery from disease are constant, implying exponential distributions of the time intervals for transmission and recovery. Time intervals for real diseases, however, have distributions that in most cases are far from exponential, which leads to disagreements, both qualitative and quantitative, with the models. In this paper, we study a generalized version of the susceptible-infected-recovered model of epidemic disease that allows for arbitrary distributions of transmission and recovery times. Standard differential equation approaches cannot be used for this generalized model, but we show that the problem can be reformulated as a time-dependent message passing calculation on the appropriate contact network. The calculation is exact on trees (i.e., loopless networks) or locally treelike networks (such as random graphs) in the large system size limit. On non-tree-like networks we show that the calculation gives a rigorous bound on the size of disease outbreaks. We demonstrate the method with applications to two specific models and the results compare favorably with numerical simulations.

Entities:  

Year:  2010        PMID: 20866683     DOI: 10.1103/PhysRevE.82.016101

Source DB:  PubMed          Journal:  Phys Rev E Stat Nonlin Soft Matter Phys        ISSN: 1539-3755


  34 in total

1.  Heterogeneous node responses to multi-type epidemics on networks.

Authors:  S Moore; T Rogers
Journal:  Proc Math Phys Eng Sci       Date:  2020-11-04       Impact factor: 2.704

2.  The relationships between message passing, pairwise, Kermack-McKendrick and stochastic SIR epidemic models.

Authors:  Robert R Wilkinson; Frank G Ball; Kieran J Sharkey
Journal:  J Math Biol       Date:  2017-04-13       Impact factor: 2.259

3.  Network reconstruction from infection cascades.

Authors:  Alfredo Braunstein; Alessandro Ingrosso; Anna Paola Muntoni
Journal:  J R Soc Interface       Date:  2019-02-28       Impact factor: 4.118

4.  Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm.

Authors:  Guillaume St-Onge; Jean-Gabriel Young; Laurent Hébert-Dufresne; Louis J Dubé
Journal:  Comput Phys Commun       Date:  2019-02-19       Impact factor: 4.390

5.  Exact deterministic representation of Markovian SIR epidemics on networks with and without loops.

Authors:  Istvan Z Kiss; Charles G Morris; Fanni Sélley; Péter L Simon; Robert R Wilkinson
Journal:  J Math Biol       Date:  2014-03-04       Impact factor: 2.259

6.  Pairwise approximation for SIR-type network epidemics with non-Markovian recovery.

Authors:  G Röst; Z Vizi; I Z Kiss
Journal:  Proc Math Phys Eng Sci       Date:  2018-02-21       Impact factor: 2.704

7.  Optimal deployment of resources for maximizing impact in spreading processes.

Authors:  Andrey Y Lokhov; David Saad
Journal:  Proc Natl Acad Sci U S A       Date:  2017-09-12       Impact factor: 11.205

8.  Message passing on networks with loops.

Authors:  George T Cantwell; M E J Newman
Journal:  Proc Natl Acad Sci U S A       Date:  2019-11-04       Impact factor: 11.205

Review 9.  Coevolution spreading in complex networks.

Authors:  Wei Wang; Quan-Hui Liu; Junhao Liang; Yanqing Hu; Tao Zhou
Journal:  Phys Rep       Date:  2019-07-29       Impact factor: 25.600

10.  Exact Equations for SIR Epidemics on Tree Graphs.

Authors:  K J Sharkey; I Z Kiss; R R Wilkinson; P L Simon
Journal:  Bull Math Biol       Date:  2013-12-18       Impact factor: 1.758

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.