The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Spectral methods for community detection and graph partitioning
Open accessAbstract
We consider three distinct and well-studied problems concerning network structure: community detection by modularity maximization, community detection by statistical inference, and normalized-cut graph partitioning. Each of these problems can be tackled using spectral algorithms that make use of the eigenvectors of matrix representations of the network. We show that with certain choices of the free parameters appearing in these spectral algorithms the algorithms for all three problems are, in fact, identical, and hence that, at least within the spectral approximations used here, there is no difference between the modularity- and inference-based community detection methods, or between either and graph partitioning.
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.
Integrity signals
Registry
Cites
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.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Self-citationCommunity structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Self-citationModularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Self-citationFortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 2×
“As it stands, this definition is imprecise and leaves room for interpretation, and there have, as a result, been a large number of different meth-ods proposed for solving the problem [12].”
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Self-citationFast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Self-citationAssortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Self-citationRandom graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Self-citationClasses of small-world networks
Amaral, L. A. N., Scala, A., Barthélémy, M., & Stanley, H. E. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.200327197 · Cited by 3,051
The political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Self-citationResilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-003-0651-y · Cited by 2,277
Hierarchical structure and the prediction of missing links in networks
Clauset, A., Moore, C., & Newman, M. E. J. (2008) · Nature · doi:10.1038/nature06830 · Cited by 2,171 · cited 1×
“Along with many studies focusing on local properties of networks, such as clustering [3], degree distributions [4, 5], and correlations [6, 7], are studies that examine large-scale properties like path lengths [3], percolation [8, 9], or hierarchy [10, 11].”
Self-citationHierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Stochastic blockmodels and community structure in networks
Karrer, B., & Newman, M. E. J. (2011) · Physical Review E · doi:10.1103/physreve.83.016107 · Cited by 2,025
Self-citationCommunity detection in complex networks using extremal optimization
Duch, J., & Arenas, A. (2005) · Physical Review E · doi:10.1103/physreve.72.027104 · Cited by 1,549
Dynamical and Correlation Properties of the Internet
Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.258701 · Cited by 1,466
The Spherical Model of a Ferromagnet
Berlin, T. H., & Kac, M. (1952) · Physical Review · doi:10.1103/physrev.86.821 · Cited by 1,027
Modularity from fluctuations in random graphs and complex networks
Guimerà, R., Sales-Pardo, M., & Amaral, L. A. N. (2004) · Physical Review E · doi:10.1103/physreve.70.025101 · Cited by 894
Communities, modules and large-scale structure in networks
Newman, M. E. J. (2012) · Nature Physics · doi:10.1038/nphys2162 · Cited by 787
Self-citationMixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.4485 · Cited by 781
Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure
Snijders, T. A. B., & Nowicki, K. (1997) · Journal of Classification · doi:10.1007/s003579900004 · Cited by 653
Stability of graph communities across time scales
Delvenne, J.-C., Yaliraki, S. N., & Barahona, M. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0903215107 · Cited by 475
Algorithms for graph partitioning on the planted partition model
Condon, A., & Karp, R. M. (2001) · Random Structures and Algorithms · doi:10.1002/1098-2418(200103)18:2<116::aid-rsa1001>3.0.co;2-2 · Cited by 429
Inference and Phase Transitions in the Detection of Modules in Sparse Networks
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.065701 · Cited by 392
PSEUDO-LIKELIHOOD METHODS FOR COMMUNITY DETECTION IN LARGE SPARSE NETWORKS
Amini, A., Chen, A., Bickel, P. J., & Levina, E. (2013) · Cited by 335
Graph Spectra and the Detectability of Community Structure in Networks
Nadakuditi, R. R., & Newman, M. E. J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.188701 · Cited by 316
Self-citationRandom graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.269 · Cited by 188
Self-citationOn Finding Graph Clusterings with Maximum Modularity
Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z., & Wagner, D. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74839-7_12 · Cited by 182
Detection of community structures in networks via global optimization
Medus, A., Acuña, G., & Dorso, C. O. (2005) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.04.022 · Cited by 178
Stochastic Block Models and ReconstructionPreprint
Mossel, E., Neeman, J., & Sly, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.1499 · Cited by 154
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., Daniel, et al. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356.507 · Cited by 143
A Critical Point for Random Graphs with a Given Degree Sequence
Molloy, M. S. O., & Reed, B. A. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356.240 · Cited by 136
Community detection and graph partitioning
Newman, M. E. J. (2013) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/103/28003 · Cited by 135
Self-citationSpherical Model of a Ferromagnet
Lewis, H. W., & Wannier, G. H. (1952) · Physical Review · doi:10.1103/physrev.88.682.2 · Cited by 128
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., et al. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356.510 · Cited by 121
Self-citationSpectra of random graphs with arbitrary expected degrees
Nadakuditi, R. R., & Newman, M. E. J. (2013) · Physical Review E · doi:10.1103/physreve.87.012803 · Cited by 103
Self-citationEigenvalue Spectra of Modular Networks
Peixoto, T. P. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.098701 · Cited by 85
(Un)detectable Cluster Structure in Sparse Networks
Reichardt, J., & Leone, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.078701 · Cited by 74
Hu, D., Ronhovde, P., & Nussinov, Z. (2011) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · doi:10.1080/14786435.2011.616547 · Cited by 56
Bolla, M. (2011) · Physical Review E · doi:10.1103/physreve.84.016108 · Cited by 41
Multiway Spectral Clustering: A Margin-based Perspective
Zhang, Z., & Jordan, M. I. (2008) · Cited by 38
Cited by
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
Recent Advances in Graph Partitioning
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_4 · Cited by 482
A Comprehensive Survey on Community Detection With Deep Learning
Su, X., Xue, S., Liu, F., Wu, J., Yang, J., Zhou, C., Hu, W., Paris, C., Nepal, S., Jin, D., et al. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3137396 · Cited by 353
Equivalence between modularity optimization and maximum likelihood methods for community detection
Newman, M. E. J. (2016) · Physical Review E · doi:10.1103/physreve.94.052315 · Cited by 344
Self-citationCommunity Detection via Maximization of Modularity and Its Variants
Chen, M., Kuzmin, K., & Szymanski, B. K. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307458 · Cited by 301
Metadata
- Authors
- Newman, M. E. J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2013-10-30
- Volume
- 88
- Issue
- 4
- Pages
- 042822-042822
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2217748804
- Cited by
- 424
- References
- 47
- FWCI
- 22.96
- Type
- journal article
- Language
- en
- Open access
- green
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
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.