加载中…
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 -fold iterated logarithm.

生成讲解博客的中文版本

生成AI智能校验的中文版本