English
Related papers

Related papers: Sharp boundary $\varepsilon$-regularity of optimal…

200 papers

This paper extends a recently proposed robust computational framework for constructing the boundary representation (brep) of the volume swept by a given smooth solid moving along a one parameter family $h$ of rigid motions. Our extension…

Graphics · Computer Science 2014-05-30 Bharat Adsul , Jinesh Machchhar , Milind Sohoni

We consider the family of graphs whose vertex set is $\mathbb{Z}^n$ where two vertices are connected by an edge when their $\ell_\infty$-distance is 1. Towards an edge isoperimetric inequality for this graph, we calculate the edge boundary…

Combinatorics · Mathematics 2013-09-13 Ellen Veomett

We investigate the properties of convex functions in the plane that satisfy a local inequality which generalizes the notion of sub-solution of Monge-Ampere equation for a Monge-Kantorovich problem with quadratic cost between non-absolutely…

Analysis of PDEs · Mathematics 2021-04-08 P. -E. Jabin , A. Mellet , M. Molina

It is well-known that plug-in statistical estimation of optimal transport suffers from the curse of dimensionality. Despite recent efforts to improve the rate of estimation with the smoothness of the problem, the computational complexity of…

Statistics Theory · Mathematics 2021-10-04 Adrien Vacher , Boris Muzellec , Alessandro Rudi , Francis Bach , Francois-Xavier Vialard

We extend a dimensional upper bound on how much an optimal transport map can degenerate for the quadratic transportation cost, originally due to Caffarelli, to cost functions that satisfy the curvature condition of Ma, Trudinger, and Wang.

Analysis of PDEs · Mathematics 2012-11-28 Young-Heon Kim , Jun Kitagawa

We develop a theory of optimal transport for stationary random measures with a focus on stationary point processes and construct a family of distances on the set of stationary random measures. These induce a natural notion of interpolation…

Probability · Mathematics 2024-02-02 Matthias Erbar , Martin Huesmann , Jonas Jalowy , Bastian Müller

We prove a nonsmooth implicit function theorem applicable to the zero set of the difference of convex functions. This theorem is explicit and global: it gives a formula representing this zero set as a difference of convex functions which…

Analysis of PDEs · Mathematics 2021-02-25 Jun Kitagawa , Robert McCann

We study statistical inference for the optimal transport (OT) map (also known as the Brenier map) from a known absolutely continuous reference distribution onto an unknown finitely discrete target distribution. We derive limit distributions…

Statistics Theory · Mathematics 2024-05-21 Ritwik Sadhu , Ziv Goldfeld , Kengo Kato

We provide sharp boundary regularity estimates for solutions to elliptic equations driven by an integro-differential operator obtained as the sum of a Laplacian with a nonlocal operator generalizing a fractional Laplacian. Our approach…

Analysis of PDEs · Mathematics 2025-12-10 Nicola Abatangelo , Elisa Affili , Matteo Cozzi

We study the free boundary of solutions to the parabolic obstacle problem with fully nonlinear diffusion. We show that the free boundary splits into a regular and a singular part: near regular points the free boundary is $C^\infty$ in space…

Analysis of PDEs · Mathematics 2022-09-12 Alessandro Audrito , Teo Kukuljan

We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…

Optimization and Control · Mathematics 2007-11-24 Andrei Agrachev , Paul Lee

Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…

Robotics · Computer Science 2014-04-09 Andrew Dobson , George V. Moustakides , Kostas E. Bekris

We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…

Optimization and Control · Mathematics 2022-07-06 Stephan Eckstein , Marcel Nutz

In this short note, we consider the problem of prescribing the Gauss curvature and image of the Gauss map for the graph of a function over a domain in Euclidean space. The prescription of the image of the Gauss map turns this into a second…

Analysis of PDEs · Mathematics 2020-05-28 Nestor Guillen , Jun Kitagawa

We use a Korevaar-style maximum principle approach to show the following: Fixing a $C^{2}$ bound on the log densities of a set of smooth measures, there is a quantifiably-sized Wasserstein neighborhood over which all pairs of such measures…

Analysis of PDEs · Mathematics 2025-07-15 Micah Warren

In this paper, we extend the scope of Caffarelli's contraction theorem, which provides a measure of the Lipschitz constant for optimal transport maps between log-concave probability densities in $\R^d$. Our focus is on a broader category of…

Analysis of PDEs · Mathematics 2024-04-09 Guillaume Carlier , Alessio Figalli , Filippo Santambrogio

We prove a new sample complexity result for divergence regularized optimal transport. Our bound holds for probability measures on~$\mathbb{R}^d$ with exponential tail decay and for radial cost functions that satisfy a local Lipschitz…

Statistics Theory · Mathematics 2026-03-23 Ruiyu Han , Johannes Wiesel

We establish sharp geometric $C^{1+\alpha}$ regularity estimates for bounded weak solutions of evolution equations of $p$-Laplacian type. Our approach is based on geometric tangential methods, and makes use of a systematic oscillation…

Analysis of PDEs · Mathematics 2018-05-01 Marcelo D. Amaral , João Vítor da Silva , Gleydson C. Ricarte , Rafayel Teymurazyan

We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…

Optimization and Control · Mathematics 2009-01-19 Mathias Beiglböck , Martin Goldstern , Gabriel Maresch , Walter Schachermayer

Given a graph $G=(V,E)$, suppose we are interested in selecting a sequence of vertices $(x_j)_{j=1}^n$ such that $\left\{x_1, \dots, x_k\right\}$ is `well-distributed' uniformly in $k$. We describe a greedy algorithm motivated by potential…

Combinatorics · Mathematics 2021-03-05 Louis Brown