Likelihood-based model selection for stochastic block models
From MaRDI portal
(Redirected from Publication:90065)
Abstract: The stochastic block model (SBM) provides a popular framework for modeling community structures in networks. However, more attention has been devoted to problems concerning estimating the latent node labels and the model parameters than the issue of choosing the number of blocks. We consider an approach based on the log likelihood ratio statistic and analyze its asymptotic properties under model misspecification. We show the limiting distribution of the statistic in the case of underfitting is normal and obtain its convergence rate in the case of overfitting. These conclusions remain valid when the average degree grows at a polylog rate. The results enable us to derive the correct order of the penalty term for model complexity and arrive at a likelihood-based model selection criterion that is asymptotically consistent. Our analysis can also be extended to a degree-corrected block model (DCSBM). In practice, the likelihood function can be estimated using more computationally efficient variational methods or consistent label estimation algorithms, allowing the criterion to be applied to large networks.
Recommendations
- On model selection for dense stochastic block models
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Hybrid maximum likelihood inference for stochastic block models
- Selective inference for latent block models
- Model selection in overlapping stochastic block models
- Empirical Bayes estimation for the stochastic blockmodel
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
Cited in
(76)- Model-Based Clustering of Nonparametric Weighted Networks With Application to Water Pollution Analysis
- Two-sample test of stochastic block models
- A Time-Varying Network for Cryptocurrencies
- Heterogeneity pursuit for spatial point pattern with application to tree locations: a Bayesian semiparametric recourse
- Large-scale estimation of random graph models with local dependence
- Inference for a generalised stochastic block model with unknown number of blocks and non-conjugate edge models
- Network cross-validation for determining the number of communities in network data
- Universal rank inference via residual subsampling with application to large networks
- A survey on model-based co-clustering: high dimension and estimation challenges
- Classification and estimation in the stochastic blockmodel based on the empirical degrees
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Corrected Bayesian information criterion for stochastic block models
- Model selection in overlapping stochastic block models
- Consistent model selection for the degree corrected stochastic blockmodel
- A spectral based goodness-of-fit test for stochastic block models
- A survey on theoretical advances of community detection in networks
- A likelihood-ratio type test for stochastic block models with bounded degrees
- Hybrid maximum likelihood inference for stochastic block models
- Reliable prediction in the Markov stochastic block model
- Overlapping community detection in networks via sparse spectral decomposition
- Scalable estimation of epidemic thresholds via node sampling
- The Bethe Hessian and information theoretic approaches for online change-point detection in network data
- Optimal adaptivity of signed-polygon statistics for network testing
- Edgeworth expansions for network moments
- Mixture models and networks: The stochastic blockmodel
- Community detection by \(L_{0}\)-penalized graph Laplacian
- Discussion of ``Coauthorship and citation networks for statisticians
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- Network Estimation by Mixing: Adaptivity and More
- Test on stochastic block model: local smoothing and extreme value theory
- Community detection in complex networks: from statistical foundations to data science applications
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Maximum likelihood estimation of sparse networks with missing observations
- Fast learning algorithm for stochastic block model
- Consistent Estimation of the Number of Communities via Regularized Network Embedding
- On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization
- Modeling the social media relationships of Irish politicians using a generalized latent space stochastic blockmodel
- Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
- Statistical embedding: beyond principal components
- nett
- randnet
- Subsampling spectral clustering for stochastic block models in large-scale networks
- Discussion of “Cocitation and Coauthorship Networks of Statisticians”
- Model selection for Gaussian latent block clustering with the integrated classification likelihood
- The highest dimensional stochastic blockmodel with a regularized estimator
- Empirical Likelihood for Network Data
- On the Estimation of the Number of Communities for Sparse Networks
- PCABM: Pairwise Covariates-Adjusted Block Model for Community Detection
- Hypothesis testing for equality of latent positions in random graphs
- Power enhancement and phase transitions for global testing of the mixed membership stochastic block model
- Modeling and Change Detection for Count-Weighted Multilayer Networks
- Network Structure Change Point Detection by Posterior Predictive Discrepancy
- Two-sample test of stochastic block models via the maximum sampling entry-wise deviation
- Adjusted chi-square test for degree-corrected block models
- Estimating the number of communities by spectral methods
- On model selection for dense stochastic block models
- scientific article; zbMATH DE number 7370586 (Why is no real title available?)
- Weighted stochastic block model
- Variational Bayesian inference and complexity control for stochastic block models
- Probabilistic Community Detection With Unknown Number of Communities
- Optimal Estimation of the Number of Network Communities
- Applications of dual regularized Laplacian matrix for community detection
- Estimation and selection for the latent block model on categorical data
- Consistency and asymptotic normality of stochastic block models estimators from sampled data
- Extended stochastic block models with application to criminal networks
- Hierarchical Community Detection by Recursive Partitioning
- scientific article; zbMATH DE number 7056839 (Why is no real title available?)
- A goodness-of-fit test for stochastic block models
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes
- Efficient split likelihood-based method for community detection of large-scale networks
- Community detection with nodal information: likelihood and its variational approximation
- Consistent estimation of the number of communities in stochastic block models using cross-validation
- Fallacy of data-selective inference in modelling networks
- Statistical inference on group Rasch mixture network models
- Special invited paper: the SCORE normalization, especially for heterogeneous network and text data
- Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models
This page was built for publication: Likelihood-based model selection for stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q90065)
