Metraipolis › archive › dc_a34e9fe378ad
The height of discrete-time critical beta-splitting trees — arXiv:2609.14329
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14329
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:14:21.907Z
- SHA-256 of the archived text
d3aa407ac6a9c751772e0d28104313aa2a2c0c04a2f96ee43b877ce4592f35d6- Stable URL of this page
https://metraipolis.com/documento/dc_a34e9fe378ad
How to cite
The height of discrete-time critical beta-splitting trees — arXiv:2609.14329 — arXiv (en), https://arxiv.org/abs/2609.14329 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a34e9fe378ad (Metraipolis archive dc_a34e9fe378ad, sha256 d3aa407ac6a9c751772e0d28104313aa2a2c0c04a2f96ee43b877ce4592f35d6)
BibTeX
@misc{dca34e9fe378ad,
title = {The height of discrete-time critical beta-splitting trees — arXiv:2609.14329},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14329},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a34e9fe378ad; sha256 d3aa407ac6a9c751772e0d28104313aa2a2c0c04a2f96ee43b877ce4592f35d6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14329. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We determine the asymptotic height of the discrete-time critical beta-splitting tree. Let $L_n^*$ denotes the height of the tree with $n$ leaves, defined as the maximum graph distance from the root to a leaf. Then, \[ \frac{L_n^*}{(\log n)^2} \longrightarrow C_{\mathrm{ht}}:=\min_{\theta>1} \frac{\theta}{2\{\psi(\theta)+\gamma\}} \approx 0.976 \] almost surely and in $L^{p}$ for every fixed $p>1$ as $n \to \infty$. Here $\psi$ is the digamma function and $\gamma$ is Euler's constant. This answers \cite[Open Problem~4]{AldousJansonII} of Aldous and Janson.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.14329 — 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-16T00:31:28.419Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).