Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs

DOI10.1016/j.acha.2022.02.004OpenAlexW4214879959MaRDI QIDQ2155800

Yanyan Li

Publication date: 15 July 2022

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.13476

zbMATH Keywords

Laplace-Beltrami operatorrates of convergencespectral convergencegraph Laplaciandiscrete to continuum

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items (8)

Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation ⋮ A continuum limit for the PageRank algorithm ⋮ Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation ⋮ Rates of convergence for Laplacian semi-supervised learning with low labeling rates ⋮ Geometric scattering on measure spaces ⋮ Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling ⋮ Poisson Reweighted Laplacian Uncertainty Sampling for Graph-Based Active Learning ⋮ Data-driven efficient solvers for Langevin dynamics on manifold in high dimensions

Cites Work

• On the rate of convergence in Wasserstein distance of the empirical measure
• Estimating a smooth function on a large graph by Bayesian Laplacian regularisation
• A variational approach to the consistency of spectral clustering
• Large data and zero noise limits of graph-based semi-supervised learning algorithms
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
• Sobolev spaces on Riemannian manifolds
• A graph discretization of the Laplace-Beltrami operator
• Consistency of spectral clustering
• Adaptive piecewise polynomial estimation via trend filtering
• From graph to manifold Laplacian: the convergence rate
• Optimal Cheeger cuts and bisections of random geometric graphs
• Consistency of Cheeger and Ratio Graph Cuts
• Nonparametric sparsity and regularization
• Uncertainty Quantification in Graph-Based Classification of High Dimensional Data
• Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
• Random Geometric Graphs
• Spectral convergence of the connection Laplacian from random samples
• Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
• Consistency of Lipschitz Learning with Infinite Unlabeled Data and Finite Labeled Data
• Variational Limits of $k$-NN Graph-Based Functionals on Data Clouds
• Analysis of $p$-Laplacian Regularization in Semisupervised Learning
• Learning Theory and Kernel Machines
• Learning Theory
• Learning Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs