Metraipolis › archive › dc_3d2013d9800c
Fixed forests in the minimum spanning tree and cubic volume growth — arXiv:2608.10654
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.10654
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:26:46.827Z
- SHA-256 of the archived text
d616e7f0f48093752c434ad3a8cd86ca84dd5140e17c12a55f1c9f81eb60cd21- Stable URL of this page
https://metraipolis.com/documento/dc_3d2013d9800c
How to cite
Fixed forests in the minimum spanning tree and cubic volume growth — arXiv:2608.10654 — arXiv (en), https://arxiv.org/abs/2608.10654 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d2013d9800c (Metraipolis archive dc_3d2013d9800c, sha256 d616e7f0f48093752c434ad3a8cd86ca84dd5140e17c12a55f1c9f81eb60cd21)
BibTeX
@misc{dc3d2013d9800c,
title = {Fixed forests in the minimum spanning tree and cubic volume growth — arXiv:2608.10654},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.10654},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d2013d9800c; sha256 d616e7f0f48093752c434ad3a8cd86ca84dd5140e17c12a55f1c9f81eb60cd21},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10654. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $M_n$ be the minimum spanning tree of the complete graph $K_n$ with i.i.d.\ uniform edge weights. For a fixed forest $F$ with connected components $T_1, \ldots, T_d$, we show that there exists a function $\Psi$ on finite trees such that $$ n^{|E(F)|} \mathbb{P}_n(F \subseteq M_n) \longrightarrow \prod_{i=1}^d \Psi(T_i). $$ We give a recursive description of $\Psi$ and calculate it explicitly for several small trees. For the star $S_k$ and the path $P_k$, we prove that $\Psi(S_k) \sim \zeta(2)^k$ and $\Psi(P_k) \sim k^2/12$, respectively. We also show that the expected size of a ball of radius $r$ is asymptotic to $r^3/36$, and give exponential tail bounds.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.10654 — 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-19T06:20:00.079Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).