Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Chen, Xinxin, Ma, Heng
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funder: Shandong University
OpenAlex ID: W7155411105
Cites:
Cited by:
Related to: