Detecting communities by the core-vertex and intimate degree in complex networks

In this paper, we present a new approach to extract communities in the complex networks with considerable accuracy. We introduce the core-vertex and the intimate degree between the community and its neighboring vertices. First, we find the core-vertices as the initial community. These core-vertices are then expanded using intimate degree function during extracting community structure from the given network. In addition, our algorithm successfully finds common nodes between communities. Experimental results using some real-world networks data shows that the performance of our algorithm is satisfactory. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.