Journal of Systems Engineering and Electronics

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Evidential method to identify influential nodes in complex networks

Hongming Mo1,2, Cai Gao1, and Yong Deng1,3,4,*   

  1. 1. School of Computer and Information Science, Southwest University, Chongqing 400715, China;
    2. Department of the Tibetan Language, Sichuan University of Nationalities, Kangding 626001, China;
    3. School of Automation, Northwestern Polytechnical University, Xi’an 710072, China;
    4. School of Engineering, Vanderbilt University, TN 37235, USA
  • Online:2015-04-21 Published:2010-01-03


Identifying influential nodes in complex networks is still an open issue. In this paper, a new comprehensive centrality measure is proposed based on the Dempster-Shafer evidence theory. The existing measures of degree centrality, betweenness centrality and closeness centrality are taken into consideration in the proposed method. Numerical examples are used to illustrate the effectiveness of the proposed method.

Key words: Dempster-Shafer evidence theory (D-S theory), belief function, complex networks, influential nodes, evidential centrality, comprehensive measure