uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Random cutting and records in deterministic and random trees
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.
2006 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 29, no 2, 139-179 p.Article in journal (Refereed) Published
Abstract [en]

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-Watson tree. We consider both the distribution when both the tree and the cutting (or labels) are random and the case when we condition on the tree. The proofs are based on Aldous' theory of the continuum random tree.

Place, publisher, year, edition, pages
2006. Vol. 29, no 2, 139-179 p.
National Category
URN: urn:nbn:se:uu:diva-22589DOI: 10.1002/rsa.20086ISI: 000239679900002OAI: oai:DiVA.org:uu-22589DiVA: diva2:50362
Available from: 2007-01-19 Created: 2007-01-19 Last updated: 2011-06-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Janson, Svante
By organisation
Department of Mathematics
In the same journal
Random structures & algorithms (Print)

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 182 hits
ReferencesLink to record
Permanent link

Direct link