A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.
Iksanov, Alex ; Möhle, Martin
Electronic Communications in Probability [electronic only], Tome 12 (2007), p. 28-35 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2007-01-01
EUDML-ID : urn:eudml:doc:128676 
@article{05212970,
     title = {A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.},
     journal = {Electronic Communications in Probability [electronic only]},
     volume = {12},
     year = {2007},
     pages = {28-35},
     zbl = {1133.60012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05212970}
}

Iksanov, Alex; Möhle, Martin. A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.. Electronic Communications in Probability [electronic only], Tome 12 (2007) pp. 28-35. http://gdmltest.u-ga.fr/item/05212970/