Likelihood-based model selection for stochastic block models
From MaRDI portal
Publication:90065
DOI10.1214/16-aos1457zbMath1371.62017arXiv1502.02069OpenAlexW2963873688WikidataQ105584288 ScholiaQ105584288MaRDI QIDQ90065
Peter J. Bickel, Y. X. Rachel Wang, Yanyan Li, Y. X. Rachel Wang
Publication date: 1 April 2017
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.02069
Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Asymptotic properties of parametric tests (62F05)
Related Items (36)
Overlapping community detection in networks via sparse spectral decomposition ⋮ The Bethe Hessian and information theoretic approaches for online change-point detection in network data ⋮ Scalable estimation of epidemic thresholds via node sampling ⋮ Hierarchical Community Detection by Recursive Partitioning ⋮ 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 ⋮ Edgeworth expansions for network moments ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Community detection by \(L_{0}\)-penalized graph Laplacian ⋮ On model selection for dense stochastic block models ⋮ Test on stochastic block model: local smoothing and extreme value theory ⋮ Using Maximum Entry-Wise Deviation to Test the Goodness of Fit for Stochastic Block Models ⋮ Subsampling spectral clustering for stochastic block models in large-scale networks ⋮ Optimal Estimation of the Number of Network Communities ⋮ Mixture models and networks: The stochastic blockmodel ⋮ Power enhancement and phase transitions for global testing of the mixed membership stochastic block model ⋮ Unnamed Item ⋮ Universal rank inference via residual subsampling with application to large networks ⋮ A survey on model-based co-clustering: high dimension and estimation challenges ⋮ Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks ⋮ Statistical embedding: beyond principal components ⋮ Network Structure Change Point Detection by Posterior Predictive Discrepancy ⋮ Consistency and asymptotic normality of stochastic block models estimators from sampled data ⋮ Consistent Estimation of the Number of Communities via Regularized Network Embedding ⋮ Corrected Bayesian Information Criterion for Stochastic Block Models ⋮ Maximum likelihood estimation of sparse networks with missing observations ⋮ Estimating the number of communities by spectral methods ⋮ Adjusted chi-square test for degree-corrected block models ⋮ nett ⋮ Network Cross-Validation for Determining the Number of Communities in Network Data ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Weighted stochastic block model ⋮ Probabilistic Community Detection With Unknown Number of Communities ⋮ Optimal adaptivity of signed-polygon statistics for network testing ⋮ Modeling the social media relationships of Irish politicians using a generalized latent space stochastic blockmodel ⋮ Extended stochastic block models with application to criminal networks
This page was built for publication: Likelihood-based model selection for stochastic block models
