Central limit theorem for the random assignment problem
Statement
Let be the minimum cost of a perfect matching in an matrix of independent uniform random variables. Aldous proved in 1992 that converges, later identifying the limit as via the Poisson-weighted infinite tree; Parisi's exact finite- formula for exponential costs was then proved by Linusson-Wästlund and independently by Nair, Prabhakar and Sharma. The fluctuations resisted. Talagrand applied product-space concentration, Wästlund computed the exponential model's variance as , and Chatterjee proved an order- lower bound under tail hypotheses that exclude the bounded uniform law - but no central limit theorem for was known. This paper claims one: .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.