The many facets of community detection in complex networks
Name
41109_2017_Article_23.pdf
Size
538.42 KB
Format
Adobe PDF
Checksum (MD5)
d27c3b6d688cbef09254abef001f9196
Author(s)
Delvenne, Jean-Charles
Rosvall, Martin
Lambiotte, Renaud
Schaub, Michael T.
Date Issued
February 2017
Journal
Applied Network Science
Publisher
Springer International Publishing
Citation
Schaub, Michael T. et al. “The Many Facets of Community Detection in Complex Networks.” Applied Network Science 2.1 (2017): n. pag.
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Institute for Data, Systems, and Society
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s41109-017-0023-6
