相关论文: Transportation Distance and the Central Limit Theo…
We introduce folded optimal transport, as a method to extend a cost or distance defined on the extreme boundary of a convex to the whole convex, related to convex extension. This construction broadens the framework of standard optimal…
The purpose of this note is to show that the solution to the Kantorovich optimal transportation problem is supported on a Lipschitz manifold, provided the cost is $C^{2}$ with non-singular mixed second derivative. We use this result to…
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 obtain some sufficient conditions for the Central Limit Theorem for the random processes (fields) with values in the separable part of Holder space in the modern terms of majorizing (minorizing) measures, belonging to X.Fernique and…
For the solution of the Gauss image problem for pseudo-cones, which can be considered as a measure transport problem for certain measures on the sphere, we give a new proof, using a special case of Kantorovich duality.
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…
Coupling probability measures lies at the core of many problems in statistics and machine learning, from domain adaptation to transfer learning and causal inference. Yet, even when restricted to deterministic transports, such couplings are…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
The optimal (Monge-Kantorovich) transportation problem is discussed from several points of view. The Lagrangian formulation extends the action of the {\em Lagrangian} $L(v,x,t)$ from the set of orbits in $\R^n$ to a set of measure-valued…
We prove annealed central limit theorems for finite pattern counts in the measurement record of discrete-time quantum trajectories generated by repeated measurements in a disordered environment. Under summable mixing assumptions on the…
We consider a symmetric random walk on the $\nu$-dimensional lattice, whose exit probability from the origin is modified by an antisymmetric perturbation and prove the local central limit theorem for this process. A short-range correction…
In compact settings, the convergence rate of the empirical optimal transport cost to its population value is well understood for a wide class of spaces and cost functions. In unbounded settings, however, hitherto available results require…
We show that in any complete metric space the probability measures $\mu$ with compact and connected support are the ones having the property that the optimal tranportation distance to any other probability measure $\nu$ living on the…
We investigate the convergence rate of the optimal entropic cost $v_\varepsilon$ to the optimal transport cost as the noise parameter $\varepsilon \downarrow 0$. We show that for a large class of cost functions $c$ on $\mathbb{R}^d\times…
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 study the problem of estimating, in the sense of optimal transport metrics, a measure which is assumed supported on a manifold embedded in a Hilbert space. By establishing a precise connection between optimal transport metrics, optimal…
We prove a local limit theorem for nearest neighbours random walks in stationary random environment of conductances on Z without using any of both classic assumptions of uniform ellipticity and independence on the conductances. Besides the…
This note establishes that a generalization of $c$-cyclical monotonicity from the Monge-Kantorovich problem with two marginals gives rise to a sufficient condition for optimality also in the multi-marginal version of that problem. To obtain…
The optimal transportation problem, first suggested by Gaspard Monge in the 18th century and later revived in the 1940s by Leonid Kantorovich, deals with the question of transporting a certain measure to another, using transport maps or…
The Central Limit Theorem (CLT) is one of the most fundamental results in statistics. It states that the standardized sample mean of a sequence of $n$ mutually independent and identically distributed random variables with finite first and…