Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10480932 | Physica A: Statistical Mechanics and its Applications | 2013 | 11 Pages |
Abstract
How to identify influential nodes in complex networks is still an open hot issue. In the existing evidential centrality (EVC), node degree distribution in complex networks is not taken into consideration. In addition, the global structure information has also been neglected. In this paper, a new Evidential Semi-local Centrality (ESC) is proposed by modifying EVC in two aspects. Firstly, the Basic Probability Assignment (BPA) of degree generated by EVC is modified according to the actual degree distribution, rather than just following uniform distribution. BPA is the generation of probability in order to model uncertainty. Secondly, semi-local centrality combined with modified EVC is extended to be applied in weighted networks. Numerical examples are used to illustrate the efficiency of the proposed method.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Cai Gao, Daijun Wei, Yong Hu, Sankaran Mahadevan, Yong Deng,