Top influencers can be identified universally by combining classical centralities

Abstract

Information flow, opinion, and epidemics spread over structured networks. When using individual node centrality indicators to predict which nodes will be among the top influencers or spreaders in a large network, no single centrality has consistently good ranking power. We show that statistical classifiers using two or more centralities as input are instead consistently predictive over many diverse, static real-world topologies. Certain pairs of centralities cooperate particularly well in statistically drawing the boundary between the top spreaders and the rest: local centralities measuring the size of a node's neighbourhood benefit from the addition of a global centrality such as the eigenvector centrality, closeness, or the core number. This is, intuitively, because a local centrality may rank highly some nodes which are located in dense, but peripheral regions of the network---a situation in which an additional global centrality indicator can help by prioritising nodes located more centrally. The nodes selected as superspreaders will usually jointly maximise the values of both centralities. As a result of the interplay between centrality indicators, training classifiers with seven classical indicators leads to a nearly maximum average precision function (0.995) across the networks in this study.

arXiv comment14 pages, 10 figures, 4 supplementary figures

References in corpus (19)

• Scikit-learn: Machine Learning in Python
• Identification of influential spreaders in complex networks
• Vital nodes identification in complex networks
• Leaders in Social Networks, the Delicious Case
• Ranking spreaders by decomposing complex networks
• Searching for superspreaders of information in real-world social media
• A k-shell decomposition method for weighted networks
• Ranking the spreading influence in complex networks
• Identifying the starting point of a spreading process in complex networks
• Identify influential spreaders in complex networks, the role of neighborhood
• Path diversity improves the identification of influential spreaders
• Leveraging percolation theory to single out influential spreaders in networks
• M-Centrality: identifying key nodes based on global position and local degree variation
• Systematic comparison between methods for the detection of influential spreaders in complex networks
• The Two Kinds of Free Energy and the Bayesian Revolution
• Beyond ranking nodes: Predicting epidemic outbreak sizes by network centralities
• Network-based ranking in social systems: three challenges
• Spreaders in the Network SIR Model: An Empirical Study
• A machine learning approach to predicting dynamical observables from network structure

Cited by in corpus (7)

• Identifying Key Nodes for the Influence Spread using a Machine Learning Approach
• Identifying Influential Brokers on Social Media from Social Network Structure
• Comparing Community-aware Centrality Measures in Online Social Networks
• Identifying Influential Nodes Using Overlapping Modularity Vitality
• Rank-Refining Seed Selection Methods for Budget Constrained Influence Maximisation in Multilayer Networks under Linear Threshold Model
• Predicting Nodal Influence via Local Iterative Metrics
• Large-scale multi-objective influence maximisation with network downscaling