Related papers: Various issues around the L1-norm distance
This article deals with the problem of testing conditional independence between two random vectors ${\bf X}$ and ${\bf Y}$ given a confounding random vector ${\bf Z}$. Several authors have considered this problem for multivariate data.…
We provide non-asymptotic bounds and asymptotic limits for convex transport costs between the distribution of partial sums of independent and identically distributed square integrable and centered random variables and the normal…
Probability distributions of human displacements has been fit with exponentially truncated L\'evy flights or fat tailed Pareto inverse power law probability distributions. Thus, people usually stay within a given location (for example, the…
We study a one dimensional Lagrangian problem including the variational reformulation, derived in a recent work of Ambrosio-Baradat-Brenier, of the discrete Monge-Amp\`ere gravitational model, which describes the motion of interacting…
We establish weak limits for the empirical entropy regularized optimal transport cost, the expectation of the empirical plan and the conditional expectation. Our results require only uniform boundedness of the cost function and no…
We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…
Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…
Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…
We study the best approximation and distance problems in the operator space $\B(\HS)$ and in the space of trace class operators $\LS^1(\B(\HS))$. Formulations of distances are obtained in both cases. The case of finite-dimensional…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
We prove existence and uniqueness results for solutions to a class of optimal transportation problems with infinitely many marginals, supported on the real line. We also provide a characterization of the solution with an explicit formula.…
We revisit the duality theorem for multimarginal optimal transportation problems. In particular, we focus on the Coulomb cost. We use a discrete approximation to prove equality of the extremal values and some careful estimates of the…
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…
We consider a discrete-time random walk on a line starting at $x_0\geq 0$ where a cost is incurred at each jump. We obtain an exact analytical formula for the distribution of the total cost of a trajectory until the process crosses the…
We consider a random variable $Y$ and approximations $Y\_n$, defined on the same probability space with values in the same measurable space as $Y$. We are interested in situations where the approximations $Y\_n$ allow to define a Dirichlet…
We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X,dN) a possibly branching geodesic space. We show that under some assumptions on the…
We obtain several averaging lemmas for transport operator with a force term. These lemmas improve the regularity yet known by not considering the force term as part of an arbitrary right-hand side. Two methods are used: local variable…
We introduce and initiate the study of new parameters associated with any norm and any log-concave measure on $\mathbb R^n$, which provide sharp distributional inequalities. In the Gaussian context this investigation sheds light to the…
We introduce fast algorithms for generalized unnormalized optimal transport. To handle densities with different total mass, we consider a dynamic model, which mixes the $L^p$ optimal transport with $L^p$ distance. For $p=1$, we derive the…