Community detection in networks: A user guide

Research output: Contribution to journalArticleScientificpeer-review

Researchers

  • Santo Fortunato
  • Darko Hric

Research units

  • Center for Complex Networks and Systems Research, School of Informatics and Computing, Indiana University, Bloomington
  • Indiana University Bloomington

Abstract

Community detection in networks is one of the most popular topics of modern network science. Communities, or clusters, are usually groups of vertices having higher probability of being connected to each other than to members of other groups, though other patterns are possible. Identifying communities is an ill-defined problem. There are no universal protocols on the fundamental ingredients, like the definition of community itself, nor on other crucial issues, like the validation of algorithms and the comparison of their performances. This has generated a number of confusions and misconceptions, which undermine the progress in the field. We offer a guided tour through the main aspects of the problem. We also point out strengths and weaknesses of popular methods, and give directions to their use.

Details

Original languageEnglish
Pages (from-to)1-44
JournalPHYSICS REPORTS: REVIEW SECTION OF PHYSICS LETTERS
Volume659
Early online date6 Oct 2016
Publication statusPublished - 11 Nov 2016
MoE publication typeA1 Journal article-refereed

    Research areas

  • Networks; Communities; Clustering

ID: 7391539