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

• Type: Journal
• Year: 2006
• Where: RSA
• Authors: Svante Janson
• Keywords: Random, Rooted Tree, RSA 2006, Tree