Optimal matching problem on the Boolean cube
From MaRDI portal
Cites work
- A PDE approach to a 2-dimensional matching problem
- A simple Fourier analytic proof of the AKT optimal matching theorem
- Analysis of Boolean Functions
- Asymptotics for transportation cost in high dimensions
- Central limit theorems for empirical transportation cost in general dimension
- Combinatorial Optimization Over Two Random Point Sets
- Concentration inequalities. A nonasymptotic theory of independence
- Constructive quantization: approximation by empirical measures
- Convergence of the empirical measure in expected wasserstein distance: non-asymptotic explicit bounds in ℝd
- Matching random samples in many dimensions
- On optimal matchings
- On the rate of convergence in Wasserstein distance of the empirical measure
- Optimal Transport
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- The jackknife estimate of variance
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
This page was built for publication: Optimal matching problem on the Boolean cube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839752)