Two provably consistent divide-and-conquer clustering algorithms for large networks

DOI10.1073/PNAS.2100482118MaRDI QIDQ7019710zbMATH OpenFDO

Authors Soumendu Sundar Mukherjee, Purnamrita Sarkar, P. J. Bickel

Publication date 5 March 2025

Published in Proceedings of the National Academy of Sciences of the United States of America (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/PNAS.2100482118

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cited in

(5)

• Graph sub-sampling for divide-and-conquer algorithms in large networks
• Subsampling-based modified Bayesian information criterion for large-scale stochastic block models
• A Bootstrap-based Method for Testing Similarity of Matched Networks
• Scalable Estimation and Two-Sample Testing for Large Networks via Subsampling
• Subsampling based community detection for large networks

This page was built for publication: Two provably consistent divide-and-conquer clustering algorithms for large networks

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