Cited by 3,024Complex Network Analysis TechniquesAdvanced Clustering Algorithms ResearchBioinformatics and Genomic Networks

Resolution limit in community detection

Open access
Fortunato, Santo, Barthélemy, Marc·2007·Proceedings of the National Academy of Sciences

Abstract

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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1073/pnas.0605965104

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Modularity-based graph clustering suffers a well-known resolution limit, failing to find small clusters even when they are perfectly unambiguously defined.

    “However, modularity-based graph clustering suffers a well-known resolution limit (Fortunato and Barthélemy, 2007), failing to find small clusters even when they are perfectly unambiguously defined.”

    From Molecular Architecture of the Mouse Nervous System (2018) · cites this paper as Fortunato and Barthélemy, 2007

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

1 of the 29 references couldn’t be matched to a known paper.

Research works printed but not linked: 11

  1. [5]M. E. J. Newman, SIAM Review 45 , 167-256 (2003).
  2. [8]G. W. Flake, S. Lawrence, C. Lee Giles and F. M. Coetzee, IEEE Computer 35 (3), 66-71 (2002).
  3. [9]M. Girvan and M. E. J. Newman, Proc. Natl. Acad. Sci. 99 , 7821-7826 (2002).
  4. [10]D. Lusseau and M. E. J. Newman, Proc. R. Soc. London B 271 , S477-S481 (2004).
  5. [11]L. Adamic and N. Glance, Proc. 3 rd Int. Workshop on Link Discovery, 36-43 (2005).
  6. [17]G. P. Garnett, J. P. Hughes, R. M. Anderson, B. P. Stoner, S. O. Aral, W. L. Whittington, H. H. Handsfield and K. K. Holmes, Sexually Transmitted Diseases 23 , 248-257 (1996); S. O. Aral, J. P. Hughes, B. P. Stoner, W. L. Whittington, H. H. Handsfield, R. M. Anderson and K. K. Holmes, American Journal of Public Health 89 , 825-833 (1999).
  7. [19]M. E. J. Newman, Physical Review E 69 , 066133 (2004).
  8. [23]J. Reichardt and S. Bornholdt, preprint condmat/0603718 (2006).
  9. [24]J. Reichardt and S. Bornholdt, preprint condmat/0606220 (2006).
  10. [25]F. Radicchi, C. Castellano, F. Cecconi, V. Loreto and D. Parisi, Proc. Natl. Acad. Sci. 101 , 2658-2663 (2004).
  11. [27]L. Danon, A. D´ iaz-Guilera and A. Arenas, preprint physics/0601144 (2006). · arXiv

Cited by

Sorted by citations

Authors
Fortunato, S., & Barthélemy, M.
Affiliations
  • Institute for Scientific Interchange (IT)
  • Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR)
Corresponding author
Barthélemy, Marc
Venue
Proceedings of the National Academy of Sciences
Published
2007-01-02
Volume
104
Issue
1
Pages
36-41
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2128366083
Cited by
3,024
References
29
Citations by year
2026: 93 · 2025: 134 · 2024: 126 · 2023: 112 · 2022: 150 · 2021: 154 · 2020: 186 · 2019: 209 · 2018: 241 · 2017: 195 · 2016: 198 · 2015: 195 · 2014: 215 · 2013: 193 · 2012: 165
FWCI
40.39
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the National Academy of Sciences (publishedVersion)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
Keywords
community detection, resolution limit, modularity optimization, network partitioning, complex networks, module reliability, social networks, biological networks, technological networks
MeSH terms
Animals, Humans, Models, Theoretical, Community Networks

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review