Eigenvectors and eigenvalues of discrete Laplacians are often used for manifold learning and nonlinear dimensionality reduction.Graph Laplacian is one widely used discrete laplacian on point cloud.It was previously pr...Eigenvectors and eigenvalues of discrete Laplacians are often used for manifold learning and nonlinear dimensionality reduction.Graph Laplacian is one widely used discrete laplacian on point cloud.It was previously proved by Belkin and Niyogithat the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled independently from the uniform distribution over the manifold.Recently,we introduced Point Integral method(PIM)to solve elliptic equations and corresponding eigenvalue problem on point clouds.In this paper,we prove that the eigenvectors and eigenvalues obtained by PIM converge in the limit of infinitely many random samples.Moreover,estimation of the convergence rate is also given.展开更多
基金This research was supported by NSFC Grant 11671005.
文摘Eigenvectors and eigenvalues of discrete Laplacians are often used for manifold learning and nonlinear dimensionality reduction.Graph Laplacian is one widely used discrete laplacian on point cloud.It was previously proved by Belkin and Niyogithat the eigenvectors and eigenvalues of the graph Laplacian converge to the eigenfunctions and eigenvalues of the Laplace-Beltrami operator of the manifold in the limit of infinitely many data points sampled independently from the uniform distribution over the manifold.Recently,we introduced Point Integral method(PIM)to solve elliptic equations and corresponding eigenvalue problem on point clouds.In this paper,we prove that the eigenvectors and eigenvalues obtained by PIM converge in the limit of infinitely many random samples.Moreover,estimation of the convergence rate is also given.
