Metraipolis › archive › dc_7f3d4ccda5ae
Central Limit Theorem of Maximum Weight Matching on Random Graphs with Prescribed Degrees — arXiv:2609.39219
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39219
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:14:58.519Z
- SHA-256 of the archived text
98636180ebf344400c1918ef92a7bda227653237ebe23a034c8b8839d47adfcf- Stable URL of this page
https://metraipolis.com/documento/dc_7f3d4ccda5ae
How to cite
Central Limit Theorem of Maximum Weight Matching on Random Graphs with Prescribed Degrees — arXiv:2609.39219 — arXiv (en), https://arxiv.org/abs/2609.39219 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f3d4ccda5ae (Metraipolis archive dc_7f3d4ccda5ae, sha256 98636180ebf344400c1918ef92a7bda227653237ebe23a034c8b8839d47adfcf)
BibTeX
@misc{dc7f3d4ccda5ae,
title = {Central Limit Theorem of Maximum Weight Matching on Random Graphs with Prescribed Degrees — arXiv:2609.39219},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39219},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f3d4ccda5ae; sha256 98636180ebf344400c1918ef92a7bda227653237ebe23a034c8b8839d47adfcf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39219. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove an annealed central limit theorem for the weight of the maximum weight matching on uniformly random simple graphs with prescribed, uniformly bounded degrees and i.i.d. exponential edge weights. In particular, the result applies to random $d$-regular graphs for every fixed $d \ge 2$. The proof separates the fluctuations arising from the edge weights from those arising from the graph. The correlation decay estimate of Lam and Sen ( arXiv:2511.18861 ) yields Gaussian fluctuations for the former. The main difficulty is to analyze the fluctuations of the conditional mean of the optimal weight given the graph. To address this, we prove a stronger perturbative correlation decay estimate that, together with a variance bound, reduces the problem to the central limit theorem of Barbour and Röllin [Ann. Appl. Probab. 29(2) (2019)] for local statistics of the configuration model. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.PR). Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.39219 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T14:04:17.207Z dalla pagina https://arxiv.org/catchup/math.PR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).