Cargando…
Simulating SIR processes on networks using weighted shortest paths
We present a framework to simulate SIR processes on networks using weighted shortest paths. Our framework maps the SIR dynamics to weights assigned to the edges of the network, which can be done for Markovian and non-Markovian processes alike. The weights represent the propagation time between the a...
Autores principales: | Tolić, Dijana, Kleineberg, Kaj-Kolja, Antulov-Fantulin, Nino |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5920074/ https://www.ncbi.nlm.nih.gov/pubmed/29700314 http://dx.doi.org/10.1038/s41598-018-24648-w |
Ejemplares similares
-
Shortest Paths in Multiplex Networks
por: Ghariblou, Saeed, et al.
Publicado: (2017) -
AI Pontryagin or how artificial neural networks learn to control dynamical systems
por: Böttcher, Lucas, et al.
Publicado: (2022) -
On the accuracy of short-term COVID-19 fatality forecasts
por: Antulov-Fantulin, Nino, et al.
Publicado: (2022) -
Generalized network dismantling
por: Ren, Xiao-Long, et al.
Publicado: (2019) -
Shortest path counting in probabilistic biological networks
por: Ren, Yuanfang, et al.
Publicado: (2018)