Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator

DOI10.3150/21-BEJ1376OpenAlexW4214888512MaRDI QIDQ2137006

Minh Tang, Joshua Cape, Carey E. Priebe

Publication date: 16 May 2022

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.10936

zbMATH Keywords

asymptotic normalityasymptotic efficiencyspectral embeddingrandom dot product graphstochastic blockmodels

Mathematics Subject Classification ID

Multivariate analysis (62Hxx) Nonparametric inference (62Gxx) Probability theory and stochastic processes (60-XX)

Related Items (6)

Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Optimal Estimation of the Number of Network Communities ⋮ Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates ⋮ Unnamed Item ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Likelihood-based model selection for stochastic block models
• Rate-optimal graphon estimation
• A limit theorem for scaled eigenvectors of random dot product graphs
• Sparse estimators and the oracle property, or the return of Hodges' estimator
• Impact of regularization on spectral clustering
• Spectral statistics of Erdős-Rényi graphs. I: Local semicircle law
• Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Oracle inequalities for network models and sparse graphon estimation
• The commutation matrix: Some properties and applications
• Spectral clustering and the high-dimensional stochastic blockmodel
• The eigenvalues of random symmetric matrices
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Perturbation expansions and error bounds for the truncated singular value decomposition
• Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
• Entrywise eigenvector analysis of random matrices with low expected rank
• The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
• Matrix estimation by universal singular value thresholding
• Consistency of spectral clustering in stochastic block models
• Role of normalization in spectral clustering for stochastic blockmodels
• Stochastic blockmodels with a growing number of classes
• A nonparametric view of network models and Newman–Girvan and other modularities
• Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
• Exact Recovery in the Stochastic Block Model
• Mixed membership stochastic blockmodels
• Graph Partitioning via Adaptive Spectral Techniques
• The Elimination Matrix: Some Lemmas and Applications
• Asymptotic Statistics
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Latent Space Approaches to Social Network Analysis
• Community Detection and Stochastic Block Models
• A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
• Asymptotic Risk and Bayes Risk of Thresholding and Superefficient Estimates and Optimal Thresholding
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• Computing Communities in Large Networks Using Random Walks
• Random Dot Product Graph Models for Social Networks
• Hypothesis Testing for Automated Community Detection in Networks
• Estimating Mixed Memberships With Sharp Eigenvector Deviations
• A goodness-of-fit test for stochastic block models

This page was built for publication: Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator