A fast community detection algorithm

Community detection has been a hot area with the development of modern society. Many community detection algorithms have been proposed to detect communities in complex networks. But efficiency is still a great challenge for community detection algorithms. In this paper, we propose a fast community detection algorithm. Our algorithm first constructs initial communities according to the similarity between nodes. Secondly it arranges nodes and adjacent nodes which have smaller degrees to a community. Our algorithm has been proven by numerical experiments.