Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method

DOI10.1214/24-EJS2271MaRDI QIDQ6595781

Guillaume Braun

Publication date: 30 August 2024

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

zbMATH Keywords

clusteringspectral methodbipartite stochastic block model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hanson-Wright inequality and sub-Gaussian concentration
• Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
• Optimality of spectral clustering in the Gaussian mixture model
• An \({\ell_p}\) theory of PCA and spectral clustering
• 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
• Consistency of spectral clustering in stochastic block models
• Analyzing Consumer-Product Graphs: Empirical Findings and Applications in Recommender Systems
• Community Detection and Stochastic Block Models
• An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
• Improved Clustering Algorithms for the Bipartite Stochastic Block Model
• Uniform Bounds for Invariant Subspace Perturbations
• Strong Consistency of Spectral Clustering for Stochastic Block Models
• Spectral techniques applied to sparse random graphs
• Signal-plus-noise matrix models: eigenvector deviations and fluctuations
• Spectral recovery of binary censored block models

This page was built for publication: Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595781)