Research map / Graph learning / Graph algorithms and clustering
Community Recovery in the Geometric Block Model
Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| authors of different communities share an affiliation | academic collaboration network · Academic collaboration, inter-cluster edges | edge count: ML-AI 65 vs 43 | Improved |
Closest papers by meaning
- The Geometric Block Model (AAAI 2018 · similarity 0.98)
- Exact Community Recovery under Side Information: Optimality of Spectral Algorithms (ICLR 2025 · similarity 0.89)
- Differentially private exact recovery for stochastic block models (ICML 2024 · similarity 0.88)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · similarity 0.88)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.88)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
