Community detection algorithm using the definition of community

On the basis of discussing the definitions of community in complex network, a new method is to put forward for the community detection. This method initially marks all nodes as unvisited, and then searches these unvisited nodes and seeks some so-called strong structures made up of a core node with a maximal degree and most of its neighbors, and marks them as visited. Subsequently the unvisited nodes are assigned to different strong structures according to some criteria. At last the existing strong structures are perhaps optimized and then different communities generate. The experiment results show that the algorithm is stable and reliable and can accurately obtain the division of community structure. In addition, the algorithm is fast and its time complexity is approximately O(n+m).