期刊
CHAOS SOLITONS & FRACTALS
卷 103, 期 -, 页码 101-110出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.chaos.2017.05.040
关键词
Complex networks; Influential nodes; Evidential centrality; Dempster-Shafer evidence theory
资金
- National High Technology Research and Development Program of China (863 Program) [2013AA013801]
- National Natural Science Foundation of China [61174022, 61573290, 61503237]
- China State Key Laboratory of Virtual Reality Technology and Systems, Beihang University [BUAA-VR-14KF-02]
In the field of complex networks, how to identify influential nodes in complex networks is still an open research topic. In the existing evidential centrality (EVC), the global structure information in complex networks is not taken into consideration. In addition, EVC also has the limitation that only can be applied on weighted networks. In this paper, a New Evidential Centrality (NEC) is proposed by modifying the Basic Probability Assignment (BPA) strength generated by EVC. According to the shortest paths between the nodes in the network rather than just considering local information, some other BPAs are constructed. With a modified combination rule of Dempster-Shafer evidence theory, the new centrality measure is determined. Numerical examples are used to illustrate the efficiency of the proposed method. (C) 2017 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据