DeepAI AI Chat
Log In Sign Up

Convergence of Laplacian Eigenmaps and its Rate for Submanifolds with Singularities

10/15/2021
by   Masayuki Aino, et al.
0

In this paper, we give a spectral approximation result for the Laplacian on submanifolds of Euclidean spaces with singularities by the ϵ-neighborhood graph constructed from random points on the submanifold. Our convergence rate for the eigenvalue of the Laplacian is O((log n/n)^1/(m+2)), where m and n denote the dimension of the manifold and the sample size, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/27/2015

Spectral Convergence Rate of Graph Laplacian

Laplacian Eigenvectors of the graph constructed from a data set are used...
10/17/2022

On the linear convergence of additive Schwarz methods for the p-Laplacian

We consider additive Schwarz methods for boundary value problems involvi...
10/25/2021

Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix

For a connected graph 𝒢=(V,E) with n nodes, m edges, and Laplacian matri...
11/14/2021

Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs

In this paper we study the statistical properties of Principal Component...
12/23/2022

A Convergence Rate for Manifold Neural Networks

High-dimensional data arises in numerous applications, and the rapidly d...
09/06/2022

Rates of Convergence for Regression with the Graph Poly-Laplacian

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