Related papers: Eigenvalue distribution of optimal transportation
This work studies the quantitative stability of the quadratic optimal transport map between a fixed probability density $\rho$ and a probability measure $\mu$ on R^d , which we denote T$\mu$. Assuming that the source density $\rho$ is…
We show that any non-degenerate vector field $u$ in $ L^{\infty}(\Omega, \R^N)$, where $\Omega$ is a bounded domain in $\R^N$, can be written as {equation} \hbox{$u(x)= \nabla_1 H(S(x), x)$ for a.e. $x \in \Omega$}, {equation} where $S$ is…
We study the regularity of optimal transport maps between convex domains with quadratic cost. For nondegenerate $C^{\alpha}$-densities, we prove $C^{1, 1-\varepsilon}$-regularity of the potentials up to the boundary. If in addition the…
Let $L$ be a big invertible sheaf on a complex projective variety, equipped with two continuous metrics. We prove that the distribution of the eigenvalues of the transition matrix between the $L^2$ norms on $H^0(X,nL)$ with respect to the…
In this paper we study the distribution of the scaled largest eigenvalue of complexWishart matrices, which has diverse applications both in statistics and wireless communications. Exact expressions, valid for any matrix dimensions, have…
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…
In this paper we investigate the numerical approximation of an analogue of the Wasserstein distance for optimal transport on graphs that is defined via a discrete modification of the Benamou--Brenier formula. This approach involves the…
We study the convergence properties, in Hellinger and related distances, of nonparametric density estimators based on measure transport. These estimators represent the measure of interest as the pushforward of a chosen reference…
This paper proves universality of the distribution of the smallest and largest gaps between eigenvalues of generalized Wigner matrices, under some smoothness assumption for the density of the entries. The proof relies on the Erd{\H…
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 a subsystem of an isolated one-dimensional correlated metal when it is driven by a steady electric field or when it relaxes after driving. We obtain numerically exact reduced density matrix $\rho$ for subsystems which are…
In many scientific fields imaging is used to relate a certain physical quantity to other dependent variables. Therefore, images can be considered as a map from a real-world coordinate system to the non-negative measurements being acquired.…
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…
Entropic optimal transport offers a computationally tractable approximation to the classical problem. In this note, we study the approximation rate of the entropic optimal transport map (in approaching the Brenier map) when the…
In the field of optimal transport theory, an optimal map is known to be a gradient map of a potential function satisfying cost-convexity. In this paper, the Jacobian determinant of a gradient map is shown to be log-concave with respect to a…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
We present an adaptation of the MA-LBR scheme to the Monge-Amp{\`e}re equation with second boundary value condition, provided the target is a convex set. This yields a fast adaptive method to numerically solve the Optimal Transport problem…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
The distributions of the smallest and largest eigenvalues for the matrix product $Z^\dagger Z$, where $Z$ is an $n \times m$ complex Gaussian matrix with correlations both along rows and down columns, are expressed as $m \times m$…
To understand the dynamics of optimization in deep neural networks, we develop a tool to study the evolution of the entire Hessian spectrum throughout the optimization process. Using this, we study a number of hypotheses concerning…