The many facets of community detection in complex networks

Abstract

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.

8 Pages, 1 Figure

References in corpus (14)

• Fast unfolding of communities in large networks
• Modularity and community structure in networks
• Finding community structure in networks using the eigenvectors of matrices
• Maps of random walks on complex networks reveal community structure
• Benchmark graphs for testing community detection algorithms
• The structure and dynamics of multilayer networks
• Resolution limit in community detection
• Stochastic blockmodels and community structure in networks
• Community detection in networks: A user guide
• Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
• Phase transition in the detection of modules in sparse networks
• A Classification for Community Discovery Methods in Complex Networks
• Parsimonious module inference in large networks
• Learning Latent Block Structure in Weighted Networks

Cited by in corpus (2)

• Post-processing partitions to identify domains of modularity optimization
• Reduced network extremal ensemble learning (RenEEL) scheme for community detection in complex networks