Epidemic spreading driven by biased random walks
arXiv:1408.0063 · doi:10.1016/j.physa.2015.03.035
Abstract
Random walk is one of the basic mechanisms found in many network applications. We study the epidemic spreading dynamics driven by biased random walks on complex networks. In our epidemic model, each time infected nodes constantly spread some infected packets by biased random walks to their neighbor nodes causing the infection of the susceptible nodes that receive the packets. An infected node get recovered from infection with a fixed probability. Simulation and analytical results on model and real-world networks show that the epidemic spreading becomes intense and wide with the increase of delivery capacity of infected nodes, average node degree, homogeneity of node degree distribution. Furthermore, there are corresponding optimal parameters such that the infected nodes have instantaneously the largest population, and the epidemic spreading process covers the largest part of a network.
9 figures
References in corpus (20)
- Epidemic spreading in scale-free networks
- The spread of epidemic disease on networks
- Resilience of the Internet to random breakdowns
- Critical phenomena in complex networks
- Universal Behavior of Load Distribution in Scale-free Networks
- Prediction and predictability of global epidemics: the role of the airline transportation network
- Dynamical interplay between awareness and epidemic spreading in multiplex networks
- Understanding the spreading patterns of mobile phone viruses
- Epidemic spreading on interconnected networks
- Epidemic spreading on heterogeneous networks with identical infectivity
- Reconstructing propagation networks with natural diversity and identifying hidden sources
- Traffic-driven Epidemic Spreading in Finite-size Scale-Free Networks
- Maximal-entropy random walks in complex networks with limited information
- Random walks on weighted networks
- Collective synchronization induced by epidemic dynamics on complex networks with communities
- Characteristic times of biased random walks on complex networks
- Epidemic Spreading in Weighted Networks: An Edge-Based Mean-Field Solution
- Optimal Paths in Complex Networks with Correlated Weights: The World-wide Airport Network
- Suppressing traffic-driven epidemic spreading by edge-removal strategies
- An efficient strategy to suppress epidemic explosion in heterogeneous metapopulation networks
Cited by in corpus (9)
- Interacting spreading processes in multilayer networks
- Link prediction based on path entropy
- Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol
- Suppressing traffic-driven epidemic spreading by adaptive routing strategy
- Suppressing epidemic spreading by risk-averse migration in dynamical networks
- Optimal exploration of random walks with local bias on networks
- Information transmission on hybrid networks
- Degree-penalized contact processes
- Multiple predator based capture process on complex networks