A New Local Algorithm for Detecting Communities in Networks

In this paper, a new local algorithm of community detection which requires mostly local information while detecting communities in networks is proposed. The algorithm is available in both unweighted and weighted networks. It starts from vertices with low intensity and extracts communities from networks. Three real-world networks are used to test the performance of algorithm proposed, the experimental results demonstrate that it can extract communities from a given network efficiently and accurately.