From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
From MaRDI portal
Publication:2138635
DOI10.1007/s00205-022-01770-8OpenAlexW3016751541MaRDI QIDQ2138635
Matthew Thorpe, Nicolás García Trillos, Ryan W. Murray
Publication date: 12 May 2022
Published in: Archive for Rational Mechanics and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.09304
Nonparametric estimation (62G05) Graph algorithms (graph-theoretic aspects) (05C85) Theory of data (68Pxx) General convexity (52Axx) Manifolds and measure-geometric topics (49Qxx)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear total variation based noise removal algorithms
- Continuum limit of total variation on point clouds
- A variational approach to the consistency of spectral clustering
- Large data and zero noise limits of graph-based semi-supervised learning algorithms
- The sharp Sobolev inequality in quantitative form
- A mass transportation approach to quantitative isoperimetric inequalities
- Generalized coarea formula and fractal sets
- On the connectivity of boundaries of sets minimizing perimeter subject to a volume constraint
- An introduction to \(\Gamma\)-convergence
- Boundary regularity for solutions of a partitioning problem
- The volume of a small geodesic ball of a Riemannian manifold
- \(\Gamma\)-convergence of graph Ginzburg-Landau functionals
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A selection principle for the sharp quantitative isoperimetric inequality
- A graph discretization of the Laplace-Beltrami operator
- Properly-weighted graph Laplacian for semi-supervised learning
- Maximal fluctuations on periodic lattices: an approach via quantitative Wulff inequalities
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- The two hyperplane conjecture
- BV functions and sets of finite perimeter in sub-Riemannian manifolds
- The sharp quantitative isoperimetric inequality
- Consistency of spectral clustering
- Diffusion maps
- From graph to manifold Laplacian: the convergence rate
- Minimal varieties in Riemannian manifolds
- Isoperimetric numbers of graphs
- Optimal Cheeger cuts and bisections of random geometric graphs
- Some sharp isoperimetric theorems for Riemannian manifolds
- Total Variation in Imaging
- Embeddings of Riemannian Manifolds with Heat Kernels and Eigenfunctions
- Consistency of Cheeger and Ratio Graph Cuts
- Sets of Finite Perimeter and Geometric Variational Problems
- Maximal Flow Through a Network
- On the Rate of Convergence of Empirical Measures in ∞-transportation Distance
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On clusterings
- Stability estimates for certain Faber-Krahn,isocapacitary and Cheeger inequalities
- A quantitative isoperimetric inequality in n-dimensional space.
- A strong minimax property of nondegenerate minimal submanifolds.
- Random Geometric Graphs
- Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps
- The game theoreticp-Laplacian and semi-supervised learning with few labels
- Simplified Energy Landscape for Modularity Using Total Variation
- Stability in the Isoperimetric Problem for Convex or Nearly Spherical Domains in R n
- The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
- A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors
- Large data limit for a phase transition model with the p-Laplacian on point clouds
- Estimating perimeter using graph cuts
- Asymptotic analysis of the Ginzburg–Landau functional on point clouds
- A Method Based on Total Variation for Network Modularity Optimization Using the MBO Scheme
- A quantitative Pólya-Szegö principle
- Learning Theory
- Expander flows, geometric embeddings and graph partitioning
