Leveraging local h-index to identify and rank influential spreaders in networks

Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Some classical methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, were reported to have som...

Full description

Saved in:
Bibliographic Details
Published inPhysica A Vol. 512; pp. 379 - 391
Main Authors Liu, Qiang, Zhu, Yu-Xiao, Jia, Yan, Deng, Lu, Zhou, Bin, Zhu, Jun-Xing, Zou, Peng
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.12.2018
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Some classical methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, were reported to have some limitations in detecting influential nodes. Recently, the famous h-index was introduced to the network world to evaluate the spreading ability of the nodes. However, this method always assigns too many nodes with the same value, which leads to a resolution limit problem in distinguishing the real influences of these nodes. In this paper, we propose a local h-index centrality (LH-index) method to identify and rank influential nodes in networks. The LH-index method simultaneously takes into account of h-index values of the node itself and its neighbors, which is based on the idea that a node connecting to more influential nodes will also be influential. Experimental analysis on stochastic Susceptible–Infected–Recovered (SIR) model and several networks demonstrates the effectivity of the LH-index method in identifying influential nodes in networks. •We propose a local h-index centrality (LH-index) method for identifying and ranking influential spreaders in networks.•The LH-index can resolve the resolution limit problem of the H-index.•The LH-index does not need the global topological information of the network.•The LH-index value of a node is not sensitive to the small variation of the degree information of the node itself and its neighbors.•The performance of the LH-index shows its superiority in both real world and simulated networks.
ISSN:0378-4371
1873-2119
DOI:10.1016/j.physa.2018.08.053