Identifying an influential spreader from a single seed in complex networks via a message-passing approach

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.

arXiv comment6 pages, 3 figures

References in corpus (33)

• Error and attack tolerance of complex networks
• Epidemic processes in complex networks
• The spread of epidemic disease on networks
• Identification of influential spreaders in complex networks
• Spatial Networks
• Influence maximization in complex networks through optimal percolation
• Universal Behavior of Load Distribution in Scale-free Networks
• Efficient Immunization Strategies for Computer Networks and Populations
• k-core organization of complex networks
• A message passing approach for general epidemic models
• Searching for superspreaders of information in real-world social media
• Inferring the origin of an epidemic with a dynamic message-passing algorithm
• Localization and centrality in networks
• Percolation on sparse networks
• Network dismantling
• A k-shell decomposition method for weighted networks
• Spreading dynamics in complex networks
• Absence of influential spreaders in rumor dynamics
• Information dynamics shape the networks of Internet-mediated prostitution
• Data on face-to-face contacts in an office building suggests a low-cost vaccination strategy based on community linkers
• A measure of individual role in collective dynamics
• Efficient local strategies for vaccination and network attack
• Identify influential spreaders in complex networks, the role of neighborhood
• Competing activation mechanisms in epidemics on networks
• Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: a walk counting approach
• Immunization of networks with community structure
• Leveraging percolation theory to single out influential spreaders in networks
• Optimal Deployment of Resources for Maximizing Impact in Spreading Processes
• Dynamic message-passing equations for models with unidirectional dynamics
• Beyond the locally tree-like approximation for percolation on real networks
• Model of Brain Activation Predicts the Neural Collective Influence Map of the Brain
• Fundamental difference between superblockers and superspreaders in networks
• Finding influential spreaders from human activity beyond network location

Cited by in corpus (11)

• Message-passing theory for cooperative epidemics
• Correlated network of networks enhances robustness against catastrophic failures
• Influential spreaders for recurrent epidemics on networks
• A centrality measure for quantifying spread on weighted, directed networks
• Effect of network clustering on mutually cooperative coinfections
• Influence of individual nodes for continuous-time Susceptible-Infected-Susceptible dynamics on synthetic and real-world networks
• Localization of nonbacktracking centrality on dense subgraphs of sparse networks
• Interplay between degree and Boolean rules in the stability of Boolean networks
• Dynamics of attractor transitions in Boolean networks under noise
• How network properties and epidemic parameters influence stochastic SIR dynamics on scale-free random networks
• Approximating nonbacktracking centrality and localization phenomena in large networks