Related papers: Transportation Cost Inequality on Path Spaces with…
We propose a technique for interpolating between probability distributions on discrete surfaces, based on the theory of optimal transport. Unlike previous attempts that use linear programming, our method is based on a dynamical formulation…
Understanding network flows such as commuter traffic in large transportation networks is an ongoing challenge due to the complex nature of the transportation infrastructure and of human mobility. Here we show a first-principles based method…
Let $\mu$ be a probability measure on $\mathbb{R}^d$ and $\mu_N$ its empirical measure with sample size $N$. We prove a concentration inequality for the optimal transport cost between $\mu$ and $\mu_N$ for radial cost functions with…
For distinguishable particles it is well known that Brownian motion and a Feynman-Kac functional can be used to calculate the path integral (for imaginary times) for a general class of scalar potentials. In order to treat identical…
We consider diffusive motion of a particle performing a random walk with L\'evy distributed jump lengths and subject to resetting mechanism bringing the walker to an initial position at uniformly distributed times. In the limit of infinite…
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…
We discuss a reaction-diffusion model in one dimension subjected to an external driving force. Each lattice site may be occupied by at most one particle. The particles hop with asymmetric rates (the sum of which is one) to the right or left…
We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…
In this paper, we are interested in a general equation that has finite speed of propagation compatible with Einstein's theory of special relativity. This equation without external force fields has been derived recently by means of optimal…
Inequalities between transportation costs and Fisher information are known to characterize certain concentration properties of Markov processes around their invariant measures. This note provides a new characterization of the quadratic…
We define and discuss the properties of a class of cost functions on the sphere which we term defective cost functions. We then discuss how to extend these definitions and some properties to cost functions defined on Euclidean space and on…
An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\mu$ and $\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology…
We approach the problem of constructing a quantum analogue of the immensely fruitful classical transport cost theory of Monge from a new angle. Going back to the original motivations, by which the transport is a bilinear function of a mass…
We use here a particle system to prove a convergence result as well as a deviation inequality for solutions of granular media equation when the confinement potential and the interaction potential are no more uniformly convex. Proof is…
The scattering theory of quantum transport relates transport properties of disordered mesoscopic conductors to their transfer matrix $\bbox{T}$. We introduce a novel approach to the statistics of transport quantities which expresses the…
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains…
The group of diffeomorphisms of a compact manifold endowed with the L^2 metric acting on the space of probability densities gives a unifying framework for the incompressible Euler equation and the theory of optimal mass transport. Recently,…
The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…
The aim of this paper is two-fold: First, we obtain a better understanding of the intrinsic distance of diffusion processes. Precisely, (i) for all $n\ge1$, the diffusion matrix $A$ is weak upper semicontinuous on $\Omega$ if and only if…
We consider a family of models having an arbitrary positive amount of mass on each site and randomly exchanging an arbitrary amount of mass with nearest neighbor sites. We restrict to the case of diffusive models. We identify a class of…