Greedy separation algorithm finding community for a stochastic block model

DOI10.1080/03610918.2023.2240982MaRDI QIDQ6893086zbMATH OpenFDO

Authors Akihiro Kaneko, Hiroki Hashiguchi

Publication date 27 November 2025

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2023.2240982

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A necessary and sufficient condition for edge universality of Wigner matrices
• Community structure in social and biological networks
• Corrected Bayesian information criterion for stochastic block models
• Hypothesis testing for automated community detection in networks
• Likelihood-based model selection for stochastic block models
• Local community detection in complex networks based on maximum cliques extension
• Network cross-validation for determining the number of communities in network data
• On orthogonal and symplectic matrix ensembles
• Pseudo-likelihood methods for community detection in large sparse networks
• Spectral clustering and the high-dimensional stochastic blockmodel

This page was built for publication: Greedy separation algorithm finding community for a stochastic block model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6893086)