Research map / Graph learning / Graph algorithms and clustering
Subsampling in Large Graphs Using Ricci Curvature
Shushan Wu, Huimin Cheng, Jiazhang Cai, Ping Ma, Wenxuan Zhong
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
- Curvature-based Clustering on Graphs (JMLR 2025 · similarity 0.89)
- Community models for networks observed through edge nominations (JMLR 2023 · similarity 0.86)
- Unveiling the sampling density in non-uniform geometric graphs (ICLR 2023 · similarity 0.86)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.85)
- Recovering Manifold Structure Using Ollivier Ricci Curvature (ICLR 2025 · similarity 0.84)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.84)
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.
