Research map / Graph learning / Graph algorithms and clustering
Node Regression on Latent Position Random Graphs via Local Averaging
Martin Gjorgjevski, Nicolas Keriven, Simon Barthelme, Yohann De Castro
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
- Latent distance estimation for random geometric graphs (NeurIPS 2019 · similarity 0.89)
- Consistent Nonparametric Methods for Network Assisted Covariate Estimation (ICML 2021 · similarity 0.88)
- Local Graph Clustering with Noisy Labels (ICLR 2024 · similarity 0.86)
- Node Similarities under Random Projections: Limits and Pathological Cases (ICLR 2025 · similarity 0.85)
- Learning Local Neighborhoods of Non-Gaussian Graphical Models (AAAI 2025 · 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.
