The many facets of community detection in complex networks

Community detection, the decomposition of a graph into essential building blocks, has been a core research topic in network science over the past years. Since a precise notion of what constitutes a community has remained evasive, community detection algorithms have often been compared on benchmark graphs with a particular form of assortative community structure and classified based on the mathematical techniques they employ. However, this comparison can be misleading because apparent similarities in their mathematical machinery can disguise different goals and reasons for why we want to employ community detection in the first place. Here we provide a focused review of these different motivations that underpin community detection. This problem-driven classification is useful in applied network science, where it is important to select an appropriate algorithm for the given purpose. Moreover, highlighting the different facets of community detection also delineates the many lines of research and points out open directions and avenues for future research.

[1]  Ron Wakkary,et al.  Integration , 2016, Interactions.

[2]  Charu C. Aggarwal,et al.  Social Network Data Analytics , 2011 .

[3]  Xiaoran Yan,et al.  Bayesian model selection of stochastic block models , 2016, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[4]  Luciano da Fontoura Costa,et al.  Journal of Complex Networks , 2013 .

[5]  Jean-Charles Delvenne,et al.  Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks , 2014, IEEE Transactions on Network Science and Engineering.

[6]  Danielle S Bassett,et al.  Generative models for network neuroscience: prospects and promise , 2017, Journal of The Royal Society Interface.

[7]  Jon M. Kleinberg,et al.  An Impossibility Theorem for Clustering , 2002, NIPS.

[8]  R. J. Joenk,et al.  IBM journal of research and development: information for authors , 1978 .

[9]  Arnaud Browet,et al.  Incompatibility Boundaries for Properties of Community Partitions , 2016, IEEE Transactions on Network Science and Engineering.

[10]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[11]  John Eccleston,et al.  Statistics and Computing , 2006 .

[12]  O. Bagasra,et al.  Proceedings of the National Academy of Sciences , 1914, Science.

[13]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[14]  Aaron Clauset,et al.  Learning Latent Block Structure in Weighted Networks , 2014, J. Complex Networks.

[15]  I. Ial,et al.  Nature Communications , 2010, Nature Cell Biology.

[16]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[17]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[18]  Alex Pothen,et al.  Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .

[19]  Johan Vounckx,et al.  Integration, the VLSI Journal , 2008 .

[20]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Isabelle Guyon,et al.  Clustering: Science or Art? , 2009, ICML Unsupervised and Transfer Learning.

[22]  Srinivasan Parthasarathy,et al.  Community Discovery in Social Networks: Applications, Methods and Emerging Trends , 2011, Social Network Data Analytics.

[23]  Elchanan Mossel,et al.  A Proof of the Block Model Threshold Conjecture , 2013, Combinatorica.

[24]  Shang-Hua Teng,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Jure Leskovec,et al.  Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, KDD 2014.

[26]  Shang-Hua Teng,et al.  A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning , 2008, SIAM J. Comput..

[27]  R. Hanneman.  Introduction to Social Network Methods , 2001 .

[28]  M. Newman.  Communities, modules and large-scale structure in networks , 2011, Nature Physics.

[29]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[30]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[31]  Arkadiusz Stopczynski,et al.  Fundamental structures of dynamic social networks , 2015, Proceedings of the National Academy of Sciences.

[32]  Purnamrita Sarkar,et al.  Hypothesis testing for automated community detection in networks , 2013, ArXiv.

[33]  Florent Krzakala,et al.  Spectral Clustering of graphs with the Bethe Hessian , 2014, NIPS.

[34]  Jean-Charles Delvenne,et al.  Stability of graph communities across time scales , 2008, Proceedings of the National Academy of Sciences.

[35]  K. K. Nambiar,et al.  Foundations of Computer Science , 2001, Lecture Notes in Computer Science.

[36]  E. Silerova,et al.  Knowledge and information systems , 2018 .

[37]  Jean-Charles Delvenne,et al.  The stability of a graph partition: A dynamics-based framework for community detection , 2013, ArXiv.

[38]  Martin Rosvall,et al.  Memory in network flows and its effects on spreading dynamics and community detection , 2013, Nature Communications.

[39]  Cristopher Moore,et al.  Phase transition in the detection of modules in sparse networks , 2011, Physical review letters.

[40]  Leto Peel,et al.  The ground truth about metadata and community detection in networks , 2016, Science Advances.

[41]  Dane Taylor,et al.  Post-Processing Partitions to Identify Domains of Modularity Optimization , 2017, Algorithms.

[42]  Sujeet Akula,et al.  Dynamics of and on Complex Networks , 2011 .

[43]  Vito Latora,et al.  Phase transition in the economically modeled growth of a cellular nervous system , 2013, Proceedings of the National Academy of Sciences.

[44]  Jean-Charles Delvenne,et al.  Markov Dynamics as a Zooming Lens for Multiscale Community Detection: Non Clique-Like Communities and the Field-of-View Limit , 2011, PloS one.

[45]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  L. Christophorou.  Science , 2018, Emerging Dynamics: Science, Energy, Society and Values.

[47]  Santo Fortunato,et al.  Limits of modularity maximization in community detection , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[48]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[49]  H. Damasio,et al.  IEEE Transactions on Pattern Analysis and Machine Intelligence: Special Issue on Perceptual Organization in Computer Vision , 1998 .

[50]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

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

[52]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[53]  October I.  Physical Review Letters , 2022 .

[54]  Tiago P. Peixoto.  Inferring the mesoscale structure of layered, edge-valued, and time-varying networks. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[55]  Laurent Massoulié,et al.  Community detection thresholds and the weak Ramanujan property , 2013, STOC.

[56]  Benjamin H. Good,et al.  Performance of modularity maximization in practical contexts. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  Boleslaw K. Szymanski,et al.  A New Metric for Quality of Network Community Structure , 2015, ArXiv.

[58]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[59]  Dino Pedreschi,et al.  A classification for community discovery methods in complex networks , 2011, Stat. Anal. Data Min..

[60]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[61]  David F. Gleich,et al.  Heat kernel based community detection , 2014, KDD.

[62]  Michael I. Jordan,et al.  Advances in Neural Information Processing Systems 30 , 1995 .

[63]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[64]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[65]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

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

[67]  Alex Arenas,et al.  Synchronization reveals topological scales in complex networks. , 2006, Physical review letters.

[68]  Mauricio Barahona,et al.  From free text to clusters of content in health records: an unsupervised graph partitioning approach , 2019, Applied Network Science.

[69]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[70]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[71]  M. Mézard,et al.  Journal of Statistical Mechanics: Theory and Experiment , 2011 .

[72]  Michalis Vazirgiannis,et al.  Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.

[73]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.

[74]  Boleslaw K. Szymanski,et al.  Community Detection via Maximization of Modularity and Its Variants , 2014, IEEE Transactions on Computational Social Systems.

[75]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[76]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[77]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[78]  T. Snijders,et al.  Estimation and Prediction for Stochastic Blockstructures , 2001 .

[79]  Luigi Acerbi,et al.  Advances in Neural Information Processing Systems 27 , 2014 .

[80]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

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

[82]  Thomas G. Dietterich,et al.  In Advances in Neural Information Processing Systems 12 , 1991, NIPS 1991.

[83]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[84]  E. M. Sá.  Czechoslovak Mathematical Journal , 2016 .

[85]  Daniela di Serafino,et al.  Parallel Numerical Algorithms , 2010, Euro-Par.

[86]  R. Guimerà,et al.  Modularity from fluctuations in random graphs and complex networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[87]  Tiago P Peixoto,et al.  Parsimonious module inference in large networks. , 2012, Physical review letters.

[88]  Ali Jadbabaie,et al.  IEEE Transactions on Network Science and Engineering , 2014, IEEE Trans. Netw. Sci. Eng..

[89]  Fan Chung Graham,et al.  Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[90]  Lance Fortnow,et al.  Proceedings of the 55th Annual ACM Symposium on Theory of Computing , 2011, STOC.

[91]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[92]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[93]  S. Wasserman,et al.  Building stochastic blockmodels , 1992 .

[94]  Martin Rosvall,et al.  Maps of sparse Markov chains efficiently reveal community structure in network flows with memory , 2016, ArXiv.

[95]  Ieee Xplore,et al.  IEEE Transactions on Pattern Analysis and Machine Intelligence Information for Authors , 2022, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[96]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[97]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[98]  S. Borgatti,et al.  Regular equivalence: general theory , 1994 .

[99]  Renaud Lambiotte,et al.  Using higher-order Markov models to reveal flow-based communities in networks , 2016, Scientific Reports.

[100]  M. Newman.  Community detection in networks: Modularity optimization and maximum likelihood are equivalent , 2016, Physical review. E.

[101]  Martin Rosvall,et al.  Modelling sequences and temporal networks with dynamic community structures , 2015, Nature Communications.

[102]  J. Herskowitz,et al.  Proceedings of the National Academy of Sciences, USA , 1996, Current Biology.

[103]  Mauricio Barahona,et al.  Flow-Based Network Analysis of the Caenorhabditis elegans Connectome , 2015, PLoS Comput. Biol..

[104]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..