ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the minimum cost of a perfect matching in an n×nn\times n matrix of independent uniform random variables. Aldous proved in 1992 that E[Cn]\mathbb{E}[C_n] converges, later identifying the limit as ζ(2)\zeta(2) via the Poisson-weighted infinite tree; Parisi's exact finite-nn 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 4ζ(2)−4ζ(3)+O(n−2)4\zeta(2)-4\zeta(3)+O(n^{-2}), and Chatterjee proved an order-n−1/2n^{-1/2} lower bound under tail hypotheses that exclude the bounded uniform law - but no central limit theorem for CnC_n was known. This paper claims one: n (Cn−ζ(2))⇒N(0, 4ζ(2)−4ζ(3))\sqrt{n}\,(C_n-\zeta(2)) \Rightarrow \mathcal{N}(0,\,4\zeta(2)-4\zeta(3)).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.