DefinePK

Abstract

There are many communities in the complex network usually and the communities having these overlapping nodes in many occasion. How to detect community structures in complex network with quick and accurate methods become a hot topic in computer science, system science and social science and other related fields. This study makes an intensive study in the complex network and proposes a practical parallel processing algorithm which is based on local modularity to find the overlapping community structures in complex network. In order to test the accuracy and efficiency of the algorithm, a series of experiments have done in different real-world networks and random networks. These experiment data results show that the proposed algorithm can detect the community structures which are overlapping in limited time and work well in practical cases.