期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Identifying Influential Spreaders in Complex Networks by Considering the Impact of the Number of Shortest Paths
1
作者 luan yangyang BAO Zhongkui ZHANG Haifeng 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2021年第6期2168-2181,共14页
The study on how to identify influential spreaders in complex networks is becoming increasingly significant.Previous studies demonstrate that considering the shortest path length can improve the accuracy of identifica... The study on how to identify influential spreaders in complex networks is becoming increasingly significant.Previous studies demonstrate that considering the shortest path length can improve the accuracy of identification,but which ignore the influence of the number of shortest paths.In many cases,even though the shortest path length of two nodes is rather larger,their interaction influence is also significant if the number of shortest paths between them is considerable.Inspired by this fact,the authors propose an improved centrality index(ICC)based on well-known closeness centrality and a semi-local iterative algorithm(semi-IA)to study the impact of the number of shortest paths on the identification of the influential spreaders.By comparing with several traditional centrality indices,such as degree centrality,k-shell decomposition,betweenness centrality and eigenvector centrality,the experimental results on real networks indicate that the ICC index and semi-IA have a better performance,regardless of the identification capability or the resolution. 展开更多
关键词 Complex networks influential spreader number of shortest paths
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部