Metraipolis › archive › dc_e591c66eeb4d
Infinite-mean Galton-Watson trees have zero random-interchange threshold — arXiv:2610.08149
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08149
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:51:03.383Z
- SHA-256 of the archived text
44672214082aedcad1e346e2c1f0416e32b07bd131f4d98bf3a1ef11760915f5- Stable URL of this page
https://metraipolis.com/documento/dc_e591c66eeb4d
How to cite
Infinite-mean Galton-Watson trees have zero random-interchange threshold — arXiv:2610.08149 — arXiv (en), https://arxiv.org/abs/2610.08149 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e591c66eeb4d (Metraipolis archive dc_e591c66eeb4d, sha256 44672214082aedcad1e346e2c1f0416e32b07bd131f4d98bf3a1ef11760915f5)
BibTeX
@misc{dce591c66eeb4d,
title = {Infinite-mean Galton-Watson trees have zero random-interchange threshold — arXiv:2610.08149},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08149},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e591c66eeb4d; sha256 44672214082aedcad1e346e2c1f0416e32b07bd131f4d98bf3a1ef11760915f5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08149. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that, on a Galton-Watson tree with almost surely finite offspring and infinite offspring mean, the random interchange process has critical parameter zero for infinite cycles, conditionally on survival. Combined with the finite-mean strict inequality established in \emph{ arXiv:2503.03319 }, this gives a dichotomy for locally finite Galton-Watson trees with offspring mean in $(1,\infty]$: the loop and link critical parameters coincide exactly in the infinite-mean case. The proof reduces the tree problem to a finite permutation estimate derived from peeling estimates for random surfaces.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.08149 — 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-07T11:21:39.632Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).