CDIA: A Feasible Community Detection Algorithm Based on Influential Nodes in Complex Networks

Abstract

Community detection is a fundamental research in network science, which has attracted researchers all over the world to devoting into this work. However, the existing algorithms can hardly hold performance and efficiency simultaneously. Aiming at addressing the problem, and inspired by the force in physics, this paper defines the node influence from a network perspective. Afterwards, a novel approach to detect communities in terms of influential nodes is proposed. Furthermore, the vital nodes and overlapping nodes can be obtained. Series of experiments on synthetic and real-world networks are conducted, and the experimental results show that the proposed algorithm is capable and effective, which provides a reliable solution for analyzing network structure in-depth.