Convergence Rate of the Symmetrically Normalized Graph Laplacian
classification
🧮 math.DG
keywords
graphlaplacianconvergencemanifoldnormalizedratesymmetricallyaims
read the original abstract
This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.