Degree distribution in the lower levels of the uniform recursive tree

Ágnes Backhausz, Tamás F. Móri

In this note we consider the $k$th level of the uniform random recursive tree after $n$ steps, and prove that the proportion of nodes with degree greater than $t\log n$ converges t…