Leveraging percolation theory to single out influential spreaders in networks

  title={Leveraging percolation theory to single out influential spreaders in networks},
  author={Filippo Radicchi and Claudio Castellano},
  journal={Physical review. E},
  volume={93 6},
Among the consequences of the disordered interaction topology underlying many social, technological, and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the complex interaction pattern. For example, the early adoption of a commercial product by an opinion leader in a social network may change its fate or just a few superspreaders may determine the virality of… 

Figures from this paper

Influential spreaders for recurrent epidemics on networks

This work applies the theoretical framework for avalanches on networks proposed by Larremore et al. to the Susceptible-Infected-Susceptible spreading model, and obtains detailed quantitative predictions for the spreading influence of individual nodes both above and below the epidemic threshold.

Influencers identification in complex networks through reaction-diffusion dynamics

It is shown that the new centrality metric significantly outperforms state-of-the-art metrics in detecting the influencers for global contagion processes and reveals the essential role of the network effective distance for the influencer identification and lead to the optimal solution of the problem.

Effect of network clustering on mutually cooperative coinfections.

It is shown that for large cooperativity the epidemic transition is always abrupt, with the discontinuity decreasing as clustering is increased, and for large clustering strong finite-size effects are present and the discontinuous nature of the transition is manifest only in large networks.

Theories for influencer identification in complex networks

This chapter first summarizes the centrality-based approach in finding single influencers in complex networks, and then discusses the more complicated problem of locating multiple influencers from a collective point of view.

Systematic comparison between methods for the detection of influential spreaders in complex networks

It is found that relatively simple network metrics, such as adaptive degree or closeness centralities, are able to achieve performances very close to the baseline value, thus providing good support for the use of these metrics in large-scale problem settings.

The localization of non-backtracking centrality in networks and its physical consequences

This work identifies the mechanism responsible for this violation in the localization of the non-backtracking centrality on network subgraphs whose formation is highly unlikely in uncorrelated networks, but rather common in real-world structures and presents an heuristic generalized formula for the largest eigenvalue.

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

The problem of finding important spreaders is directly tackled by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed using a message-passing approach and the approach can be successfully adapted into weighted networks.

Message-passing theory for cooperative epidemics.

A simple model for two interacting pathogens on a network is considered and it is studied by using the message-passing approach, able to provide detailed predictions for the behavior of the model in the whole phase-diagram for any given network structure.



Influence maximization in complex networks through optimal percolation

This work maps the problem onto optimal percolation in random networks to identify the minimal set of influencers, which arises by minimizing the energy of a many-body system, where the form of the interactions is fixed by the non-backtracking matrix of the network.

Spreading dynamics in complex networks

Some of the most important theoretical models that describe spreading processes are displayed, and the problem of locating both the individual and multiple influential spreaders respectively are discussed.

Second look at the spread of epidemics on networks.

  • E. KenahJ. Robins
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2007
A semidirected random network is defined the authors call the epidemic percolation network that is exactly isomorphic to the SIR epidemic model in any finite population and can be defined for any time-homogeneous stochastic SIR model.

The role of centrality for the identification of influential spreaders in complex networks

This paper investigates how nine centrality measures correlate with the disease and rumor spreading capabilities of the nodes in different synthetic and real-world networks and proposes a generalization of the random walk accessibility as a new centrality measure and derive analytical expressions for the latter measure for simple network configurations.

Predicting epidemic outbreak from individual features of the spreaders

This paper explores possible correlations between the heterogeneous spread of an epidemic disease governed by the susceptible–infected–recovered (SIR) model, and several attributes of the originating vertices, considering Erdos–Renyi (ER), Barabasi–Albert and random geometric graphs (RGG), as well as a real case study, the US air transportation network.

Spread of epidemic disease on networks.

  • M. Newman
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
This paper shows that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks.

Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: A walk counting approach

crucially, in simulating infections on various real-world networks with the SIR model, it is shown that the walks-based method improves the inference of the effectiveness of nodes over a wide range of infection rates compared to existing methods.

Epidemic processes in complex networks

A coherent and comprehensive review of the vast research activity concerning epidemic processes is presented, detailing the successful theoretical approaches as well as making their limits and assumptions clear.

Percolation on sparse networks

Percolation is reformulate as a message passing process and the resulting equations can be used to calculate the size of the percolating cluster and the average cluster size, finding them to be highly accurate when compared with direct numerical simulations.

Optimizing spread dynamics on graphs by message passing

It is shown that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks.