Randomized spectral clustering for large-scale multi-layer networks
From MaRDI portal
Cites work
- A fast algorithm for integrative community detection of multi-layer networks
- A random effects stochastic block model for joint community detection in multiple networks with applications to neuroimaging
- A statistical perspective on randomized sketching for ordinary least-squares
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- Approximating spectral clustering via sampling: a review
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
- Bias-corrected joint spectral embedding for multilayer networks with invariant subspace: entrywise eigenvector perturbation and inference
- Co-clustering directed graphs to discover asymmetries and directional communities
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Computational and statistical thresholds in multi-layer stochastic block models
- Consistency of spectral clustering in stochastic block models
- Consistent community detection in multi-layer network data
- Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
- CUR matrix decompositions for improved data analysis
- Decoupling inequalities for the tail probabilities of multivariate \(U\)- statistics
- Dynamic network models and graphon estimation
- Fast approximation of matrix coherence and statistical leverage
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Global spectral clustering in dynamic networks
- Inference for multiple heterogeneous networks with a common invariant subspace
- Joint latent space models for network data with high-dimensional node variables
- Multilayer networks. Structure and function
- Network cross-validation by edge sampling
- Randomized block Krylov subspace methods for trace and log-determinant estimators
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Sketching as a tool for numerical linear algebra
- Sparse subspace clustering in diverse multiplex network model
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks
- Spectral clustering in the dynamic stochastic block model
- Spectral co-clustering in multi-layer directed networks
- Spectral Methods for Data Science: A Statistical Perspective
- Statistical clustering of temporal networks through a dynamic stochastic block model
- Statistical properties of sketching algorithms
- Stochastic block models for multiplex networks: an application to a multilevel network of researchers
- Subsampling spectral clustering for stochastic block models in large-scale networks
This page was built for publication: Randomized spectral clustering for large-scale multi-layer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924450)
