Research map / Graph learning / Graph algorithms and clustering
Thinned random measures for sparse graphs with overlapping communities
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Contextual Stochastic Block Models (NeurIPS 2018 · similarity 0.89)
- Completely random measures for modelling block-structured sparse networks (NeurIPS 2016 · similarity 0.88)
- Harnessing Multiple Correlated Networks for Exact Community Recovery (NeurIPS 2024 · similarity 0.87)
- Query-Limited Community Recovery in Stochastic Block Models (NeurIPS 2026 · similarity 0.85)
- Efficient Graph Matching for Correlated Stochastic Block Models (NeurIPS 2024 · similarity 0.85)
- When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors (NeurIPS 2026 · similarity 0.85)
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.