Related papers: Multi- to one-dimensional transportation

We consider the transfer operators of non-uniformly expanding maps for potentials of various regularity, and show that a specific property of potentials ("flatness") implies a Ruelle-Perron-Frobenius Theorem and a decay of the transfer…

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

We establish improved hypoelliptic estimates on the solutions of kinetic transport equations, using a suitable decomposition of the phase space. Our main result shows that the relative compactness in all variables of a bounded family…

We consider the modified Monge-Kantorovich problem with additional restriction: admissible transport plans must vanish on some fixed functional subspace. Different choice of the subspace leads to different additional properties optimal…

This work derives the Navier--Stokes hydrodynamic equations for a model of a confined, quasi-two-dimensional, $s$-component mixture of inelastic, smooth, hard spheres. Using the inelastic version of the revised Enskog theory, macroscopic…

We will prove a decomposition for Wasserstein geodesics in the following sense: let $(X,d,m)$ be a non-branching metric measure space verifying $\mathsf{CD}_{loc}(K,N)$ or equivalently $\mathsf{CD}^{*}(K,N)$. We prove that every geodesic…

Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms…

In this paper, we study dynamical optimal transport on a connected graph from the perspective of the Benamou-Brenier formulation, where densities are assigned to vertices and velocities to edges. However, directly using Newton's method on…

We generalize a well-known result of L. Caffarelli on Lipschitz estimates for optimal transportation $T$ between uniformly log-concave probability measures. Let $T : \R^d \to \R^d$ be an optimal transportation pushing forward $\mu =…

We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…

We shall present a measure theoretical approach for which together with the Kantorovich duality provide an efficient tool to study the optimal transport problem. Specifically, we study the support of optimal plans where the cost function…

Multiple-choice load balancing has been a topic of intense study since the seminal paper of Azar, Broder, Karlin, and Upfal. Questions in this area can be phrased in terms of orientations of a graph, or more generally a k-uniform random…

We propose an extension of the computational fluid mechanics approach to the Monge-Kantorovich mass transfer problem, which was developed by Benamou-Brenier. Our extension allows optimal transfer of unnormalized and unequal masses. We…

We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete optimal transport. These bounds quantify the stability of the dual solutions of the regularized problem (sometimes called Sinkhorn…

Pushing a little forward an approach proposed by Villani, we are going to prove that in the Riemannian setting the condition $\nabla^2 f< g$ implies that $f$ is $c$-concave with respect to the quadratic cost as soon as it has a sufficiently…

Optimal transport problems pose many challenges when considering their numerical treatment. We investigate the solution of a PDE-constrained optimisation problem subject to a particular transport equation arising from the modelling of image…

The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…

We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…

We give a new proof of the Caffarelli contraction theorem, which states that the Brenier optimal transport map sending the standard Gaussian measure onto a uniformly log-concave probability measure is Lipschitz. The proof combines a recent…

This article generalizes the study of branched/ramified optimal transportation to those with capacity constraints. Each admissible transport network studied here is represented by a transport multi-path between measures, with a capacity…