The many facets of community detection in complex networks.
Michael T. Schaub,Michael T. Schaub,Michael T. Schaub,Jean-Charles Delvenne,Martin Rosvall,Renaud Lambiotte +5 more
Reads0
Chats0
TLDR
In this paper, the authors provide a focused review of the different motivations that underpin community detection, highlighting the different facets of community detection and highlighting the many lines of research and points out open directions and avenues for future research.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.read more
Citations
More filters
Journal ArticleDOI
Multiresolution Consensus Clustering in Networks
TL;DR: In this paper, the authors propose a method for identifying community structure at different scales based on multiresolution modularity and consensus clustering, which can be applied to the output of any clustering algorithm.
Journal ArticleDOI
Simplicial complexes and complex systems
TL;DR: This work presents strengths and weaknesses of current methods, as well as a range of empirical studies relevant to the field of complex systems, before identifying future methodological challenges to help understand the emergence of collective phenomena.
Journal ArticleDOI
Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
TL;DR: Using graphs to model pairwise relationships between entities is a ubiquitous framework for studying complex systems and data and Simplicial complexes extend this dyadic model of graphs to polyadic structures.
Journal ArticleDOI
Generative models for network neuroscience: prospects and promise.
TL;DR: Network neuroscience is the emerging discipline concerned with investigating the complex patterns of interconnections found in neural systems, and identifying principles with which to understand how neural networks are connected.
Journal ArticleDOI
A review of stochastic block models and extensions for graph clustering
TL;DR: Different approaches and extensions proposed for different aspects in model-based clustering of graphs, such as the type of the graph, the clustering approach, the inference approach, and whether the number of groups is selected or estimated are reviewed.
References
More filters
Journal ArticleDOI
Community detection in networks: A user guide
TL;DR: In this paper, the authors present a guided tour of the main aspects of community detection in networks and point out strengths and weaknesses of popular methods, and give directions to their use.
Journal ArticleDOI
Survey: Graph clustering
TL;DR: This survey overviews the definitions and methods for graph clustering, that is, finding sets of ''related'' vertices in graphs, and presents global algorithms for producing a clustering for the entire vertex set of an input graph.
Journal ArticleDOI
Fast spectral methods for ratio cut partitioning and clustering
L. Hagen,Andrew B. Kahng +1 more
TL;DR: It is shown that the second smallest eigenvalue of a matrix derived from the netlist gives a provably good approximation of the optimal ratio cut partition cost.
Journal ArticleDOI
Estimation and prediction for stochastic blockstructures
TL;DR: In this article, a statistical approach to a posteriori blockmodeling for digraph and valued digraphs is proposed, which assumes that the vertices of the digraph are partitioned into several unobserved (latent) classes and that the probability distribution of the relation between two vertices depends only on the classes to which they belong.
Journal ArticleDOI
Overlapping community detection in networks: The state-of-the-art and comparative study
TL;DR: A framework is proposed for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection, and for low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms.