Community detection based on network communicability distance

Community detection in complex networks is a topic of high interest in many fields. In this paper, we propose a new algorithm based on communicability distance for community detection in network(CD algorithm). Furthermore, the accuracy and efficiency of this algorithm are tested by some representative real-world networks and computer-generated networks(GN networks). The experimental results indicate that the CD algorithm can accurately and effectively detect the community structure in these networks with higher values of modularity.