Hostname: page-component-669899f699-g7b4s Total loading time: 0 Render date: 2025-04-25T20:52:56.217Z Has data issue: false hasContentIssue false
  • English
  • Français

Central limit theorem for the Horton–Strahler bifurcation ratio of general branch order

Part of: Combinatorial probability Graph theory Limit theorems

Published online by Cambridge University Press:  30 November 2017

Ken Yamamoto
Ken Yamamoto*
Affiliation:
University of the Ryukyus
*
* Postal address: Department of Physics and Earth Sciences, Faculty of Science, University of the Ryukyus, Senbaru 1, Nishihara, Okinawa, 903-0213, Japan. Email address: yamamot@sci.u-ryukyu.ac.jp
Get access Rights & Permissions [Opens in a new window]

Abstract

The Horton–Strahler ordering method, originating in hydrology, formulates the hierarchical structure of branching patterns using a quantity called the bifurcation ratio. The main result of this paper is the central limit theorem for the bifurcation ratio of a general branch order. This is a generalized form of the central limit theorem for the lowest bifurcation ratio, which was previously proved. Some useful relations regarding the Horton–Strahler analysis are also derived in the proofs of the main theorems.

Keywords

Central limit theorembinary tree

MSC classification

Primary: 60F05: Central limit and other weak theorems
Secondary: 05C05: Trees 60C05: Combinatorial probability
Type
Research Papers
Information
Journal of Applied Probability , Volume 54 , Issue 4 , December 2017 , pp. 1111 - 1124
Copyright
Copyright © Applied Probability Trust 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Abramowitz, M. and Stegun, I. A. (1964). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. U.S. Government Printing Office, Washington, D.C. Google Scholar
[2] Archibald, J. D. (2014). Aristotle's Ladder, Darwin's Tree: The Evolution of Visual Metaphors for Biological Order. Columbia University Press, New York. Google Scholar
[3] Ball, P. (2011). Branches. Oxford University Press. Google Scholar
[4] Feller, W. (1966). An Introduction to Probability Theory and Its Applications, Vol. II. John Wiley, New York. Google Scholar
[5] Horton, R. E. (1945). Erosional development of streams and their drainage basins; hydrophysical approach to quantitative morphology. Geol. Soc. Amer. Bull. 56, 275–370. CrossRefGoogle Scholar
[6] Knuth, D. E. (1973). The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, MA. Google Scholar
[7] Shreve, R. L. (1967). Infinite topologically random channel networks. J. Geol. 75, 178–186. CrossRefGoogle Scholar
[8] Stanley, R. P. (1999). Enumerative Combinatorics, Vol. 2. Cambridge University Press. Google Scholar
[9] Strahler, A. N. (1957). Quantitative analysis of watershed geomorphology. Trans. Amer. Geophys. Union 38, 913–920. Google Scholar
[10] Tokunaga, E. (1987). Consideration on the composition of drainage networks and their evolution. Geograph. Rep. Tokyo Metropolitan Univ. 13, 1–27. Google Scholar
[11] Wang, S. X. and Waymire, E. C. (1991). A large deviation rate and central limit theorem for Horton ratios. SIAM J. Discrete Math. 4, 575–588. Google Scholar
[12] Werner, C. (1972). Models for Horton's law of stream numbers. Canad. Geographer 16, 50–68. Google Scholar
[13] Yamamoto, K. and Yamazaki, Y. (2008). Formulation and asymptotic properties of the bifurcation ratio in Horton's law for the equiprobable binary tree model. Phys. Rev. E 78, 021114. CrossRefGoogle ScholarPubMed
[14] Yamamoto, K. and Yamazaki, Y. (2010). Topological self-similarity on the random binary-tree model. J. Statist. Phys. 139, 62–71. Google Scholar