Related papers: Mass transport generated by a flow of Gauss maps
We consider a system of partial differential equations describing mass transport in a multicomponent isothermal compressible fluid. The diffusion fluxes obey the Fick-Onsager or Maxwell-Stefan closure approach. Mechanical forces result into…
We analyze a class of linear partial differential equations that arise as deterministic descriptions of the scaling limits of L\'evy walks, in which transport is driven by a convex combination of fractional material derivatives and a source…
Let $\{\mu_k\}_{k = 1}^N$ be absolutely continuous probability measures on the real line such that every measure $\mu_k$ is supported on the segment $[l_k, r_k]$ and the density function of $\mu_k$ is nonincreasing on that segment for all…
Transport-based density estimation methods are receiving growing interest because of their ability to efficiently generate samples from the approximated density. We further invertigate the sequential transport maps framework proposed from…
We present a flow-based approach to the optimal transport (OT) problem between two continuous distributions $\pi_0,\pi_1$ on $\mathbb{R}^d$, of minimizing a transport cost $\mathbb{E}[c(X_1-X_0)]$ in the set of couplings $(X_0,X_1)$ whose…
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…
A variant of the classical optimal transportation problem is: among all joint measures with fixed marginals and which are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were…
A prominent model for transportation networks is branched transport, which seeks the optimal transportation scheme to move material from a given initial to a final distribution. The cost of the scheme encodes a higher transport efficiency…
A simple procedure to map two probability measures in $\mathbb{R}^d$ is the so-called \emph{Knothe-Rosenblatt rearrangement}, which consists in rearranging monotonically the marginal distributions of the last coordinate, and then the…
The calculus of variations is employed to find steady divergence-free velocity fields that maximize transport of a tracer between two parallel walls held at fixed concentration for one of two constraints on flow strength: a fixed value of…
Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…
The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic…
We prove ballistic transport of all orders, that is, $\lVert x^m\mathrm{e}^{-\mathrm{i}tH}\psi\rVert\asymp t^m$, for the following models: the adjacency matrix on $\mathbb{Z}^d$, the Laplace operator on $\mathbb{R}^d$, periodic…
We give an alternative proof and some extensions of results of Carlier, Figalli and Santambrogio on polynomial upper bounds on the Brenier map between probability measures under various conditions on the densities. The proofs are based on…
Let S be an ergodic measure-preserving automorphism on a non-atomic probability space, and let T be the time-one map of a topologically weak mixing suspension flow over an irreducible subshift of finite type under a Holder ceiling function.…
In this note, we propose a probabilistic approach to bound the (dimension-free) Lipschitz constant of the Langevin flow map on $\mathbb{R}^d$ introduced by Kim and Milman (2012). As example of application, we construct Lipschitz maps from a…
We consider a random walk on the mapping class group of a surface of finite type. We assume that the random walk is determined by a probability measure whose support is finite and generates a non-elementary subgroup $H$. We further assume…
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…
We introduce Wasserstein-like dynamical transport distances between vector-valued densities on the real line. The mobility function from the scalar theory is replaced by a mobility matrix, that is subject to positivity and concavity…
We consider the 1d nonlinear Schr\"odinger equation (NLS) on the torus with initial data distributed according to the Gaussian measure with covariance operator $(1 - \Delta)^{-s}$, where $\Delta$ is the Laplace operator. We prove that the…