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

► 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. ► Our approach uses the local information. ► Link strength distribution gives a general view of basis structure information of graphs. ► Our method can be naturally extended to find overlapping communities.