Analysis of spectral clustering algorithms for community detection: the general bipartite setting

zbMath1484.62088arXiv1803.04547MaRDI QIDQ4633061

Arash A. Amini, Zhixin Zhou

Publication date: 2 May 2019

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

zbMATH Keywords

community detectionspectral clusteringstochastic block modelbipartite networksgraphon clusteringregularization of random graphssub-Gaussian biclustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (13)

Optimal Bipartite Network Clustering ⋮ Identifiability and parameter estimation of the overlapped stochastic co-block model ⋮ Concentration of kernel matrices with application to kernel spectral clustering ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ Spectral properties for the Laplacian of a generalized Wigner matrix ⋮ A two‐way additive model with unknown group‐specific interactions applied to gene expression data ⋮ Unnamed Item ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach ⋮ Unnamed Item ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Sparse random tensors: concentration, regularization and applications ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Extended stochastic block models with application to criminal networks

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-likelihood methods for community detection in large sparse networks
• Fast community detection by SCORE
• Rate-optimal graphon estimation
• Impact of regularization on spectral clustering
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
• Oracle inequalities for network models and sparse graphon estimation
• Spectral clustering and the high-dimensional stochastic blockmodel
• Community detection in degree-corrected block models
• Consistency of community detection in networks under degree-corrected stochastic block models
• 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
• Consistency of spectral clustering
• Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral redemption in clustering sparse networks
• Graph Partitioning via Adaptive Spectral Techniques
• Community Detection and Stochastic Block Models
• High-Dimensional Probability
• Optimal Bipartite Network Clustering
• Strong Consistency of Spectral Clustering for Stochastic Block Models
• Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
• The phase transition in inhomogeneous random graphs
• Achieving Optimal Misclassification Proportion in Stochastic Block Model
• Concentration and regularization of random graphs
• Covariate-assisted spectral clustering
• Spectral Clustering by Recursive Partitioning
• An Introduction to Matrix Concentration Inequalities

This page was built for publication: Analysis of spectral clustering algorithms for community detection: the general bipartite setting