The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Nonparametric Bayesian inference of the microcanonical stochastic block model
Open accessAbstract
A principled approach to characterize the hidden structure of networks is to formulate generative models and then infer their parameters from data. When the desired structure is composed of modules or "communities," a suitable choice for this task is the stochastic block model (SBM), where nodes are divided into groups, and the placement of edges is conditioned on the group memberships. Here, we present a nonparametric Bayesian method to infer the modular structure of empirical networks, including the number of modules and their hierarchical organization. We focus on a microcanonical variant of the SBM, where the structure is imposed via hard constraints, i.e., the generated networks are not allowed to violate the patterns imposed by the model. We show how this simple model variation allows simultaneously for two important improvements over more traditional inference approaches: (1) deeper Bayesian hierarchies, with noninformative priors replaced by sequences of priors and hyperpriors, which not only remove limitations that seriously degrade the inference on large networks but also reveal structures at multiple scales; (2) a very efficient inference algorithm that scales well not only for networks with a large number of nodes and edges but also with an unlimited number of modules. We show also how this approach can be used to sample modular hierarchies from the posterior distribution, as well as to perform model selection. We discuss and analyze the differences between sampling from the posterior and simply finding the single parameter estimate that maximizes it. Furthermore, we expose a direct equivalence between our microcanonical approach and alternative derivations based on the canonical SBM.
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
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
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“We compute the difference in the log-likelihood ln Pl at that level, and we accept the move according to the Metropolis-Hastings criterion [41,42], i.”
MethodModularity 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
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“This is the core idea behind a very large number of heuristic methods proposed in the last decade and a half [1,2], which despite sharing the same motivation differ substantially from each other, due mainly to the various ways this intuitive idea can be implemented concretely.”
BackgroundPower-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
The structure of the nervous system of the nematode Caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1986.0056 · Cited by 5,589 · cited 1×
“…115 10.7 10 10.1 0.3 Florida food web (wet) [60] 128 32.9 14 14.2 0.4 Residence hall friendships [61] 217 24.6 20 20 0 C. elegans neural network [62] 297 15.9 20 13.5 0.5 Scientific coauthorships [63] 379 4.8 28 29.6 1.6 Country-language network [64] 868 2.9 4 10.1 1.9 Malaria gene similarity…”
InfluentialResolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
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
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
The Minimum Description Length Principle
Grünwald, P. D. (2007) · doi:10.7551/mitpress/4643.001.0001 · Cited by 1,644
On the evolution of user interaction in facebook
Viswanath, B., Mislove, A., Cha, M., & Gummadi, K. P. (2009) · Proceedings of the 2nd ACM workshop on Online social networks · doi:10.1145/1592665.1592675 · Cited by 1,461
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
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
Configuring Random Graph Models with Fixed Degree Sequences
Fosdick, B. K., Larremore, D. B., Nishimura, J., & Ugander, J. (2018) · SIAM Review · doi:10.1137/16m1087175 · Cited by 246
Cited by
Jusup, M., Holme, P., Kanazawa, K., Takayasu, M., Romić, I., Wang, Z., Geček, S., Lipić, T., Podobnik, B., Wang, L., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2021.10.005 · Cited by 643
Mapping the Fine-Scale Organization and Plasticity of the Brain Vasculature
Kirst, C., Skriabine, S., Vieites-Prado, A., Topilko, T., Bertin, P., Gerschenfeld, G., Verny, F., Topilko, P., Michalski, N., Tessier-Lavigne, M., et al. (2020) · Cell · doi:10.1016/j.cell.2020.01.028 · Cited by 379
Selective exposure shapes the Facebook news diet
Cinelli, M., Brugnoli, E., Schmidt, A. L., Zollo, F., Quattrociocchi, W., & Scala, A. (2020) · PLOS ONE · doi:10.1371/journal.pone.0229129 · Cited by 130
Detecting anomalous citation groups in journal networks
Kojaku, S., Livan, G., & Masuda, N. (2021) · Scientific Reports · doi:10.1038/s41598-021-93572-3 · Cited by 53
Community detection in network neuroscience
Betzel, R. F. (2020) · arXiv · doi:10.48550/arxiv.2011.06723 · Cited by 24
Metadata
- Authors
- Peixoto, T. P.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2017-01-17
- Volume
- 95
- Issue
- 1
- Pages
- 012317-012317
- ISSN
- 2470-0045 (ISSN-L)
- 2470-0053
- OpenAlex
- W2531871281
- Cited by
- 196
- References
- 14
- FWCI
- 8.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.