Depth properties of scaled attachment random recursive trees

We study depth properties of a general class of random recursive trees where each node i attaches to the random node iX_i and X_0, ..., X_n is a sequence of i.i.d. random variables taking values in [0,1). We call such trees scaled attachment random recursive trees (SARRT). We prove that the typical depth D_n, the maximum depth (or height) H_n and the minimum depth M_n of a SARRT are asymptotically given by D_n \sim μ^{-1} \log n, H_n \sim α_{\max} \log n and M_n \sim α_{\min} \log n where μ, α_{\max} and α_{\min} are constants depending only on the distribution of X_0 whenever X_0 has a density. In particular, this gives a new elementary proof for the height of uniform random recursive trees H_n \sim e \log n that does not use branching random walks.

No reviews yet.

No comments yet.