Effective Distances for Epidemics Spreading on Complex Networks

Abstract

We show that the recently introduced logarithmic metrics used to predict disease arrival times on complex networks are approximations of more general network-based measures derived from random walks theory. Using the daily air-traffic transportation data we perform numerical experiments to compare the infection arrival time with this alternative metric that is obtained by accounting for multiple walks instead of only the most probable path. The comparison with direct simulations of arrival times reveals a higher correlation compared to the shortest path approach used previously. In addition our method allows to connect fundamental observables in epidemic spreading with the cumulant generating function of the hitting time for a Markov chain. Our results provides a general and computationally efficient approach to the problem using only algebraic methods.

F.I. and A.K. contributed equally to this work. Skripts can be found on GitHub: https://github.com/andreaskoher/effective_distance

References in corpus (14)

• Emergence of scaling in random networks
• Power-law distributions in empirical data
• Epidemic spreading in scale-free networks
• The architecture of complex weighted networks
• Statistical physics of social dynamics
• Epidemic processes in complex networks
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• Predictability and epidemic pathways in global outbreaks of infectious diseases: the SARS case study
• Optimal Paths in Disordered Complex Networks
• Global disease spread: statistics and estimation of arrival times
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• Epidemic variability in complex networks
• Arrival Time Statistics in Global Disease Spread
• Stochasticity in pandemic spread over the World Airline Network explained by local flight connections

Cited by in corpus (28)

• Random walks and diffusion on networks
• Network Geometry
• Ranking in evolving complex networks
• Cover time for random walks on arbitrary complex networks
• Perspectives on adaptive dynamical systems
• Big Networks: A Survey
• Contact-based model for epidemic spreading on temporal networks
• Extreme first passage times for random walks on networks
• Epidemic spreading in populations of mobile agents with adaptive behavioral response
• Topological Determinants of Perturbation Spreading in Networks
• Generalization of the small-world effect on a model approaching the Erdős-Rényi random graph
• Influencers identification in complex networks through reaction-diffusion dynamics
• Randomizing growing networks with a time-respecting null model
• Piecewise quadratic growth during the 2019 novel coronavirus epidemic
• Reactive random walkers on complex networks
• Simulating SIR processes on networks using weighted shortest paths
• Epidemic extinction in networks: Insights from the 12,110 smallest graphs
• Epidemic Arrival Times; Theory, Discussion, and Limitations
• Quantifying Transient Spreading Dynamics on Networks
• A realistic agent-based simulation model for COVID-19 based on a traffic simulation and mobile phone data
• Estimating epidemic arrival times using linear spreading theory
• Dynamic perturbation spreading in networks
• Higher order assortativity for directed weighted networks and Markov chains
• The big bang of an epidemic
• On the degree of synchronization between air transport connectivity and COVID-19 cases at worldwide level
• Reaction-diffusion on random spatial networks with scale-free jumping rates via effective medium theory
• Latent geometry emerging from network-driven processes
• Molecular Communications at the Macroscale: A Novel Framework for Modeling Epidemic Spreading and Mitigation