Open Access
Translator Disclaimer
2007 A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree
Alex Iksanov, Martin Möhle
Author Affiliations +
Electron. Commun. Probab. 12: 28-35 (2007). DOI: 10.1214/ECP.v12-1253

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

Download 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

Accepted: 28 February 2007; Published: 2007
First available in Project Euclid: 6 June 2016

zbMATH: 1133.60012
MathSciNet: MR2407414
Digital Object Identifier: 10.1214/ECP.v12-1253

Subjects:
Primary: 60F05, 60G50
Secondary: 05C05, 60E07

JOURNAL ARTICLE
8 PAGES


SHARE
Back to Top