mlsanityData to 7 Oct 2026

A kernel-based analysis of Laplacian Eigenmaps

arXiv 2402.16481 ↗First posted 26 Feb 2024math.ST math.PR math.SPcited by 2

Not on the map. Why?

Abstract (arXiv)

Given i.i.d. observations uniformly distributed on a closed manifold Msubseteq ℝp, we study the spectral properties of the associated empirical graph Laplacian based on a Gaussian kernel. Our main results are non-asymptotic error bounds, showing that the eigenvalues and eigenspaces of the empirical graph Laplacian are close to the eigenvalues and eigenspaces of the Laplace-Beltrami operator of M. In our analysis, we connect the empirical graph Laplacian to kernel principal component analysis, and consider the heat kernel of M as reproducing kernel feature map. This leads to novel points of view and allows to leverage results for empirical covariance operators in infinite dimensions.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 5 of its 48 references that are in the map. First posted on arXiv 26 Feb 2024.

Builds on

5 of 48 references.

References · 5

  1. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  2. 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
  3. 2022Information Theory with Kernel Methodscited by 37
  4. 2021Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolationcited by 24
  5. 2021Nonasymptotic one-and two-sample tests in high dimension with unknown covariance structurecited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.