Identifying Influential Nodes in Complex Networks Based on Local Effective Distance

• Main Authors: Junkai Zhang, Bin Wang, Jinfang Sheng, Jinying Dai, Jie Hu, Long Chen
• Format: Article
• Language: English
• Published: MDPI AG 2019-10-01
• Series: Information
• Subjects: influential nodes; complex networks; effective distance; total influence
• Online Access: https://www.mdpi.com/2078-2489/10/10/311

With the rapid development of Internet technology, the social network has gradually become an indispensable platform for users to release information, obtain information, and share information. Users are not only receivers of information, but also publishers and disseminators of information. How to select a certain number of users to use their influence to achieve the maximum dissemination of information has become a hot topic at home and abroad. Rapid and accurate identification of influential nodes in the network is of great practical significance, such as the rapid dissemination, suppression of social network information, and the smooth operation of the network. Therefore, from the perspective of improving computational accuracy and efficiency, we propose an influential node identification method based on effective distance, named KDEC. By quantifying the effective distance between nodes and combining the position of the node in the network and its local structure, the influence of the node in the network is obtained, which is used as an indicator to evaluate the influence of the node. Through experimental analysis of a lot of real-world networks, the results show that the method can quickly and accurately identify the influential nodes in the network, and is better than some classical algorithms and some recently proposed algorithms.