Abstract
We present a short probabilistic proof of a weak convergence result for the number of cuts needed to isolate the root of a random recursive tree. The proof is based on a coupling related to a certain random walk.
Citation
Alex Iksanov. Martin Möhle. "A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree." Electron. Commun. Probab. 12 28 - 35, 2007. https://doi.org/10.1214/ECP.v12-1253
Information
