Metraipolis › archive › dc_2d00dd41b6ee
Extremal separation times and clade-count dynamics in fragmentation trees: a freezing transition — arXiv:2609.14325
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14325
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:14:21.749Z
- SHA-256 of the archived text
1f0ab63040d42d0ef9faa658a53dda94fc50f716c5137b4dfa5fe557b60f4ac6- Stable URL of this page
https://metraipolis.com/documento/dc_2d00dd41b6ee
How to cite
Extremal separation times and clade-count dynamics in fragmentation trees: a freezing transition — arXiv:2609.14325 — arXiv (en), https://arxiv.org/abs/2609.14325 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d00dd41b6ee (Metraipolis archive dc_2d00dd41b6ee, sha256 1f0ab63040d42d0ef9faa658a53dda94fc50f716c5137b4dfa5fe557b60f4ac6)
BibTeX
@misc{dc2d00dd41b6ee,
title = {Extremal separation times and clade-count dynamics in fragmentation trees: a freezing transition — arXiv:2609.14325},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14325},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d00dd41b6ee; sha256 1f0ab63040d42d0ef9faa658a53dda94fc50f716c5137b4dfa5fe557b60f4ac6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14325. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Motivated by the continuous-time critical beta-splitting tree, we investigate chronological trees recording the successive block splits and their times in homogeneous fragmentation processes restricted to $n$ labels. The separation time of a subset is the first time its labels cease to lie in a common block. For each fixed integer $q\geq2$, we study extremal separation times of $q$-element subsets via their associated point process. Under mild conditions, as $n\to\infty$, the last such time has a randomly shifted Gumbel limit after deterministic centering. Above a threshold $\theta_*$, the coefficients of both the leading $\log n$ term and the $\log\log n$ correction in the centering become independent of $q$, as does the limiting law up to deterministic translation. The extremal process converges to a randomly shifted Poisson point process, without and with decorations, for $q \le \theta_*$ and $q>\theta_*$ respectively. Finally, in the same centered time window, the number of size-$q$ blocks (clades) converges to a pure-death process for $q\leq\theta_*$, and to a process whose trajectories are non-monotone with positive probability for $q>\theta_*$. 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.14325 — 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.417Z 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).