The CRT is the scaling limit of unordered binary trees

Details The CRT is the scaling limit of unordered binary trees The CRT is the scaling limit of unordered binary trees

2009-02-26

arxiv.org/abs/0902.4570v1

Mathematics

Probability

Scientific paper

We 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.

Affiliated with

Also associated with

No associations

Rating

The CRT is the scaling limit of unordered binary trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The CRT is the scaling limit of unordered binary trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The CRT is the scaling limit of unordered binary trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254327