English
Related papers

Related papers: Eigenvalue distribution of optimal transportation

200 papers

Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of…

Probability · Mathematics 2007-07-17 Gerard Ben Arous , Alice Guionnet

Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…

Probability · Mathematics 2021-04-23 Ariel Neufeld , Julian Sester

This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2}$ when using…

Machine Learning · Statistics 2020-12-02 Rémi Flamary , Karim Lounici , André Ferrari

In recent works - both experimental and theoretical - it has been shown how to use computational geometry to efficently construct approximations to the optimal transport map between two given probability measures on Euclidean space, by…

Numerical Analysis · Mathematics 2020-09-14 Robert J. Berman

In this paper, we investigate the eigenvalue distribution of a class of kernel random matrices whose $(i,j)$-th entry is $f(X_i,X_j)$ where $f$ is a symmetric function belonging to the Paley-Wiener space $\mathcal{B}_c$ and $(X_i)_{1\leq i…

Statistics Theory · Mathematics 2025-07-22 Jebalia Mohamed , Ahmed Souabni

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.…

Optimization and Control · Mathematics 2012-11-29 Jonathan Korman , Robert J. McCann

The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show this convergence on all mesoscopic scales slightly…

Probability · Mathematics 2021-02-08 Johannes Alt , Torben Krüger

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

Probability · Mathematics 2020-07-31 Bartłomiej Polaczyk

We study the limiting distribution of the eigenvalues of the Ginibre ensemble conditioned on the event that a certain proportion lie in a given region of the complex plane. Using an equivalent formulation as an obstacle problem, we describe…

Probability · Mathematics 2013-04-09 Scott N. Armstrong , Sylvia Serfaty , Ofer Zeitouni

In the current work, we study the eigenvalue distribution results of a class of non-normal matrix-sequences which may be viewed as a low rank perturbation, depending on a parameter $\beta>1$, of the basic Toeplitz matrix-sequence…

Numerical Analysis · Mathematics 2024-02-08 Alec Schiavoni Piazza , David Meadon , Stefano Serra-Capizzano

Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and generative modelling. In…

Statistics Theory · Mathematics 2026-05-21 Riccardo Passeggeri , Rohan M. Shenoy , Pengcheng Ye

This is the lecture notes on the interplay between optimal transport and Riemannian geometry. On a Riemannian manifold, the convexity of entropy along optimal transport in the space of probability measures characterizes lower bounds of the…

Classical Analysis and ODEs · Mathematics 2010-09-20 Shin-Ichi Ohta

Optimal transport maps define a one-to-one correspondence between probability distributions, and as such have grown popular for machine learning applications. However, these maps are generally defined on empirical observations and cannot be…

Statistics Theory · Mathematics 2021-02-18 Lucas de Lara , Alberto González-Sanz , Jean-Michel Loubes

We study a random matching problem on closed compact $2$-dimensional Riemannian manifolds (with respect to the squared Riemannian distance), with samples of random points whose common law is absolutely continuous with respect to the volume…

Probability · Mathematics 2026-05-01 Nicolas Clozeau , Francesco Mattesini

We investigate how mass transports that optimize the inner product cost -considered by Y. Brenier- propagate in time along a given Lagrangian. In the deterministic case, we consider transports that maximize and minimize the following…

Analysis of PDEs · Mathematics 2018-04-27 Alistair Barton , Nassif Ghoussoub

Unitary ensembles of large N x N random matrices with a non-Gaussian probability distribution P[H] ~ exp{-TrV[H]} are studied using a theory of polynomials orthogonal with respect to exponential weights. Asymptotically exact expressions for…

Condensed Matter · Physics 2008-02-03 V. Freilikher , E. Kanzieper , I. Yurkevich

The real Ginibre ensemble consists of random $N \times N$ matrices formed from i.i.d. standard Gaussian entries. By using the method of skew orthogonal polynomials, the general $n$-point correlations for the real eigenvalues, and for the…

Statistical Mechanics · Physics 2015-06-16 Peter J. Forrester , Taro Nagao

We study the Wasserstein projection of a compactly supported probability measure onto the class of measures whose density ratio is bounded, and we place this projection in a broader program connecting generative modeling, optimal transport,…

Analysis of PDEs · Mathematics 2026-04-13 Hy P. G. Lam

This is an expository paper describing how duality theory for Hessian manifolds provides a natural setting for optimal transport. We explain how this can be used to solve Monge-Amp\`ere equations and survey recent results along these lines…

Differential Geometry · Mathematics 2023-06-22 Jakob Hultgren

Correctly estimating the discrepancy between two data distributions has always been an important task in Machine Learning. Recently, Cuturi proposed the Sinkhorn distance which makes use of an approximate Optimal Transport cost between two…

Computer Vision and Pattern Recognition · Computer Science 2018-01-18 Ying Lu , Liming Chen , Alexandre Saidi , Xianfeng Gu
‹ Prev 1 4 5 6 7 8 10 Next ›