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
Book ChapterDOI
Estimating the Similarity of Community Detection Methods Based on Cluster Size Distribution
TL;DR: This paper proposes a novel approach to estimate the similarity between community detection methods using the size density distributions of communities that they detect and shows that there is a very clear distinction between the partitioning strategies of differentcommunity detection methods.
Journal Article
Network community detection using modularity density measures
TL;DR: In this paper, a new metric, modularity density, was introduced for the quality of community structure in networks in order to solve some of the known problems with modularity, particularly the resolution limit problem.
Journal ArticleDOI
A framework for the construction of generative models for mesoscale structure in multilayer networks
Marya Bazzi,Marya Bazzi,Marya Bazzi,Lucas G. S. Jeub,Lucas G. S. Jeub,Lucas G. S. Jeub,Alex Arenas,Sam Howison,Mason A. Porter,Mason A. Porter +9 more
TL;DR: In this article, a framework for the construction of generative models for mesoscale structures in multilayer networks is presented, together with an associated set of principles from which they are derived.
Journal ArticleDOI
Accelerating Scientific Computing in the Post-Moore’s Era
Kathleen E. Hamilton,Catherine D. Schuman,Steven R. Young,Ryan S. Bennink,Neena Imam,Travis S. Humble +5 more
TL;DR: This work discusses how different processing models can advance computing in key scientific paradigms: machine learning and constraint satisfaction and hints at the infrastructure needed to integrate next-generation processing units into future high-performance computing systems.
Book ChapterDOI
A Map of Approaches to Temporal Networks
Petter Holme,Jari Saramäki +1 more
TL;DR: This introductory chapter gives an overview of the ideas that the field of temporal networks has brought forward in the last decade and places the contributions to the current volume on this map of temporal-network approaches.
References
More filters
Journal ArticleDOI
Normalized cuts and image segmentation
Jianbo Shi,Jitendra Malik +1 more
TL;DR: This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Journal ArticleDOI
Fast unfolding of communities in large networks
Vincent D. Blondel,Jean-Loup Guillaume,Jean-Loup Guillaume,Renaud Lambiotte,Renaud Lambiotte,Etienne Lefebvre +5 more
TL;DR: This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Journal ArticleDOI
Finding and evaluating community structure in networks.
TL;DR: It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Journal ArticleDOI
Fast unfolding of communities in large networks
Vincent D. Blondel,Jean-Loup Guillaume,Jean-Loup Guillaume,Renaud Lambiotte,Renaud Lambiotte,Etienne Lefebvre +5 more
TL;DR: In this paper, the authors proposed a simple method to extract the community structure of large networks based on modularity optimization, which is shown to outperform all other known community detection methods in terms of computation time.