The CRT is the scaling limit of unordered binary trees

Simple item page
dc.creatorMarckert, Jean-François
dc.creatorMiermont, Grégory
dc.date2009-02-26
dc.date.accessioned2026-07-07T12:47:07Z
dc.date.available2026-07-07T12:47:07Z
dc.descriptionWe prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform plane trees or labeled trees. Our analysis rests on a combinatorial and probabilistic study of appropriate trimming procedures of trees.
dc.identifierhttps://arxiv.org/abs/0902.4570
dc.identifierhttp://arxiv.org/abs/0902.4570
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221607
dc.subjectProbability
dc.titleThe CRT is the scaling limit of unordered binary trees
dc.typetext

Files

Collections

arXiv