Research map / Learning theory and algorithms / Clustering
A Unified Framework for Spectral Clustering in Sparse Graphs
Lorenzo Dall'Amico, Romain Couillet, Nicolas Tremblay
Read the paperCheck your idea against 137,217 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
- Revisiting the Bethe-Hessian: Improved Community Detection in Sparse Heterogeneous Graphs (NeurIPS 2019 · similarity 0.93)
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting (JMLR 2019 · similarity 0.92)
- Improved spectral community detection in large heterogeneous networks (JMLR 2018 · similarity 0.91)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.89)
- Pass-Efficient Algorithms for Graph Spectral Clustering (Student Abstract) (AAAI 2024 · similarity 0.88)
- Equivalence between Graph Spectral Clustering and Column Subset Selection (Student Abstract) (AAAI 2024 · 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.
