A Unified Framework for Community Detection and Model Selection in Blockmodels
From MaRDI portal
Cites work
- A Block Model for Node Popularity in Networks with Community Structure
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A goodness-of-fit test for stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of statistical network models
- Achieving optimal misclassification proportion in stochastic block models
- Bootstrapping exchangeable random graphs
- Bootstrapping networks with latent space structure
- Community structure in social and biological networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
- Estimating the number of communities by spectral methods
- Estimation and Clustering in Popularity Adjusted Block Model
- Fast community detection by SCORE
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- scientific article; zbMATH DE number 7626708 (Why is no real title available?)
- Joint Spectral Clustering in Multilayer Degree-Corrected Stochastic Blockmodels
- Mixed Membership Estimation for Social Networks
- Network cross-validation by edge sampling
- Network cross-validation for determining the number of communities in network data
- Networks. An introduction.
- Popularity Adjusted Block Models are Generalized Random Dot Product Graphs
- Pseudo-likelihood methods for community detection in large sparse networks
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Signal-plus-noise matrix models: eigenvector deviations and fluctuations
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral clustering in heterogeneous networks
- Subsampling based community detection for large networks
- Subsampling bootstrap of count features of networks
- Subsampling sparse graphons under minimal assumptions
- The hierarchy of block models
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- User-friendly tail bounds for sums of random matrices
This page was built for publication: A Unified Framework for Community Detection and Model Selection in Blockmodels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7390268)
