From graph to manifold Laplacian: the convergence rate
From MaRDI portal
(Redirected from Publication:2497983)
Recommendations
Cites work
- Brownian motion on a manifold as limit of stepwise conditioned standard Brownian motions
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: multiscale methods
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning Theory
- Learning Theory
Cited in
(only showing first 100 items - show all)- Consistency of modularity clustering on random geometric graphs
- Time coupled diffusion maps
- A unified framework for harmonic analysis of functions on directed graphs and changing data
- Iterated diffusion maps for feature identification
- Spectral convergence of graph Laplacian and heat kernel reconstruction in L^ from random samples
- Manifold learning with arbitrary norms
- Think globally, fit locally under the manifold setup: asymptotic analysis of locally linear embedding
- Properly-weighted graph Laplacian for semi-supervised learning
- Fractional diffusion maps
- A direct approach for function approximation on data defined manifolds
- Localized Fourier analysis for graph signal processing
- The SPDE approach to Matérn fields: graph representations
- Nonlinear matrix recovery using optimization on the Grassmann manifold
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Operator-theoretic framework for forecasting nonlinear time series with kernel analog techniques
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation
- The discrete Gaussian free field on a compact manifold
- Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Approximating solutions of linear elliptic PDE's on a smooth manifold using local kernel
- Rigidity of Riemannian embeddings of discrete metric spaces
- Wavelet transform on manifolds: old and new approaches
- Tight framelets and fast framelet filter bank transforms on manifolds
- Diffusion maps tailored to arbitrary non-degenerate Itô processes
- Hydrodynamic limit of the symmetric exclusion process on a compact Riemannian manifold
- Data-driven spectral decomposition and forecasting of ergodic dynamical systems
- Spatiotemporal pattern extraction by spectral analysis of vector-valued observables
- A class of Laplacian multiwavelets bases for high-dimensional data
- Representation of functions on big data: graphs and trees
- Spectrally optimized pointset configurations
- Representation of functions on big data associated with directed graphs
- Diffusion polynomial frames on metric measure spaces
- Spectral independent component analysis
- Continuum limit of total variation on point clouds
- Sparse representation on graphs by tight wavelet frames and applications
- Concentration of kernel matrices with application to kernel spectral clustering
- Local kernels and the geometric structure of data
- Adaptive directional Haar tight framelets on bounded domains for digraph signal representations
- The diffusion geometry of fibre bundles: horizontal diffusion maps
- Estimation of a regression function on a manifold by fully connected deep neural networks
- Rates of convergence for Laplacian semi-supervised learning with low labeling rates
- On learning with integral operators
- Vector diffusion maps and the connection Laplacian
- Graph Laplacians and their convergence on random neighborhood graphs
- Randomized near-neighbor graphs, giant components and applications in data science
- Manifold learning for organizing unstructured sets of process observations
- Explore Intrinsic Geometry of Sleep Dynamics and Predict Sleep Stage by Unsupervised Learning Techniques
- Consistency of Dirichlet partitions
- Graph connection Laplacian and random matrices with random blocks
- Spectral convergence of the connection Laplacian from random samples
- Approximate Quadrature Measures on Data-Defined Spaces
- Understanding the geometry of transport: diffusion maps for Lagrangian trajectory data unravel coherent sets
- Harmonic Extension on The Point Cloud
- The game theoretic p-Laplacian and semi-supervised learning with few labels
- The normalized graph cut and Cheeger constant: from discrete to continuous
- LOCAL WAVELET TRANSFORM ON THE SMOOTH SURFACE OF ROTATION CLASS
- Numerical integration on graphs: Where to sample and how to weigh
- Perturbation bounds for procrustes, classical scaling, and trilateration, with applications to manifold learning
- On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms
- Doubly stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise
- Spectral Convergence of Diffusion Maps: Improved Error Bounds and an Alternative Normalization
- Kernel Analog Forecasting: Multiscale Test Problems
- Consistency of archetypal analysis
- Variational limits of \(k\)-NN graph-based functionals on data clouds
- Gaussian process landmarking on manifolds
- Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics
- A maximum principle argument for the uniform convergence of graph Laplacian regressors
- Reconstruction of a Riemannian manifold from noisy intrinsic distances
- Lipschitz regularity of graph Laplacians on random data clouds
- Convergence of graph Laplacian with kNN self-tuned kernels
- Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation
- scientific article; zbMATH DE number 7625171 (Why is no real title available?)
- A continuum limit for the PageRank algorithm
- Continuum limits of nonlocal p-Laplacian variational problems on graphs
- Diffusion map-based algorithm for gain function approximation in the feedback particle filter
- Local and global perspectives on diffusion maps in the analysis of molecular systems
- Local regularization of noisy point clouds: improved global geometric estimates and data analysis
- The Steerable Graph Laplacian and its Application to Filtering Image Datasets
- Analysis of p-Laplacian regularization in semisupervised learning
- Dynamics-adapted cone kernels
- A convergent point integral method for isotropic elliptic equations on a point cloud
- Uniform Convergence of Adaptive Graph-Based Regularization
- Orientability and diffusion maps
- Learning Theory
- Learning Theory
- A generalized diffusion frame for parsimonious representation of functions on data defined manifolds
- Deep neural networks can stably solve high-dimensional, noisy, non-linear inverse problems
- A spectral series approach to high-dimensional nonparametric regression
- Understanding Graph Neural Networks with Generalized Geometric Scattering Transforms
- Reduction methods in climate dynamics -- a brief review
- Spectral Laplace transform of signals on arbitrary domains
- Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
- Graphical designs and gale duality
- Ghost Point Diffusion Maps for Solving Elliptic PDEs on Manifolds with Classical Boundary Conditions
- Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach
- Spatiotemporal analysis using Riemannian composition of diffusion operators
- Diffusion maps for embedded manifolds with boundary with applications to PDEs
- Wavelets on graphs via spectral graph theory
This page was built for publication: From graph to manifold Laplacian: the convergence rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497983)
