Abstract
Concerning the Horton-Strahler number (or register function) of binary trees, Yekutieli and Mandelbrot posed the problem of analyzing the bifurcation ratio of the root, which means how many maximal subtrees of register function one less than the whole tree are present in the tree. We show that if all binary trees of size n are considered to be equally likely, then the average value of this number of subtrees is asymptotic to 3.341266+ δ( log 4 n), where an analytic expression for the numerical constant is available and δ(x) is a (small) periodic function of period 1, which is also given explicitly. Additionally, we sketch the computation of the variance and also of higher bifurcation ratios.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
