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, and 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] 12 (2007): 28-35. <http://eudml.org/doc/128676>.

@article{Iksanov2007,
author = {Iksanov, Alex, Möhle, Martin},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {random tree; root; delete edges; distribution of the nember of deletion; recursive formula; coupling; limiting distribution; stable law},
language = {eng},
pages = {28-35},
publisher = {University of Washington},
title = {A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.},
url = {http://eudml.org/doc/128676},
volume = {12},
year = {2007},
}

TY - JOUR
AU - Iksanov, Alex
AU - Möhle, Martin
TI - A probabilistic proof of a weak limit law for the number of cuts needed to isolate the root of a random recursive tree.
JO - Electronic Communications in Probability [electronic only]
PY - 2007
PB - University of Washington
VL - 12
SP - 28
EP - 35
LA - eng
KW - random tree; root; delete edges; distribution of the nember of deletion; recursive formula; coupling; limiting distribution; stable law
UR - http://eudml.org/doc/128676
ER -