Identifying an influential spreader from a single seed in complex networks via a message-passing approach
arXiv:1710.07064 · doi:10.1140/epjb/e2017-80597-1
Abstract
Identifying the most influential spreaders is one of outstanding problems in physics of complex systems. So far, many approaches have attempted to rank the influence of nodes but there is still the lack of accuracy to single out influential spreaders. Here, we directly tackle the problem of finding important spreaders by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed. We derive and validate a theory for calculating the size of epidemic outbreaks with a single seed using a message-passing approach. In addition, we find that the probability to occur epidemic outbreaks is highly dependent on the location of the seed but the size of epidemic outbreaks once it occurs is insensitive to the seed. We also show that our approach can be successfully adapted into weighted networks.
6 pages, 3 figures
References in corpus (10)
- Efficient Immunization Strategies for Computer Networks and Populations
- A message passing approach for general epidemic models
- Searching for superspreaders of information in real-world social media
- Percolation on sparse networks
- A k-shell decomposition method for weighted networks
- Information dynamics shape the networks of Internet-mediated prostitution
- Efficient local strategies for vaccination and network attack
- Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach
- Dynamic message-passing equations for models with unidirectional dynamics
- Fundamental difference between superblockers and superspreaders in networks