Research map / Graph learning / Graph algorithms and clustering
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings
Keith D. Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe
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
- Out-of-sample extension of graph adjacency spectral embedding (ICML 2018 · similarity 0.89)
- Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks (NeurIPS 2026 · similarity 0.82)
- Structure-Aware Spectral Sparsification via Uniform Edge Sampling (NeurIPS 2025 · similarity 0.82)
- Generating Graphs via Spectral Diffusion (ICLR 2025 · similarity 0.81)
- Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them (NeurIPS 2026 · similarity 0.81)
- The Noisy Laplacian: a Threshold Phenomenon for Non-Linear Dimension Reduction (ICML 2025 · similarity 0.81)
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.
