Metraipolis › archive › dc_356ebfe5a06b
CLT for the Weight of the Minimum Spanning Arborescence on the Complete Directed Graph — arXiv:2611.00698
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00698
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:46:42.416Z
- SHA-256 of the archived text
f9b9592bf9d7bd0262d6da4314b8f98c27e9a53b8e98e9804914d3184c51ad2f- Stable URL of this page
https://metraipolis.com/documento/dc_356ebfe5a06b
How to cite
CLT for the Weight of the Minimum Spanning Arborescence on the Complete Directed Graph — arXiv:2611.00698 — arXiv (en), https://arxiv.org/abs/2611.00698 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_356ebfe5a06b (Metraipolis archive dc_356ebfe5a06b, sha256 f9b9592bf9d7bd0262d6da4314b8f98c27e9a53b8e98e9804914d3184c51ad2f)
BibTeX
@misc{dc356ebfe5a06b,
title = {CLT for the Weight of the Minimum Spanning Arborescence on the Complete Directed Graph — arXiv:2611.00698},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00698},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_356ebfe5a06b; sha256 f9b9592bf9d7bd0262d6da4314b8f98c27e9a53b8e98e9804914d3184c51ad2f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00698. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The minimum spanning arborescence (MSA) with a fixed boundary, defined on weighted directed graphs, is the directed analogue of the minimum spanning tree (MST). The behaviour of the MSA has been of recent interest and is known to be quite different from that of its undirected counterpart. On the complete directed graph, and for edge weights given by i.i.d. random variables with a broad class of distributions, we prove a Central Limit Theorem for the weight of the MSA with appropriate scaling. While the scaling for the CLT is similar to MST case explored by Janson, the centering required ($1$ as opposed to $\zeta(3)$ for Uniform$[0,1]$ weights) and the limiting variance of the Gaussian ($1$ as opposed to $6\zeta(4)-4\zeta(3)$ for Uniform$[0,1]$ weights) are notably different. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno). Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.00698 — 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-11-03T18:15:07.692Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).