Related papers: Sharp boundary $\varepsilon$-regularity of optimal…
We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…
We analyze controlled mass transportation plans with free end-time that minimize the transport cost induced by the generating function of a Lagrangian within a bounded domain, in addition to costs incurred as export and import tariffs at…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
We study the optimal boundary regularity of solutions to Dirichlet problems involving the logarithmic Laplacian. Our proofs are based on the construction of suitable barriers via the Kelvin transform and direct computations. As applications…
It was recently shown that under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. However, rather than the distance itself, the…
We prove a $C^{1,\alpha}$ interior regularity theorem for fully nonlinear uniformly elliptic integro-differential equations without assuming any regularity of the kernel. We then give some applications to linear theory and higher regularity…
This article is concerned with ``up to $C^{2, \alpha}$-regularity results'' about a mixed local-nonlocal nonlinear elliptic equation which is driven by the superposition of Laplacian and fractional Laplacian operators. First of all, an…
The interior free boundary theory for linear elliptic operators in higher dimensions was developed by Caffarelli in the low regularity context. In these notes, the up-to-the boundary free boundary regularity is discussed for nonlinear…
Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…
We study the regularity of the "free surface" in boundary obstacle problems. We show that near a non-degenerate point the free boundary is a $C^{1,\alpha}$ $(n-2)$-dimensional surface in $\real^{n-1}$.
We study the regularity of solutions to an optimal transportation problem where the dimension of the source is larger than that of the target. We demonstrate that if the target is $c$-convex, then the source has a canonical foliation whose…
In this paper, we want to establish some general results in the Lorentzian optimal transport theory that have well-known Riemannian counterparts. As a first result, we will provide non-trivial assumptions on the measures to ensure strong…
Recent findings for optimal transport maps between distribution functions sharing the same copula show that componentwise the solution is the optimal map between marginal distributions. This is an important discovery since in the…
We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…
In many applications of optimal transport (OT), the object of primary interest is the optimal transport map. This map rearranges mass from one probability distribution to another in the most efficient way possible by minimizing a specified…
Let $X$ and $Y$ be domains of $\mathbb{R}^n$ equipped with respective probability measures $\mu$ and $ \nu$. We consider the problem of optimal transport from $\mu$ to $\nu$ with respect to a cost function $c: X \times Y \to \mathbb{R}$. To…
We analyze two algorithms for approximating the general optimal transport (OT) distance between two discrete distributions of size $n$, up to accuracy $\varepsilon$. For the first algorithm, which is based on the celebrated Sinkhorn's…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We use the transport methods developped in [3] to obtain universality results for local statistics of eigenvalues in the bulk and at the edge for $\beta$-matrix models in the multi-cut regime. We construct an approximate transport map…