Convergence Rate of the Symmetrically Normalized Graph Laplacian

From MaRDI portal




Abstract: This short note aims at (re)proving that the symmetrically normalized graph Laplacian L=Id−D−1/2WD−1/2 (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold Laplacian when the sampling become infinitely dense. The convergence rate with respect to the number of samples N is O(1/N).














This page was built for publication: Convergence Rate of the Symmetrically Normalized Graph Laplacian

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6222822)