DeepAI AI Chat
Log In Sign Up

Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operator

by   Nicolas Garcia Trillos, et al.
Brown University
Universität Saarland
Carnegie Mellon University

We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a m-dimensional submanifold M in R^d as the sample size n increases and the neighborhood size h tends to zero. We show that eigenvalues and eigenvectors of the graph Laplacian converge with a rate of O(( n/n)^1/2m) to the eigenvalues and eigenfunctions of the weighted Laplace-Beltrami operator of M. No information on the submanifold M is needed in the construction of the graph or the "out-of-sample extension" of the eigenvectors. Of independent interest is a generalization of the rate of convergence of empirical measures on submanifolds in R^d in infinity transportation distance.


page 1

page 2

page 3

page 4


Convergence of Laplacian Eigenmaps and its Rate for Submanifolds with Singularities

In this paper, we give a spectral approximation result for the Laplacian...

Asymptotic analysis and numerical computation of the Laplacian eigenvalues using the conformal mapping

We consider the Dirichlet and Neumann eigenvalues of the Laplacian for a...

Large data limit of the MBO scheme for data clustering: convergence of the dynamics

We prove that the dynamics of the MBO scheme for data clustering converg...

WESD - Weighted Spectral Distance for Measuring Shape Dissimilarity

This article presents a new distance for measuring shape dissimilarity b...

Rates of Convergence for Regression with the Graph Poly-Laplacian

In the (special) smoothing spline problem one considers a variational pr...

Spectral convergence of diffusion maps: improved error bounds and an alternative normalisation

Diffusion maps is a manifold learning algorithm widely used for dimensio...

Relaxed Kacanov scheme for the p-Laplacian with large p

We introduce a globally convergent relaxed Kacanov scheme for the comput...