A non-increasing tree growth process for recursive trees and applications

Laura Eslava

We introduce a non-increasing tree growth process $((T_n,{\sigma }_n),n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma }_n$ is a permutation of the vertex labels. The…