Horton-Strahler ordering of random binary trees
- 1 January 1994
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 27 (2) , 285-293
- https://doi.org/10.1088/0305-4470/27/2/014
Abstract
We study the Horton-Strahler ordering for random binary trees, which are statistically self-similar branching structures. Extending previously obtained results, we show that near the top of these trees, the expected bifurcation ratios tend strongly to the value 4. But at the root of the tree, the expected bifurcation ratio is less than 4, becoming asymptotically a periodic function of log4 n.Keywords
This publication has 8 references indexed in Scilit:
- Matrice de ramification des arbres binairesDiscrete Applied Mathematics, 1991
- On the Order of Random Channel NetworksSIAM Journal on Algebraic Discrete Methods, 1980
- The number of registers required for evaluating arithmetic expressionsTheoretical Computer Science, 1979
- The average number of registers needed to evaluate a binary tree optimallyActa Informatica, 1979
- Infinite Topologically Random Channel NetworksThe Journal of Geology, 1967
- Statistical Law of Stream NumbersThe Journal of Geology, 1966
- Quantitative analysis of watershed geomorphologyEOS, Transactions American Geophysical Union, 1957
- EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGYGSA Bulletin, 1945