Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.

Modularity and community structure in networks

Open access
Newman, M. E. J. · 2006 · Proceedings of the National Academy of Sciences

Abstract

Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as “modularity” over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1073/pnas.0601602103

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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?

1 more claim about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Self-check

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

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

Citations

Cites

Show all 33 references

Research works printed but not linked: 1

  1. P.-O. Fjällström Linköping Electronic Articles in Computer and Information Science Vol. 3 Available at www.ep.liu.se/ea/cis/1998/006. Accessed May 10 2006. (1998).

Cited by

See all 12,256

Metadata

Authors
Newman, M. E. J.
Affiliations
University of California, Irvine (US)
Corresponding author
Newman, M. E. J.
Venue
Proceedings of the National Academy of Sciences
Published
2006-06-06
Volume
103
Issue
23
Pages
8577-8582
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W2151936673
Cited by
12,256
References
33
Citations by year
2026: 644 · 2025: 780 · 2024: 805 · 2023: 806 · 2022: 861 · 2021: 991 · 2020: 911 · 2019: 912 · 2018: 835 · 2017: 734 · 2016: 705 · 2015: 626 · 2014: 597 · 2013: 510 · 2012: 405
FWCI
102.26
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the National Academy of Sciences (publishedVersion)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
  • Bulletin of the American Physical Society
Funders
  • National Science Foundation (0405348)
  • James S. McDonnell Foundation
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
Keywords
community detection, modularity, modularity matrix, spectral algorithms, eigenvectors, network partitioning, complex networks, social networks, metabolic networks, regulatory 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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Modularity and community structure in networks. https://app.cochat.ai/papers/10.1073/pnas.0601602103
The paper
Newman, M. E. J. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.0601602103

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.