Depth profile of depth-weighted trees with bounded weights

Abstract

We study the depth-weighted random recursive trees introduced by Leckey, Mitsche and Wormald in the case where the weights are bounded from above and from below. We establish the scaling limit of the depth profile of these trees when the weights satisfy a law of large numbers. In particular, we obtain the scaling limit of the depth of these trees, generalising some results of Lichev, Linker, Lodewijks and Mitsche. We also answer negatively a question left open by the same authors, showing that the scaling limit of the depth does not hold in general. Our main tools are appropriately defined martingales combined with the general Edgeworth expansion for the profiles introduced by Kabluchko, Marynych and Sulzbach.