Left and Right Pathlengths in Random Binary Trees
- 106 Downloads
We study the difference between the left and right total pathlengths in a random binary tree. The results include exact and asymptotic formulas for moments and an asymptotic distribution that can be expressed in terms of either the Brownian snake or ISE. The proofs are based on computing expectations for a subcritical binary Galton-Watson tree, and studying asymptotics as the Galton-Watson process approaches a critical one.
KeywordsBinary Tree Asymptotic Formula Internal Node Wiener Index External Node
Unable to display preview. Download preview PDF.