International Journal of Modern Physics C · 2016 · 44 citations · 55 references
ComputingComputer ScienceComputer NetworksNetwork BiologySocial InfluenceNetwork AnalysisNetwork CentralityCentralityCentrality MeasuresComplex NetworksEpidemic Spreading On NetworksK-nearest NeighborsNode CentralitySpreading ProcessesSpreading Processes On Networks
Identifying influential spreaders is crucial for developing strategies to control the spreading process on complex networks. Following the well-known K-Shell (KS) decomposition, several improved measures are proposed. However, these measures cannot identify the most influential spreaders accurately. In this paper, we define a Local K-Shell Sum (LKSS) by calculating the sum of the K-Shell indices of the neighbors within 2-hops of a given node. Based on the LKSS, we propose an Extended Local K-Shell Sum (ELKSS) centrality to rank spreaders. The ELKSS is defined as the sum of the LKSS of the nearest neighbors of a given node. By assuming that the spreading process on networks follows the Susceptible-Infectious-Recovered (SIR) model, we perform extensive simulations on a series of real networks to compare the performance between the ELKSS centrality and other six measures. The results show that the ELKSS centrality has a better performance than the six measures to distinguish the spreading ability of nodes and to identify the most influential spreaders accurately.
55
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
Centrality in social networks conceptual clarification
Linton C. Freeman · Social Networks · 1978 · 16.9K citations
A NEW MEASURE OF RANK CORRELATION
M. G. Kendall · Biometrika · 1938 · 5.8K citations
Assortative Mixing in Networks
M. E. J. Newman · Physical Review Letters · 2002 · 5.1K citations · Full text