Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
From MaRDI portal
Publication:6180749
DOI10.1080/10618600.2022.2134874arXiv2012.04646OpenAlexW4306145987MaRDI QIDQ6180749FDOQ6180749
Authors: Haolei Weng, Yang Feng 
Publication date: 22 January 2024
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Abstract: One of the fundamental problems in network analysis is detecting community structure in multi-layer networks, of which each layer represents one type of edge information among the nodes. We propose integrative spectral clustering approaches based on effective convex layer aggregations. Our aggregation methods are strongly motivated by a delicate asymptotic analysis of the spectral embedding of weighted adjacency matrices and the downstream -means clustering, in a challenging regime where community detection consistency is impossible. In fact, the methods are shown to estimate the optimal convex aggregation, which minimizes the mis-clustering error under some specialized multi-layer network models. Our analysis further suggests that clustering using Gaussian mixture models is generally superior to the commonly used -means in spectral clustering. Extensive numerical studies demonstrate that our adaptive aggregation techniques, together with Gaussian mixture model clustering, make the new spectral clustering remarkably competitive compared to several popularly used methods.
Full work available at URL: https://arxiv.org/abs/2012.04646
community detection\(k\)-meansspectral clusteringmulti-layer networkseigenvalue ratioGaussian mixture distributionsconvex aggregationasymptotic misclustering error
Cites Work
- Strong consistency of k-means clustering
- A nonparametric view of network models and Newman–Girvan and other modularities
- Spectral clustering and the high-dimensional stochastic blockmodel
- Pseudo-likelihood methods for community detection in large sparse networks
- Likelihood-based model selection for stochastic block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of maximum-likelihood and variational estimators in the stochastic block model
- Consistency of spectral clustering in stochastic block models
- Spectral redemption in clustering sparse networks
- Mixed membership stochastic blockmodels
- Minimax rates of community detection in stochastic block models
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- Reconstruction and estimation in the planted partition model
- A useful variant of the Davis-Kahan theorem for statisticians
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Concentration and regularization of random graphs
- A goodness-of-fit test for stochastic block models
- Asymptotic behaviour of classification maximum likelihood estimates
- Fast community detection by SCORE
- On semidefinite relaxations for the 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
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Stochastic blockmodels with a growing number of classes
- Exact Recovery in the Stochastic Block Model
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Detecting Overlapping Communities in Networks Using Spectral Methods
- Community detection in networks with node features
- Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
- Community detection in sparse networks via Grothendieck's inequality
- Role of normalization in spectral clustering for stochastic blockmodels
- The solution of some random NP-hard problems in polynomial expected time
- Impact of regularization on spectral clustering
- Random matrices have simple spectrum
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
- Limiting behavior of eigenvectors of large Wigner matrices
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Networks
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Asymptotic mutual information for the balanced binary stochastic block model
- Consistent community detection in multi-layer network data
- Sparse random matrices have simple spectrum
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- Optimal rates for community estimation in the weighted stochastic block model
Cited In (1)
This page was built for publication: Spectral Clustering via Adaptive Layer Aggregation for Multi-Layer Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180749)
