Mathematics > Probability
arXiv:2604.20139 (math)
[Submitted on 22 Apr 2026 (v1), last revised 13 Jun 2026 (this version, v2)]
Abstract:We establish the large deviation probabilities for the height of random recursive trees, revealing polynomial upper-tail decay and stretched-exponential lower-tail decay. Remarkably, the lower tail features an atypical prefactor that grows to infinity more slowly than any $n$-fold iterated logarithm.
Submission history
From: Heng Ma [view email]
[v1]
Wed, 22 Apr 2026 03:07:50 UTC (1,357 KB)
[v2]
Sat, 13 Jun 2026 12:36:40 UTC (1,360 KB)
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Code, Data, Media
Code, Data and Media Associated with this Article
Demos
Demos
Related Papers
Recommenders and Search Tools
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

























