Uncovering Overlapping Community Structure

摘要: Overlapping community structure has attracted much interest in recent years since Palla et al. proposed the k-clique percolation algorithm for detection and pointed out that overlapping is more reasonable to capture topology of networks. Despite many efforts detect communities, problem still a great challenge complex Here we introduce an approach identify based on efficient partition algorithm. In our method, communities are formed by adding peripheral nodes cores. Therefore, allowed overlap. We show experimental studies synthetic networks demonstrate method excellent performances detection.