Abstract

Abstract Two basically different models have been proposed in order to give a rational explanation of Horton's law of stream numbers: the “cyclic” model and the “random graph” model. In the cyclic model, a “Horton net” must be Hortonian in all its parts, and therefore channels of different (Strahler) order must be hierarchically arranged to form successive “generations” of rivers; in the random graph model, channels join in a completely random fashion, and a “Horton net” is simply a net in which Horton's law of stream numbers is numerically satisfied. In the present paper, these two models have been tested on a large stream population: the Wabash river system, in the continental U.S.A. This network is Hortonian, since the law of stream numbers is numerically satisfied with little scatter; but it shows no structural regularity at all. This seems to be a fairly general case. Therefore, the concept of structural regularity does not have its counterpart in nature; accordingly, the cyclic model does not corres...

Full Text
Paper version not known

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 call

Disclaimer: 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.