Metraipolis › archive › dc_d40597fc0f92
A cube-root phase transition in tree-child networks and the enumeration threshold for galled networks — arXiv:2608.20860
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.20860
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T10:46:55.923Z
- SHA-256 of the archived text
68e89445fe130af6b1d951816cd2870fa442e5e70c0569ada58162f3ec9b8683- Stable URL of this page
https://metraipolis.com/documento/dc_d40597fc0f92
How to cite
A cube-root phase transition in tree-child networks and the enumeration threshold for galled networks — arXiv:2608.20860 — arXiv (en), https://arxiv.org/abs/2608.20860 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d40597fc0f92 (Metraipolis archive dc_d40597fc0f92, sha256 68e89445fe130af6b1d951816cd2870fa442e5e70c0569ada58162f3ec9b8683)
BibTeX
@misc{dcd40597fc0f92,
title = {A cube-root phase transition in tree-child networks and the enumeration threshold for galled networks — arXiv:2608.20860},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.20860},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d40597fc0f92; sha256 68e89445fe130af6b1d951816cd2870fa442e5e70c0569ada58162f3ec9b8683},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.20860. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove two surprising results about phylogenetic networks. First, we show that the structure of tree-child networks with $n$ leaves and $k$ reticulation nodes undergoes a sharp phase transition at $n^{1/3}$: if $k=o(n^{1/3})$, then a random tree-child network is almost surely a semi-simplex tree-child network, whereas if $k/n^{1/3}\rightarrow\infty$ and $k=o(n^{1/2})$, it is almost surely not. Second, we show that this result implies that the asymptotic counting formula for galled networks with $n$ leaves and a fixed number $k$ of reticulation nodes remains valid in the range $k=o(n^{1/3})$, but not beyond. This is in strong contrast to recently established results for the asymptotic counting formulas for tree-child and normal networks with $n$ leaves and $k$ reticulation nodes, which are valid in the (optimal) range $k=o(n^{1/2})$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-24 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.20860 — 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-18T10:39:26.742Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).