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
IBM journal of research and development: information for authors
TL;DR: Background information about the IBM Journal of Research and Development is combined with guidelines for the preparation of Journal manuscripts to acquaint authors with the Journal as a primary, professional publication and to present suggestions to ease the work of author and editor in preparing clear, concise, and useful manuscripts.
Journal ArticleDOI
Memory in network flows and its effects on spreading dynamics and community detection
Martin Rosvall,Alcides Viamontes Esquivel,Andrea Lancichinetti,Jevin D. West,Renaud Lambiotte +4 more
TL;DR: It is suggested that accounting for higher-order memory in network flows can help to better understand how real systems are organized and function.
Journal ArticleDOI
A classification for community discovery methods in complex networks
TL;DR: The aim of this survey is to provide a ‘user manual’ for the community discovery problem and to organize the main categories of community discovery methods based on the definition of community they adopt.
Journal ArticleDOI
Inference and phase transitions in the detection of modules in sparse networks.
TL;DR: An asymptotically exact analysis of the problem of detecting communities in sparse random networks generated by stochastic block models using the cavity method of statistical physics and its relationship to belief propagation yields an optimal inference algorithm for detecting modules.
Journal ArticleDOI
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
TL;DR: This work presents a local clustering algorithm, a useful primitive for handling massive graphs, such as social networks and web-graphs, that finds a good cluster---a subset of vertices whose internal connections are significantly richer than its external connections---near a given vertex.