Premium
The rotation correspondence is asymptotically a dilatation
Author(s) -
Marckert JeanFrançois
Publication year - 2004
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.10111
Subject(s) - excursion , mathematics , rotation (mathematics) , set (abstract data type) , plane (geometry) , rotation number , brownian motion , binary tree , tree (set theory) , binary number , measure (data warehouse) , struct , combinatorics , geometry , computer science , statistics , arithmetic , database , political science , law , programming language
The rotation correspondence is a map that sends the set of plane trees onto the set of binary trees. In this paper, we first show that when n goes to +∞, the image by the rotation correspondence of a uniformly chosen random plane tree τ with n nodes is close to 2τ (in a sense to be defined). The second part of the paper is devoted to the right and left depth of nodes in binary trees. We show that the empiric measure (suitably normalized) associated with the difference of the right depth and the left depth processes converges to the integrated super Brownian excursion. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004