Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown

DOI10.1137/120875600zbMath1314.05186arXiv1205.0309OpenAlexW2964179623MaRDI QIDQ5300544

Minh Tang, Donniell E. Fishkind, Daniel L. Sussman, Joshua T. Vogelstein, Carey E. Priebe

Publication date: 27 June 2013

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

adjacency matrix stochastic block model spectral partition

Mathematics Subject Classification ID

Asymptotic properties of parametric estimators (62F12) Robustness and adaptive procedures (parametric inference) (62F35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (33)

Smoothing graphons for modelling exchangeable relational data ⋮ A limit theorem for scaled eigenvectors of random dot product graphs ⋮ Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator ⋮ Optimal Bipartite Network Clustering ⋮ Impact of regularization on spectral clustering ⋮ Randomized Spectral Clustering in Large-Scale Stochastic Block Models ⋮ Maximum Likelihood Estimation and Graph Matching in Errorfully Observed Networks ⋮ Spectral graph clustering via the expectation-solution algorithm ⋮ Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm ⋮ Universally consistent vertex classification for latent positions graphs ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ On the efficacy of higher-order spectral clustering under weighted stochastic block models ⋮ Unnamed Item ⋮ Vertex nomination schemes for membership prediction ⋮ Co-clustering separately exchangeable network data ⋮ Corrected Bayesian Information Criterion for Stochastic Block Models ⋮ Multi-level spectral graph partitioning method ⋮ Unnamed Item ⋮ Statistical inference on random dot product graphs: a survey ⋮ Review on statistical methods for gene network reconstruction using expression data ⋮ Adjacency matrix comparison for stochastic block models ⋮ A goodness-of-fit test for stochastic block models ⋮ Fast community detection by SCORE ⋮ Profile likelihood biclustering ⋮ Network Cross-Validation for Determining the Number of Communities in Network Data ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Vertex nomination: the canonical sampling and the extended spectral nomination schemes ⋮ Analysis of spectral clustering algorithms for community detection: the general bipartite setting ⋮ The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics ⋮ Consistency of spectral clustering in stochastic block models ⋮ Robust and computationally feasible community detection in the presence of arbitrary outlier nodes ⋮ Empirical Bayes estimation for the stochastic blockmodel

This page was built for publication: Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown