3 papers
math.PR2026
A central limit theorem for the random assignment problem
Gilles Mordant
Let \(C_n\) be the minimum cost of a perfect matching in an \(n\times n\) matrix of independent uniform random variables. We prove that \[ \sqrt n\{C_n-ζ(2)\} \ \Longrightarrow\ \m…
math.ST2026
Quantifying the noise sensitivity of the Wasserstein metric for images
Erik Lager, Gilles Mordant, Amit Moscovich
Wasserstein metrics are increasingly adopted as similarity scores for images. We consider the sensitivity of Wasserstein metrics with respect to pixel-wise additive noise when the…
math.AP2026
p-Wasserstein distances on networks and 3D to 1D convergence
Martin Burger, Ariane Fazeny, Gilles Mordant +1
We study transport distances on metric graphs representing gas networks. Starting from the dynamic formulation of the Wasserstein distance, we review extensions to networks, with a…