Detecting network communities: a new systematic and efficient algorithm

摘要: An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties graph Laplacian matrix combined with hierarchical clustering techniques, includes a procedure maximizing 'modularity' output. Its performance compared that other existing methods, as applied to different well-known instances community structure, both computer generated from real world. Our results are, all cases tested, at least good best ones obtained any faster most than methods providing similar quality results. This converts into valuable computational tool detecting analysing modular structures networks.