期刊
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
卷 461, 期 -, 页码 171-181出版社
ELSEVIER
DOI: 10.1016/j.physa.2016.05.048
关键词
Complex network; Influential node ranking; k-shell decomposition; k-shell iteration factor
资金
- National Natural Science Foundation of China [61402482]
- China Postdoctoral Science Foundation [2015T80555]
- Jiangsu Planned Projects for Postdoctoral Research Funds [1501012A]
- Qing Lan Project of Jiangsu Province
Identifying the influential nodes of complex networks is important for optimizing the network structure or efficiently disseminating information through networks. The k-shell method is a widely used node ranking method that has inherent advantages in performance and efficiency. However, the iteration information produced in k-shell decomposition has been neglected in node ranking. This paper presents a fast ranking method to evaluate the influence capability of nodes using a k-shell iteration factor. The experimental results with respect to monotonicity, correctness and efficiency have demonstrated that the proposed method can yield excellent performance on artificial and real world networks. It discriminates the influence capability of nodes more accurately and provides a more reasonable ranking list than previous methods. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据