Leveraging local h-index to identify and rank influential spreaders in networks
August 31, 2017 Β· Declared Dead Β· π Physica A: Statistical Mechanics and its Applications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Qiang Liu, Yuxiao Zhu, Yan Jia, Lu Deng, Bin Zhou, Junxing Zhu, Peng Zou
arXiv ID
1708.09532
Category
physics.soc-ph
Cross-listed
cs.SI
Citations
61
Venue
Physica A: Statistical Mechanics and its Applications
Last Checked
2 months ago
Abstract
Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Traditional methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, have more or less disadvantages in detecting influential nodes, which have been illustrated in related literatures. Recently, the h-index, which is utilized to measure both the productivity and citation impact of the publications of a scientist or scholar, has been introduced to the network world to evaluate a node's spreading ability. However, this method assigns too many nodes with the same value, which leads to a resolution limit problem in distinguishing the real influence of these nodes. In this paper, we propose a local h-index centrality (LH-index) method for identifying and ranking 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 connects to more influential nodes will also be influential. According to the simulation results with the stochastic Susceptible-Infected-Recovered (SIR) model in four real world networks and several simulated networks, we demonstrate the effectivity of the LH-index method in identifying influential nodes in networks.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β physics.soc-ph
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Networks beyond pairwise interactions: structure and dynamics
R.I.P.
π»
Ghosted
Statistical physics of human cooperation
R.I.P.
π»
Ghosted
Vital nodes identification in complex networks
R.I.P.
π»
Ghosted
Influence maximization in complex networks through optimal percolation
R.I.P.
π»
Ghosted
Scale-free networks are rare
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted