Predicting Nodal Influence via Local Iterative Metrics

Abstract

Nodal spreading influence is the capability of a node to activate the rest of the network when it is the seed of spreading. Combining nodal properties (centrality metrics) derived from local and global topological information respectively is shown to better predict nodal influence than a single metric. In this work, we investigate to what extent local and global topological information around a node contributes to the prediction of nodal influence and whether relatively local information is sufficient for the prediction. We show that by leveraging the iterative process used to derives a classical nodal centrality such as eigenvector centrality, we can define an iterative metric set that progressively incorporates more global information around the node. We propose to predict nodal influence using an iterative metric set that consists of an iterative metric from order $1$ to $K$ that are produced in an iterative process, encoding gradually more global information as $K$ increases. Three iterative metrics are considered, which converge to three classical node centrality metrics respectively. Our results show that for each of the three iterative metrics, the prediction quality is close to optimal when the metric of relatively low orders ($K\sim 4$) are included and increases only marginally when further increasing $K$. The best performing iterative metric set shows comparable prediction quality to the benchmark that combines seven centrality metrics, in both real-world networks and synthetic networks with community structures. Our findings are further explained via the correlation between an iterative metric and nodal influence, the convergence of iterative metrics and network properties.

References in corpus (22)

• Epidemic processes in complex networks
• Identification of influential spreaders in complex networks
• Benchmark graphs for testing community detection algorithms
• The Dynamics of Viral Marketing
• Community detection in networks: A user guide
• Vital nodes identification in complex networks
• Influence of fake news in Twitter during the 2016 US presidential election
• k-core organization of complex networks
• Searching for superspreaders of information in real-world social media
• Spreading dynamics in complex networks
• Understanding the spreading power of all nodes in a network: a continuous-time perspective
• A measure of individual role in collective dynamics
• Local structure can identify and quantify influential global spreaders in large scale social networks
• Correlation between centrality metrics and their application to the opinion model
• Quantifying the influence of scientists and their publications: Distinguish prestige from popularity
• Characterizing the Interactions Between Classical and Community-aware Centrality Measures in Complex Networks
• Epidemic centrality - is there an underestimated epidemic impact of network peripheral nodes?
• Top influencers can be identified universally by combining classical centralities
• Ranking influential nodes in networks from partial information
• SI-spreading-based network embedding in static and temporal networks
• The long-term impact of ranking algorithms in growing networks
• Measuring nodes centrality when local and global measures overlap