Randomized Spectral Clustering in Large-Scale Stochastic Block Models. Issue 3 (3rd July 2022)

• Record Type: Journal Article
• Authors: Zhang, Hai; Guo, Xiao; Chang, Xiangyu
• Is Part Of: Journal of computational and graphical statistics. Volume 31:Issue 3(2022)
• Page Start: 887
• Page End: 906
• Publication Date: 2022-07-03
• Subjects: Community detection -- Network -- Random projection -- Random sampling; Mathematical statistics -- Data processing -- Periodicals; Mathematical statistics -- Graphic methods -- Periodicals; 519.50285
• DOI: 10.1080/10618600.2022.2034636
• Languages: English
• ISSNs: 1061-8600

Abstract

Abstract: Spectral clustering has been one of the widely used methods for community detection in networks. However, large-scale networks bring computational challenges to the eigenvalue decomposition therein. In this paper, we study the spectral clustering using randomized sketching algorithms from a statistical perspective, where we typically assume the network data are generated from a stochastic block model that is not necessarily of full rank. To do this, we first use the recently developed sketching algorithms to obtain two randomized spectral clustering algorithms, namely, the random projection-based and the random sampling-based spectral clustering. Then we study the theoretical bounds of the resulting algorithms in terms of the approximation error for the population adjacency matrix, the misclassification error, and the estimation error for the link probability matrix. It turns out that, under mild conditions, the randomized spectral clustering algorithms lead to the same theoretical bounds as those of the original spectral clustering algorithm. We also extend the results to degree-corrected stochastic block models. Numerical experiments support our theoretical findings and show the efficiency of randomized methods. A new R package called Rclust is developed and made available to the public. Supplementary materials for this article are available online.