An Overview of Algorithms for Analyzing Community Structure in Complex Networks

Community structure exists in many real networks.In recent years,a lot of algorithms have been proposed to find communities in large-scale complex networks.In this paper,we review some representative algorithms.Two famous algorithms in computer science,spectral bisection method and KernighanLin algorithm,are first introduced.Some representative sociological approaches including divisive and agglomerative method are then investigated.In particular,a new clique percolation method to uncovering the overlapping communities in complex networks is introduced.Finally,some future directions are pointed.