Ranking influential spreaders is an ill-defined problem

@article{Gu2017RankingIS,
  title={Ranking influential spreaders is an ill-defined problem},
  author={Jain Gu and Sungmin Lee and Jari Saram{\"a}ki and Petter Holme},
  journal={ArXiv},
  year={2017},
  volume={abs/1703.05644}
}
Finding influential spreaders of information and disease in networks is an important theoretical problem, and one of considerable recent interest. It has been almost exclusively formulated as a node-ranking problem —methods for identifying influential spreaders output a ranking of the nodes. In this work, we show that such a greedy heuristic does not necessarily work: the set of most influential nodes depends on the number of nodes in the set. Therefore, the set of n most important nodes to… 

Figures from this paper

Identifying Multiple Influential Spreaders in Complex Networks by Considering the Dispersion of Nodes
TLDR
The experimental results show that the proposed methods can identify nodes that are more influential, which suggests that taking into account the distances between nodes may aid in the identification of multiple influential spreaders.
Identifying Multiple Influential Spreaders in Complex Networks by Considering the Dispersion of Nodes
TLDR
The experimental results show that the proposed methods can identify nodes that are more influential, which suggests that taking into account the distances between nodes may aid in the identification of multiple influential spreaders.
Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities
TLDR
This work investigates how well the position of a node, characterized by standard network measures, can predict its epidemiological importance in any graph of a given number of nodes to find that combinations of two or more centralities are predictive even for the most difficult parameter values of the epidemic simulation.
Three faces of node importance in network epidemiology: Exact results for small graphs
TLDR
It is found that node separation is more important than centrality for more than one active node, vaccination and influence maximization are the most different aspects of importance, and the three aspects are more similar when the infection rate is low.
Link transmission centrality in large-scale social networks
TLDR
A new measure based on stochastic diffusion processes, the transmission centrality, that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process is proposed.
Influencers identification in complex networks through reaction-diffusion dynamics
TLDR
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.
Dynamics of ranking
Virtually anything can be and is ranked; people, institutions, countries, words, genes. Rankings reduce complex systems to ordered lists, reflecting the ability of their elements to perform relevant
Influencer identification in dynamical complex systems
TLDR
This review surveys recent advances in the study of influencer identification developed from different perspectives, and presents state-of-the-art solutions designed for different objectives.
...
...

References

SHOWING 1-10 OF 24 REFERENCES
Influence maximization in complex networks through optimal percolation
TLDR
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.
Benchmarking Measures of Network Influence
TLDR
It is found that none of the network measures applied to the induced flat graphs are accurate predictors of network propagation influence on the systems studied; however, temporal networks and the TKO measure provide the requisite targets for the search for effective predictive measures.
Locating influential nodes via dynamics-sensitive centrality
TLDR
A dynamics-sensitive (DS) centrality is presented by integrating topological features and dynamical properties and is more accurate than degree, k-shell index and eigenvector centrality.
Identification of influential spreaders in complex networks
Spreading of information, ideas or diseases can be conveniently modelled in the context of complex networks. An analysis now reveals that the most efficient spreaders are not always necessarily the
Immunization and targeted destruction of networks using explosive percolation
TLDR
Tests on several real-world and model networks suggest that the method is more efficient and faster than any existing immunization strategy and because of the latter property it can deal with very large networks.
Networks and epidemic models
TLDR
A variety of methods are described that allow the mixing network, or an approximation to the network, to be ascertained and how the two fields of network theory and epidemiological modelling can deliver an improved understanding of disease dynamics and better public health through effective disease control are suggested.
Networks: An Introduction
TLDR
This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.
Epidemic processes in complex networks
TLDR
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.
Mathematics of Epidemics on Networks: From Exact to Approximate Models
This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to
...
...