A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient algorithm based on neighborhood overlap for community identification in complex networks
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
doi:10.1016/j.physa.2011.09.027
fatcat:5jizjbkiq5f7floqpkcvxavjhq