Simulating SIR processes on networks using weighted shortest paths
arXiv:1612.08629 · doi:10.1038/s41598-018-24648-w
Abstract
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 adjacent nodes for a particular realization. We simulate the dynamics by constructing an ensemble of such realizations, which can be done by using a Markov Chain Monte Carlo method or by direct sampling. The former provides a runtime advantage when realizations from all possible sources are computed as the weighted shortest paths can be re-calculated more efficiently. We apply our framework to three empirical networks and analyze the expected propagation time between all pairs of nodes. Furthermore, we have employed our framework to perform efficient source detection and to improve strategies for time-critical vaccination.
References in corpus (27)
- Epidemic spreading in scale-free networks
- Epidemic processes in complex networks
- The spread of epidemic disease on networks
- Self-similar community structure in organisations
- Statistical physics of vaccination
- Thresholds for epidemic spreading in networks
- Saving Human Lives: What Complexity Science and Information Systems can Contribute
- Locating the Source of Diffusion in Large-Scale Networks
- A message passing approach for general epidemic models
- Inferring the origin of an epidemic with a dynamic message-passing algorithm
- Second look at the spread of epidemics on networks
- Bayesian inference of epidemics on networks via Belief Propagation
- Identifying the starting point of a spreading process in complex networks
- Optimal Paths in Disordered Complex Networks
- Simulating non-Markovian stochastic processes
- Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
- Effective Distances for Epidemics Spreading on Complex Networks
- Global disease spread: statistics and estimation of arrival times
- Identification of Patient Zero in Static and Temporal Networks - Robustness and Limitations
- Equivalence between non-Markovian and Markovian dynamics in epidemic spreading processes
- Universal behavior of optimal paths in weighted networks with general disorder
- Exact equations for SIR epidemics on tree graphs
- Effect of Disorder Strength on Optimal Paths in Complex Networks
- Stochasticity in pandemic spread over the World Airline Network explained by local flight connections
- FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model
- Degree distribution of shortest path trees and bias of network sampling algorithms
- Exact deterministic representation of Markovian SIR epidemics on networks with and without loops
Cited by in corpus (6)
- Generalized Network Dismantling
- Coronavirus Optimization Algorithm: A bioinspired metaheuristic based on the COVID-19 propagation model
- Combined Centrality Measures for an Improved Characterization of Influence Spread in Social Networks
- Unifying continuous, discrete, and hybrid susceptible-infected-recovered processes on networks
- Some Challenges in Monitoring Epidemics
- Estimating the Expected Influence Capacities of Nodes in Complex Networks under the Susceptible-Infectious-Recovered (SIR) Model