Related papers: The Wasserstein distance to the Circular Law
We study the rate of convergence of the empirical spectral distribution of products of independent non-Hermitian random matrices to the power of the Circular Law. The distance to the deterministic limit distribution will be measured in…
We prove rates of convergence for the circular law for the complex Ginibre ensemble. Specifically, we bound the expected $L_p$-Wasserstein distance between the empirical spectral measure of the normalized complex Ginibre ensemble and the…
The circular unitary ensemble and its generalizations concern a random matrix from a compact classical group $\mathrm{U}(N)$, $\mathrm{SU}(N)$, $\mathrm{O}(N)$, $\mathrm{SO}(N)$ or $\mathrm{USp}(N)$ distributed according to the Haar…
The aim of this note is to investigate the Kolmogorov distance of the Circular Law to the empirical spectral distribution of non-Hermitian random matrices with independent entries. The optimal rate of convergence is determined by the…
We study the Wasserstein distance $W_2$ for Gaussian samples. We establish the exact rate of convergence $\sqrt{\log\log n/n}$ of the expected value of the $W_2$ distance between the empirical and true $c.d.f.$'s for the normal…
We consider $N\times N$ Hermitian random matrices with independent identically distributed entries (Wigner matrices). The matrices are normalized so that the average spacing between consecutive eigenvalues is of order $1/N$. Under suitable…
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…
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…
Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…
We study the discretization of generalized Wasserstein distances with nonlinear mobilities on the real line via suitable discrete metrics on the cone of N ordered particles, a setting which naturally appears in the framework of…
Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…
The convergence rate in Wasserstein distance is estimated for the empirical measures of symmetric semilinear SPDEs. Unlike in the finite-dimensional case that the convergence is of algebraic order in time, in the present situation the…
Optimal Transport (OT) metrics allow for defining discrepancies between two probability measures. Wasserstein distance is for longer the celebrated OT-distance frequently-used in the literature, which seeks probability distributions to be…
The notion of entropy-regularized optimal transport, also known as Sinkhorn divergence, has recently gained popularity in machine learning and statistics, as it makes feasible the use of smoothed optimal transportation distances for data…
We revisit the question of characterizing the convergence rate of plug-in estimators of optimal transport costs. It is well known that an empirical measure comprising independent samples from an absolutely continuous distribution on…
The question of optimally approximating an arbitrary probability measure in the Wasserstein distance by a discrete one with uniform weights is considered. Estimates are obtained for the optimal approximation distance, with an explicit rate…
The object of study in this paper is the expected $2$-Wasserstein distance between the empirical measures of several point processes and their respective limit. For this, the main tool developed is a smoothing procedure in Euclidean spaces…
We obtain an estimate for the expected subspace robust Wasserstein distance between any probability measure on the unit ball of a separable Hilbert space, and its empirical distribution from $n$ i.i.d. samples.
We discuss the relation between the Wasserstein distance of order 1 between probability distributions on a metric space, arising in the study of Monge-Kantorovich transport problem, and the spectral distance of noncommutative geometry.…
Sinkhorn divergence is a measure of dissimilarity between two probability measures. It is obtained through adding an entropic regularization term to Kantorovich's optimal transport problem and can hence be viewed as an entropically…