Sciweavers

RSA
2006

Random cutting and records in deterministic and random trees

14 years 11 days ago
Random cutting and records in deterministic and random trees
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned random labels. Limit theorems are given for this number, in particular when the tree is a random conditioned Galton
Svante Janson
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2006
Where RSA
Authors Svante Janson
Comments (0)