Community extraction of network data under stochastic block models
From MaRDI portal
Cites work
- A survey of statistical network models
- A survey on theoretical advances of community detection in networks
- Achieving optimal misclassification proportion in stochastic block models
- Algorithm AS 136: A K-Means Clustering Algorithm
- Community detection in degree-corrected block models
- Community discovery using nonnegative matrix factorization
- Community extraction in multilayer networks with heterogeneous community structure
- Consistency of spectral clustering in stochastic block models
- Convexified modularity maximization for degree-corrected stochastic block models
- Corrected Bayesian information criterion for stochastic block models
- Fast Network Community Detection With Profile-Pseudo Likelihood Methods
- Fast community detection by SCORE
- Minimax rates of community detection in stochastic block models
- Network cross-validation by edge sampling
- Pseudo-likelihood methods for community detection in large sparse networks
This page was built for publication: Community extraction of network data under stochastic block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908409)