Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment 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 of the graph Laplacian matrix combined with hierarchical clustering techniques, and includes a procedure for maximizing the 'modularity' of the output. Its performance is compared with that of other existing methods, as applied to different well-known instances of complex networks with a community structure, both computer generated and from the real world. Our results are, in all the cases tested, at least as good as the best ones obtained with any other methods, and faster in most of the cases than methods providing similar quality results. This converts the algorithm into a valuable computational tool for detecting and analysing communities and modular structures in complex networks.

[1]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[2]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[3]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[4]  Brian Everitt,et al.  Cluster analysis , 1974 .

[5]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[6]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[7]  J. M. Oshorn.  Proc. Nat. Acad. Sei , 1978 .

[8]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[9]  B. Mohar.  THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[10]  Jean Tague-Sutcliffe,et al.  An Introduction to Informetrics , 1992, Inf. Process. Manag..

[11]  Eytan Domany,et al.  Superparamagnetic Clustering of Data , 1996 .

[12]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[13]  Eytan Domany,et al.  Data Clustering Using a Model Granular Magnet , 1997, Neural Computation.

[14]  Eytan Domany,et al.  Superparamagnetic clustering of data — The definitive solution of an ill-posed problem , 1999 .

[15]  Yair Weiss,et al.  Segmentation using eigenvectors: a unifying view , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[16]  J. Hopfield,et al.  From molecular to modular cell biology , 1999, Nature.

[17]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[18]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[19]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[20]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[21]  Michael William Newman,et al.  The Laplacian spectrum of graphs , 2001 .

[22]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[24]  Xie Hong-kun,et al.  Nature of Science , 2002 .

[25]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[26]  C. Lee Giles,et al.  Self-Organization and Identification of Web Communities , 2002, Computer.

[27]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[28]  Fang Wu,et al.  Finding communities in linear time: a physics approach , 2003, ArXiv.

[29]  Sergei Maslov,et al.  Modularity and extreme edges of the internet. , 2003, Physical review letters.

[30]  Volker Wulf,et al.  Communities and technologies : proceedings of the First International Conference on Communities and Technologies : C&T 2003 , 2003 .

[31]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[33]  Alessandro Vespignani,et al.  Evolution and Structure of the Internet: A Statistical Physics Approach , 2004 .

[34]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[35]  Santosh S. Vempala,et al.  On clusterings: Good, bad and spectral , 2004, JACM.

[36]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[37]  Claudio Castellano,et al.  Defining and identifying communities in networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[38]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Dennis M. Wilkinson,et al.  A method for finding communities of related genes , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[40]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[41]  David Bawden,et al.  Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .

[42]  Pavel Pudil,et al.  Introduction to Statistical Pattern Recognition , 2006 .