2019
DOI: 10.1007/s10208-019-09436-w
|View full text |Cite
|
Sign up to set email alerts
|

Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace–Beltrami Operator

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
125
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 111 publications
(125 citation statements)
references
References 20 publications
0
125
0
Order By: Relevance
“…The spectrum of the normalized graph Laplacian of the latter is known to behave like the eigensystem of the Laplace-Beltrami operator over the submanifold corresponding to the k-th connected subset M k . In particular, we will use existing results [4,34] on error estimates by using the spectrum of a random geometric graph to approximate the eigensystem of the Laplace-Beltrami operator in the numerical analysis literature.…”
Section: 5mentioning
confidence: 99%
“…The spectrum of the normalized graph Laplacian of the latter is known to behave like the eigensystem of the Laplace-Beltrami operator over the submanifold corresponding to the k-th connected subset M k . In particular, we will use existing results [4,34] on error estimates by using the spectrum of a random geometric graph to approximate the eigensystem of the Laplace-Beltrami operator in the numerical analysis literature.…”
Section: 5mentioning
confidence: 99%
“…This truncation has the added benefit of denoising the diffusion distances, since the eigenvectors associated with eigenvalues away from 1 in modulus (in some sense the high frequency eigenvectors) correspond not to intrinsic geometric structures in the data, but to random fluctuations produced by sampling [28]. The embedding…”
Section: Background On Diffusion Geometrymentioning
confidence: 99%
“…One would only need to adjust the statements using manifold analogues of the weighted Dirichlet energy and the Laplacian. The convergence of graph Laplacian in the manifold setting has already been established in the standard setting [19]. In the manifold setting the dimension d in the results above should be replaced by the dimension of the data manifold.…”
Section: Discrete To Continuum Convergencementioning
confidence: 99%
“…Remark 1.4. We remark that the discrete functional (13) can be rewritten as (19) GE n,ε,ζ puq " 1 2n 2 ε 2 ÿ x,yPXn pγ ζ pxq`γ ζ pyqqη ε px´yq|upxq´upyq| 2 , and so the problem has a symmetric weight matrix.…”
Section: Introductionmentioning
confidence: 99%