Resolution limit in community detection

By Santo Fortunato, Marc Barthelemy. Proceedings of the National Academy of Sciences of the United States of America, 2006

3,037 citations recorded by the source corpus.

Detecting community structure is fundamental for uncovering the links between structure and function in complex networks and for practical applications in many disciplines such as biology and sociology. A popular method now widely used relies on the optimization of a quantity called modularity, which is a quality index for a partition of a network into communities. We find that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined. This finding is confirmed through several examples, both in artificial and in real social, biological, and technological networks, where we show that modularity optimization indeed does not resolve a large number of modules. A check of the modules obtained through modularity optimization is thus necessary, and we provide here key elements for the assessment of the reliability of this community detection method.

Subfields: Molecular Biology, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/39433dcfe25535df4398742432f2fb11330b0097

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Molecular Biology

  1. Santo Fortunato
  2. Olaf Sporns
  3. Ludo Waltman
  4. Nees Jan van Eck
  5. Tiago P. Peixoto
  6. Jure Leskovec
  7. Darko Hric
  8. M. A. Porter

In Statistical and Nonlinear Physics

  1. Santo Fortunato
  2. Olaf Sporns
  3. Jure Leskovec
  4. Darko Hric
  5. M. A. Porter
  6. Richard F. Betzel
  7. Ludo Waltman
  8. Nees Jan van Eck

Citations in the corpus