Geodesic
Left and right length of paths in binary trees or on a question of Knuth
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006).

Voir la notice de l'article provenant de la source Episciences

We consider extended binary trees and study the common right and left depth of leaf $j$, where the leaves are labelled from left to right by $0, 1, \ldots, n$, and the common right and left external pathlength of binary trees of size $n$. Under the random tree model, i.e., the Catalan model, we characterize the common limiting distribution of the suitably scaled left depth and the difference between the right and the left depth of leaf $j$ in a random size-$n$ binary tree when $j \sim \rho n$ with $0< \rho < 1$, as well as the common limiting distribution of the suitably scaled left external pathlength and the difference between the right and the left external pathlength of a random size-$n$ binary tree. 
@article{DMTCS_2006_special_252_a19,
     author = {Panholzer, Alois},
     title = {Left and right length of paths in binary trees or on a question of {Knuth}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities},
     year = {2006},
     doi = {10.46298/dmtcs.3495},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3495/}
}
TY  - JOUR
AU  - Panholzer, Alois
TI  - Left and right length of paths in binary trees or on a question of Knuth
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3495/
DO  - 10.46298/dmtcs.3495
LA  - en
ID  - DMTCS_2006_special_252_a19
ER  - 
%0 Journal Article
%A Panholzer, Alois
%T Left and right length of paths in binary trees or on a question of Knuth
%J Discrete mathematics & theoretical computer science
%D 2006
%V DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3495/
%R 10.46298/dmtcs.3495
%G en
%F DMTCS_2006_special_252_a19
Panholzer, Alois. Left and right length of paths in binary trees or on a question of Knuth. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006). doi : 10.46298/dmtcs.3495. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3495/

Cité par Sources :