Efficient split likelihood-based method for community detection of large-scale networks
From MaRDI portal
Cites work
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Block clustering with Bernoulli mixture models: comparison of different approaches
- Community discovery using nonnegative matrix factorization
- 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
- Estimation and Prediction for Stochastic Blockstructures
- Fast community detection by SCORE
- Hypothesis testing for automated community detection in networks
- Latent Space Approaches to Social Network Analysis
- Likelihood-based model selection for stochastic block models
- Matched bipartite block model with covariates
- Optimization via low-rank approximation for community detection in networks
- Pseudo-likelihood methods for community detection in large sparse networks
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
Cited in
(2)
This page was built for publication: Efficient split likelihood-based method for community detection of large-scale networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541758)