Open AccessAnalysis of the spreading influence of the nodes with minimum K-shell value in complex networks
Author(s) -
Ren Zhuo-Ming,
Jianguo Liu,
Feng Shao,
Hu Zhao-Long,
Qiang Guo
Publication year - 2013
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.62.108902
Subject(s) - node (physics) , shell (structure) , computer science , degree (music) , decomposition , value (mathematics) , complex network , decomposition method (queueing theory) , algorithm , physics , mathematics , materials science , discrete mathematics , chemistry , machine learning , organic chemistry , acoustics , quantum mechanics , world wide web , composite material
The K-shell decomposition for identifying influential nodes plays an important role in analyzing the spreading performance in complex networks, which generates lots of nodes with the smallest K-shell value. The spreading influences of these nodes cannot be distinguished by the K-shell decomposition method, as well as the degree and betweeness indices. In this paper, by taking into account the K-shell information of the target node, we develop a new method to identify the node spreading ability with the minimum K-shell value. The experimental results for pretty good privacy and autonomous system networks show that the presented method could generate more accurate spreading list than the degree and betweeness indices.