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

Descripción completa

Detalles Bibliográficos
Autores principales: Tolić, Dijana, Kleineberg, Kaj-Kolja, Antulov-Fantulin, Nino
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2018
Materias:
Article
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

Internet

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