Pith. sign in

REVIEW 1 cited by

Convergence of Laplacian spectra from random samples

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1507.00151 v1 pith:2AVNC2B7 submitted 2015-07-01 cs.IT cs.NAmath.ITmath.NAmath.SP

classification cs.ITcs.NAmath.ITmath.NAmath.SP
keywords eigenvaluesdistributioneigenvectorsmanifoldpointcloudsconvergeconvergence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Eigenvectors and eigenvalues of discrete graph Laplacians are often used for manifold learning and nonlinear dimensionality reduction. It was previously proved by Belkin and Niyogi that 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. We have established a unified framework to approximate the elliptic differential operators 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 independently from a distribution (not necessarily to be uniform distribution). Moreover, one estimate of the rate of the convergence is also given.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Generalizable Spectral Embedding with an Application to UMAP

    cs.LG 2025-01 conditional novelty 5.0 of 10

    A post-processing diagonalization step turns SpectralNet's rotationally ambiguous output into the actual eigenvectors, yielding scalable, generalizable spectral embeddings and a generalizable UMAP.

Pith tools