Adjacency matrix comparison for stochastic block models
From MaRDI portal
Recommendations
- A goodness-of-fit test for stochastic block models
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Computational Science and Its Applications – ICCSA 2004
- Block matrix models for dynamic networks
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
Cites work
- A goodness-of-fit test for stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
- Hypothesis testing for automated community detection in networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Spectral clustering and the high-dimensional stochastic blockmodel
- Variational Bayesian inference and complexity control for stochastic block models
Cited in
(5)- Two-sample test of stochastic block models
- The expected adjacency and modularity matrices in the degree corrected stochastic block model
- Block matrix models for dynamic networks
- Computational Science and Its Applications – ICCSA 2004
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
This page was built for publication: Adjacency matrix comparison for stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197375)
