2 citations · 2 across the 6 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
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.PR2020
Maxima and near-maxima of a Gaussian random assignment field
Gilles Mordant, Johan Segers
The assumption that the elements of the cost matrix in the classical assignment problem are drawn independently from a standard Gaussian distribution motivates the study of a parti…