Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
From MaRDI portal
Publication:3592320
DOI10.1214/074921706000000888zbMath1124.60030arXivmath/0612777OpenAlexW1493594095MaRDI QIDQ3592320
Evarist Giné M., Vladimir I. Koltchinskii
Publication date: 12 September 2007
Published in: High Dimensional Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0612777
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Functional limit theorems; invariance principles (60F17) Local differential geometry (53B99) Differential invariants (local theory), geometric objects (53A55)
Related Items (48)
Consistency of modularity clustering on random geometric graphs ⋮ A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors ⋮ Lipschitz Regularity of Graph Laplacians on Random Data Clouds ⋮ Normal estimation on manifolds by gradient learning ⋮ Construction and Monte Carlo estimation of wavelet frames generated by a reproducing kernel ⋮ Sparse representation on graphs by tight wavelet frames and applications ⋮ Perturbation Bounds for Procrustes, Classical Scaling, and Trilateration, with Applications to Manifold Learning ⋮ Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation ⋮ Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs ⋮ Unnamed Item ⋮ Concentration of kernel matrices with application to kernel spectral clustering ⋮ Learning Subspaces of Different Dimensions ⋮ Learning gradients on manifolds ⋮ Generalized density clustering ⋮ Spectral analysis of weighted Laplacians arising in data clustering ⋮ The discrete Gaussian free field on a compact manifold ⋮ ABSTRACT AND CLASSICAL HODGE–DE RHAM THEORY ⋮ Consistency of Dirichlet Partitions ⋮ Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator ⋮ Dynamical geometry and a persistence \(K\)-theory in noisy point clouds ⋮ Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach ⋮ Spectral convergence of the connection Laplacian from random samples ⋮ Diffusion Map-based Algorithm for Gain Function Approximation in the Feedback Particle Filter ⋮ Spectral clustering and the high-dimensional stochastic blockmodel ⋮ Manifold learning with arbitrary norms ⋮ The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous ⋮ The game theoreticp-Laplacian and semi-supervised learning with few labels ⋮ Unnamed Item ⋮ Think globally, fit locally under the manifold setup: asymptotic analysis of locally linear embedding ⋮ Random Walks on Dense Graphs and Graphons ⋮ Learning and approximation by Gaussians on Riemannian manifolds ⋮ A variational approach to the consistency of spectral clustering ⋮ A spectral series approach to high-dimensional nonparametric regression ⋮ Explore Intrinsic Geometry of Sleep Dynamics and Predict Sleep Stage by Unsupervised Learning Techniques ⋮ Hydrodynamic limit of the symmetric exclusion process on a compact Riemannian manifold ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ SVM LEARNING AND Lp APPROXIMATION BY GAUSSIANS ON RIEMANNIAN MANIFOLDS ⋮ Analysis of $p$-Laplacian Regularization in Semisupervised Learning ⋮ Dimension Estimation Using Random Connection Models ⋮ Localized Fourier analysis for graph signal processing ⋮ On the path density of a gradient field ⋮ The SPDE approach to Matérn fields: graph representations ⋮ Dual wavelet frame transforms on manifolds and graphs ⋮ Unnamed Item ⋮ The geometry of kernelized spectral clustering ⋮ Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets ⋮ Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds ⋮ Continuum limit of total variation on point clouds
This page was built for publication: Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
