Subsampling spectral clustering for stochastic block models in large-scale networks

DOI10.1016/j.csda.2023.107835OpenAlexW4386258352MaRDI QIDQ6071693

Yi Ding, Bo Zhang, Jiayi Deng, Bing-Yi Jing, Danyang Huang, Yingqiu Zhu

Publication date: 28 November 2023

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2023.107835

zbMATH Keywords

community detectionspectral clusteringstochastic block modellarge-scale networksnetwork subsampling

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Likelihood-based model selection for stochastic block models
• Algorithm AS 136: A K-Means Clustering Algorithm
• Network cross-validation by edge sampling
• Spectral clustering and the high-dimensional stochastic blockmodel
• User-friendly tail bounds for sums of random matrices
• Subsampling bootstrap of count features of networks
• Subsampling
• On semidefinite relaxations for the block model
• Community detection in degree-corrected block models
• Consistency of community detection in networks under degree-corrected stochastic block models
• Consistency of spectral clustering in stochastic block models
• Matrix concentration inequalities via the method of exchangeable pairs
• Spectral redemption in clustering sparse networks
• Counting Stars and Other Small Subgraphs in Sublinear-Time
• BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
• Random sampling with a reservoir
• Community structure in social and biological networks
• Approximately Counting Triangles in Sublinear Time
• Optimal Subsampling for Large Sample Logistic Regression
• Randomized Spectral Clustering in Large-Scale Stochastic Block Models
• Corrected Bayesian Information Criterion for Stochastic Block Models
• Information-Based Optimal Subdata Selection for Big Data Linear Regression
• A useful variant of the Davis–Kahan theorem for statisticians
• Covariate-assisted spectral clustering
• Optimal subsampling for quantile regression in big data
• Subsampling sparse graphons under minimal assumptions
• Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data

This page was built for publication: Subsampling spectral clustering for stochastic block models in large-scale networks