Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
From MaRDI portal
Publication:6180749
DOI10.1080/10618600.2022.2134874arXiv2012.04646OpenAlexW4306145987MaRDI QIDQ6180749
Yang Feng, Haolei Weng, Unnamed Author
Publication date: 22 January 2024
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04646
community detectionspectral clustering\(k\)-meansmulti-layer networkseigenvalue ratioGaussian mixture distributionsconvex aggregationasymptotic misclustering error
Cites Work
- Pseudo-likelihood methods for community detection in large sparse networks
- Likelihood-based model selection for stochastic block models
- Fast community detection by SCORE
- Impact of regularization on spectral clustering
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Minimax rates of community detection in stochastic block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Reconstruction and estimation in the planted partition model
- Community detection in networks with node features
- Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
- Spectral clustering and the high-dimensional stochastic blockmodel
- Limiting behavior of eigenvectors of large Wigner matrices
- Community detection in sparse networks via Grothendieck's inequality
- Strong consistency of k-means clustering
- Random matrices have simple spectrum
- On semidefinite relaxations for the block model
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Sparse random matrices have simple spectrum
- Optimal rates for community estimation in the weighted stochastic block model
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks
- 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
- Role of normalization in spectral clustering for stochastic blockmodels
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral redemption in clustering sparse networks
- Exact Recovery in the Stochastic Block Model
- The solution of some random NP-hard problems in polynomial expected time
- Mixed membership stochastic blockmodels
- Asymptotic behaviour of classification maximum likelihood estimates
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- Networks
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Asymptotic mutual information for the balanced binary stochastic block model
- Detecting Overlapping Communities in Networks Using Spectral Methods
- Consistent community detection in multi-layer network data
- A useful variant of the Davis–Kahan theorem for statisticians
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Concentration and regularization of random graphs
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- A goodness-of-fit test for stochastic block models
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
