Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation
Xiuyuan Cheng, Nan Wu

TL;DR
This paper establishes spectral convergence rates of Gaussian kernel-based graph Laplacians to the Laplace-Beltrami operator on manifolds, providing theoretical guarantees for eigenvalues and eigenvectors with different kernel bandwidths.
Contribution
It introduces new convergence rates for eigenvalues and eigenvectors of graph Laplacians constructed from random samples on manifolds, including density-corrected variants, with rigorous proofs.
Findings
Eigenvalue convergence rate is approximately N^{-1/(d/2+2)} for a specific kernel bandwidth.
Eigenvector convergence in 2-norm is approximately N^{-1/(d/2+4)} under certain conditions.
Theoretical results are validated with numerical experiments.
Abstract
This work studies the spectral convergence of graph Laplacian to the Laplace-Beltrami operator when the graph affinity matrix is constructed from random samples on a -dimensional manifold embedded in a possibly high dimensional space. By analyzing Dirichlet form convergence and constructing candidate approximate eigenfunctions via convolution with manifold heat kernel, we prove that, with Gaussian kernel, one can set the kernel bandwidth parameter such that the eigenvalue convergence rate is and the eigenvector convergence in 2-norm has rate ; When , both eigenvalue and eigenvector rates are . These rates are up to a factor and proved for finitely many low-lying eigenvalues. The result holds for un-normalized and random-walk graph Laplacians when…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Spectral Theory in Mathematical Physics · Markov Chains and Monte Carlo Methods
MethodsConvolution
