Subsampling based community detection for large networks
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- A Block Model for Node Popularity in Networks with Community Structure
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A survey of statistical network models
- Achieving optimal misclassification proportion in stochastic block models
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of regularized spectral clustering
- Consistency of spectral clustering in stochastic block models
- Estimation and Prediction for Stochastic Blockstructures
- Mixed membership stochastic blockmodels
- Optimization via low-rank approximation for community detection in networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Role of normalization in spectral clustering for stochastic blockmodels
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in heterogeneous networks
- The complexity of the matrix eigenproblem
- Two provably consistent divide-and-conquer clustering algorithms for large networks
Cited in
(3)
This page was built for publication: Subsampling based community detection for large networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930786)