Related papers: Mass transport and uniform rectifiability

Optimal transport induces the Earth Mover's (Wasserstein) distance between probability distributions, a geometric divergence that is relevant to a wide range of problems. Over the last decade, two relaxations of optimal transport have been…

We investigate the Wasserstein distance between the empirical spectral distribution of non-Hermitian random matrices and the Circular Law. For general entry distributions, we obtain a nearly optimal rate of convergence in 1-Wasserstein…

Uniformity testing and the more general identity testing are well studied problems in distributional property testing. Most previous work focuses on testing under $L_1$-distance. However, when the support is very large or even continuous,…

In his classical argument, Rao derives the Riemannian distance corresponding to the Fisher metric using a mapping between the space of positive measures and Euclidean space. He obtains the Hellinger distance on the full space of measures…

Estimating the density of a distribution from samples is a fundamental problem in statistics. In many practical settings, the Wasserstein distance is an appropriate error metric for density estimation. For example, when estimating…

Motivated by the Bures distance, we introduce a new family of distances, \emph{relative translation invariant Wasserstein distances}, denoted by $RW_p$, as an extension of the classical Wasserstein distances $W_p$ for $p \in [1, +\infty)$.…

We define a new two-parameter family of metrics on subsets of Borel probability measures on general metric fiber bundles, called the $ \textit{disintegrated Monge--Kantorovich metrics}$. This family contains the classical Monge-Kantorovich…

In this paper we propose a gauge-theoretic approach to the problems of optimal mass transport for vector and matrix densities. This resolves both the issues of positivity and action transitivity constraints. Bures-type metrics on the…

A common way to quantify the ,,distance'' between measures is via their discrepancy, also known as maximum mean discrepancy (MMD). Discrepancies are related to Sinkhorn divergences $S_\varepsilon$ with appropriate cost functions as…

We study the average $p-$Wasserstein distance between a finite sample of an infinite hyperuniform point process on $\mathbb{R}^2$ and its mean for any $p\geq 1$. The average Wasserstein transport cost is shown to be bounded from above and…

Given two probability measures $\mu$ and $\nu$ we consider a mass transportation mapping $T$ satisfying 1) $T$ sends $\mu$ to $\nu$, 2) $T$ has the form $T = \phi \frac{\nabla \phi}{|\nabla \phi|}$, where $\phi$ is a function with convex…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

Let $M$ be a complete connected Riemannian manifold. For $n \geq 0$, we endow the Wasserstein space $P^{(n)}_2(M) = P_2(\ldots P_2(M)\ldots)$, equipped with the Wasserstein distance $W_2$, with a variational structure that generalizes the…

We consider the problem of solving the optimal transport problem between two empirical distributions with missing values. Our main assumption is that the data is missing completely at random (MCAR), but we allow for heterogeneous…

We study stability and sample complexity properties of divergence regularized optimal transport (DOT). First, we obtain quantitative stability results for optimizers of DOT measured in Wasserstein distance, which are applicable to a wide…

We present a toolkit of directed distances between quantile functions. By employing this, we solve some new optimal transport (OT) problems which e.g. considerably flexibilize some prominent OTs expressed through Wasserstein distances.

The squared Wasserstein distance is a natural quantity to compare probability distributions in a non-parametric setting. This quantity is usually estimated with the plug-in estimator, defined via a discrete optimal transport problem which…

Metro networks serve as good examples of traffic systems for understanding the relations between geometric structures and transport properties.We study and compare 28 world major metro networks in terms of the Wasserstein distance, the key…

Issued from Optimal Transport, the Wasserstein distance has gained importance in Machine Learning due to its appealing geometrical properties and the increasing availability of efficient approximations. In this work, we consider the problem…

We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…