Community detection in sample networks generated from Gaussian mixture model

Abstract

Detecting communities in complex networks is of great importance in sociology, biology and computer science, disciplines where systems are often represented as networks. In this paper, we use the coarse-grained-diffusion- distance based agglomerative algorithm to uncover the community structure exhibited by sample networks generated from Gaussian mixture model, in which the connectivity of the network is induced by a metric. The present algorithm can identify the community structure in a high degree of efficiency and accuracy. An appropriate number of communities can be automatically determined without any prior knowledge about the community structure. The computational results on three artificial networks confirm the capability of the algorithm. ? 2011 Springer-Verlag.