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

DOI10.1016/J.CSDA.2023.107835MaRDI QIDQ6071693zbMATH OpenOpenAlexFDO

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

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 detectionlarge-scale networksnetwork subsamplingspectral clusteringstochastic block model

Mathematics Subject Classification ID

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

Recommendations

• A distributed community detection algorithm for large scale networks under stochastic block models
• Overlapping community detection in networks via sparse spectral decomposition
• Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering

Cites work

• A useful variant of the Davis-Kahan theorem for statisticians
• Algorithm AS 136: A K-Means Clustering Algorithm
• Approximately counting triangles in sublinear time
• BOULWARE STATE IN EXACTLY SOLVABLE MODELS OF 2D DILATON GRAVITY
• Community detection in degree-corrected block models
• Community structure in social and biological networks
• Complex graphs and networks
• Consistency of community detection in networks under degree-corrected stochastic block models
• Consistency of spectral clustering in stochastic block models
• Corrected Bayesian information criterion for stochastic block models
• Counting stars and other small subgraphs in sublinear-time
• Covariate-assisted spectral clustering
• Fast approximation of matrix coherence and statistical leverage
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Information-Based Optimal Subdata Selection for Big Data Linear Regression
• Likelihood-based model selection for stochastic block models
• Matrix concentration inequalities via the method of exchangeable pairs
• Network cross-validation by edge sampling
• On semidefinite relaxations for the block model
• Optimal Distributed Subsampling for Maximum Quasi-Likelihood Estimators With Massive Data
• Optimal subsampling for large sample logistic regression
• Optimal subsampling for quantile regression in big data
• Random sampling with a reservoir
• Randomized Spectral Clustering in Large-Scale Stochastic Block Models
• Spectral clustering and the high-dimensional stochastic blockmodel
• Spectral redemption in clustering sparse networks
• Subsampling
• Subsampling bootstrap of count features of networks
• Subsampling sparse graphons under minimal assumptions
• User-friendly tail bounds for sums of random matrices

Cited in

(6)

• A distributed community detection algorithm for large scale networks under stochastic block models
• Randomized spectral clustering for large-scale multi-layer networks
• Investigating network structures in recurrent event data with discrete observation times
• Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
• Adaptive subsampling spectral clustering based on second-order neighbour relationships for sparse networks
• Regularized spectral clustering in overlapping networks

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

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