The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Bayesian Approach to Network Modularity
Open accessAbstract
We present an efficient, principled, and interpretable technique for inferring module assignments and for identifying the optimal number of modules in a given network. We show how several existing methods for finding modules can be described as variant, special, or limiting cases of our work, and how the method overcomes the resolution limit problem, accurately recovering the true number of modules. Our approach is based on Bayesian methods for model selection which have been used with success for almost a century, implemented using a variational technique developed only in the past decade. We apply the technique to synthetic and real networks and outline how the method naturally allows selection among competing models.
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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Community 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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Kass, R. E., & Raftery, A. E. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476572 · Cited by 12,558
Cross validatory choice and assessment of statistical predictions
Stone, M. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00994.x · Cited by 10,881
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Cited by
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
“Hofman and Wiggins have proposed a general Bayesian approach to the problem of graph clustering [304].”
BackgroundVariational Inference: A Review for Statisticians
Blei, D. M., Kucukelbir, A., & McAuliffe, J. D. (2017) · Journal of the American Statistical Association · doi:10.1080/01621459.2017.1285773 · Cited by 3,811
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
fastSTRUCTURE: Variational Inference of Population Structure in Large SNP Data Sets
Raj, A., Stephens, M., & Pritchard, J. K. (2014) · Genetics · doi:10.1534/genetics.114.164350 · Cited by 1,714
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
Rosvall, M., Axelsson, D., & Bergstrom, C. T. (2009) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2010-01179-1 · Cited by 844
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
Communities, modules and large-scale structure in networks
Newman, M. E. J. (2012) · Nature Physics · doi:10.1038/nphys2162 · Cited by 787
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review E · doi:10.1103/physreve.84.066106 · Cited by 747
Luo, T.-T., Lu, Y., Yan, S.-K., Xiao, X., Rong, X.-L., & Guo, J. (2020) · Chinese Journal of Integrative Medicine · doi:10.1007/s11655-019-3064-0 · Cited by 638
Statistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
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
Combining link and content for community detection: a discriminative approach
Yang, T., Jin, R., Chi, Y., & Zhu, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557120 · Cited by 364
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
Kovács, I. A., Palotai, R., Szalay, M. S., & Csermely, P. (2010) · PLoS ONE · doi:10.1371/journal.pone.0012528 · Cited by 338
Detecting communities and their evolutions in dynamic social networks—a Bayesian approach
Yang, T., Chi, Y., Zhu, S., Gong, Y., & Jin, R. (2011) · Machine Learning · doi:10.1007/s10994-010-5214-7 · Cited by 318
Efficient discovery of overlapping communities in massive networks
Gopalan, P. K., & Blei, D. M. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1221839110 · Cited by 272
Hierarchical relational models for document networks
Chang, J., & Blei, D. M. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas309 · Cited by 255
Review on statistical methods for gene network reconstruction using expression data
Wang, Y. X. R., & Huang, H. (2014) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2014.03.040 · Cited by 182
Dynamic Networks from Hierarchical Bayesian Graph Clustering
Park, Y., Moore, C., & Bader, J. S. (2010) · PLoS ONE · doi:10.1371/journal.pone.0008118 · Cited by 34
Metadata
- Authors
- Hofman, J. M., & Wiggins, C. H.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2008-06-23
- Volume
- 100
- Issue
- 25
- Pages
- 258701-258701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2116433231
- Cited by
- 298
- References
- 28
- FWCI
- 25.14
- 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.