An algorithm for detecting overlapping community structure in complex networks

It is a general problem in the data mining field to detect the overlapping community structure in a complex network. A novel approach is presented in this paper to identify communities based on core vertices and shared neighbors, which can find both separate and overlapping community structures in networks. Experimental results on synthetic and real-world networks show that the new algorithm is effective and efficient in identification of communities and it can find overlapping and bridge vertices.