Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
