Cited by 7,390Complex Network Analysis TechniquesAdvanced Clustering Algorithms ResearchComplex Systems and Time Series Analysis

Finding community structure in very large networks

Open access
Clauset, Aaron, Newman, M. E. J., Moore, Cristopher·2004·Physical Review E

Abstract

The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m approximately n and d approximately log n, in which case our algorithm runs in essentially linear time, O (n log(2) n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web site of a large on-line retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400 000 vertices and 2 x 10(6) edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers.

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.1103/physreve.70.066111

Cites

2 of 2 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?

  • El algoritmo Clauset-Newman-Moore busca grupos de vértices que estén conectados densamente entre ellos y que posean pocas conexiones con otros grupos.

    “Dicho algoritmo busca grupos de vértices que estén conectados densamente entre ellos y que posean pocas conexiones con otros grupos (Clauset et al., 2004;Mendes Rodrigues et al., 2011).”
  • El algoritmo Clauset-Newman-Moore fue seleccionado porque maneja de manera adecuada los recursos computacionales cuando se trata de redes grandes de más de 10 mil relaciones.

    “El algoritmo fue seleccionado porque maneja de manera adecuada los recursos computacionales cuando se trata de redes grandes de más de 10 mil relaciones (Hansen et al., 2019;Clauset et al., 2004).”

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

Research works printed but not linked: 18

  1. [4]M. E. J. Newman, The structure and function of complex networks. SIAM Review 45 , 167-256 (2003).
  2. [5]M. Faloutsos, P. Faloutsos, and C. Faloutsos, On powerlaw relationships of the internet topology. Computer Communications Review 29 , 251-262 (1999).
  3. [7]J. M. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, The Web as a graph: Measurements, models and methods. In Proceedings of the International Conference on Combinatorics and Computing , number 1627 in Lecture Notes in Computer Science, pp. 1-18, Springer, Berlin (1999).
  4. [8]S. Wasserman and K. Faust, Social Network Analysis . Cambridge University Press, Cambridge (1994).
  5. [11]J. A. Dunne, R. J. Williams, and N. D. Martinez, Foodweb structure and network theory: The role of connectance and size. Proc. Natl. Acad. Sci. USA 99 , 1291712922 (2002).
  6. [13]T. Ito, T. Chiba, R. Ozawa, M. Yoshida, M. Hattori, and Y. Sakaki, A comprehensive two-hybrid analysis to explore the yeast protein interactome. Proc. Natl. Acad. Sci. USA 98 , 4569-4574 (2001).
  7. [15]B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49 , 291-307 (1970).
  8. [18]J. Scott, Social Network Analysis: A Handbook . Sage, London, 2nd edition (2000).
  9. [20]M. Girvan and M. E. J. Newman, Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99 , 7821-7826 (2002).
  10. [22]M. T. Gastner and M. E. J. Newman, Diffusion-based method for producing density equalizing maps. Proc. Natl. Acad. Sci. USA 101 , 7499-7504 (2004).
  11. [25]P. Holme and M. Huss, Discovery and analysis of biochemical subnetwork hierarchies. In R. Gauges, U. Kummer, J. Pahle, and U. Rost (eds.), Proceedings of the 3rd Workshop on Computation of Biochemical Pathways and Genetic Networks , pp. 3-9, Logos, Berlin (2003).
  12. [26]J. R. Tyler, D. M. Wilkinson, and B. A. Huberman, Email as spectroscopy: Automated discovery of community structure within organizations. In M. Huysman, E. Wenger, and V. Wulf (eds.), Proceedings of the First International Conference on Communities and Technologies , Kluwer, Dordrecht (2003).
  13. [28]M. Bogu˜ n´ a, R. Pastor-Satorras, A. D´ ıaz-Guilera, and A. Arenas, Emergence of clustering, correlations, and communities in a social network model. Preprint condmat/0309263 (2003).
  14. [29]D. M. Wilkinson and B. A. Huberman, A method for finding communities of related genes. Proc. Natl. Acad. Sci. USA 101 , 5241-5248 (2004).
  15. [31]F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks. Proc. Natl. Acad. Sci. USA 101 , 2658-2663 (2004).
  16. [34]M. E. J. Newman, Analysis of weighted networks. Preprint cond-mat/0407503 (2004). · arXiv
  17. [35]T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms . MIT Press, Cambridge, MA, 2nd edition (2001).
  18. [37]G. W. Flake, S. R. Lawrence, C. L. Giles, and F. M. Coetzee, Self-organization and identification of Web communities. IEEE Computer 35 , 66-71 (2002).

Cited by

Sorted by citations

Authors
Clauset, A., Newman, M. E. J., & Moore, C.
Affiliations
  • University of New Mexico (US)
  • University of Michigan (US)
Venue
Physical Review E
Published
2004-12-06
Volume
70
Issue
6
Pages
066111-066111
ISSN
  • 1539-3755 (ISSN-L)
  • 1550-2376
OpenAlex
W2047940964
Cited by
7,390
References
2
Citations by year
2026: 240 · 2025: 367 · 2024: 460 · 2023: 414 · 2022: 515 · 2021: 546 · 2020: 556 · 2019: 478 · 2018: 504 · 2017: 438 · 2016: 472 · 2015: 378 · 2014: 393 · 2013: 361 · 2012: 305
FWCI
30.91
Type
journal article
Language
en
Open access
Locations
  • Physical Review E (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (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
  • Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
Keywords
community detection, large-scale networks, sparse networks, dendrogram, linear-time algorithms, customer purchasing patterns

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