Efficient algorithm based on neighborhood overlap for community identification in complex networks

Kun Li, Xiaofeng Gong, Shuguang Guan, C.-H. Lai
2012 Physica A: Statistical Mechanics and its Applications  
Community structure is an important feature in many real-world networks. Many methods and algorithms for identifying communities have been proposed and have attracted great attention in recent years. In this paper, we present a new approach for discovering the community structure in networks. The novelty is that the algorithm uses the strength of the ties for sorting out nodes into communities. More specifically, we use the principle of weak ties hypothesis to determine to what community the
more » ... e belongs. The advantages of this method are its simplicity, accuracy, and low computational cost. We demonstrate the effectiveness and efficiency of our algorithm both on real-world networks and on benchmark graphs. We also show that the distribution of link strength can give a general view of the basic structure information of graphs.
doi:10.1016/j.physa.2011.09.027 fatcat:5jizjbkiq5f7floqpkcvxavjhq