Paul Thévenin

Limits of descent-biased trees

We investigate scaling and local limits of random trees biased according to their number of descents. A descent in a rooted labeled tree $t$ is a parent-child pair such that the label of the parent is greater than the label of the child, and the total number of descents is denoted by $\mathrm{des}(t)$. For $n \geq 1$ a...