Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Strahler (1952)
Hypsometric (area-altitude) analysis of erosional topography.Geological Society of America Bulletin, 63
J. Smart (1978)
The analysis of drainage network compositionEarth Surface Processes and Landforms, 3
R. Shreve (1975)
The probabilistic-topologic approach to drainage-basin geomorphologyGeology, 3
R. Shreve (1969)
Stream Lengths and Basin Areas in Topologically Random Channel NetworksThe Journal of Geology, 77
de Bruijn, Bjm Morselt (1967)
A note on plane treesJournal of Combinatorial Theory, Series A, 2
J. Smart (1969)
Topological Properties of Channel NetworksGeological Society of America Bulletin, 80
Richard Jarvis (1977)
Drainage network analysisProgress in Physical Geography, 1
J. Smart, C. Werner (1976)
Applications of the random model of drainage basin compositionEarth Surface Processes and Landforms, 1
J. Robson (1969)
Algorithm 362: generation of random permutations [G6]Commun. ACM, 12
R. Horton (1945)
EROSIONAL DEVELOPMENT OF STREAMS AND THEIR DRAINAGE BASINS; HYDROPHYSICAL APPROACH TO QUANTITATIVE MORPHOLOGYGeological Society of America Bulletin, 56
R. Shreve (1967)
Infinite Topologically Random Channel NetworksThe Journal of Geology, 75
J. Smart, C. Werner (1973)
Some Algorithms for Analyzing Trivalent Planted Trees.
W. James, W. Krumbein (1969)
Frequency Distributions of Stream Link LengthsThe Journal of Geology, 77
D. Barton, H. Gupta, C. Gwyther, J. Miller (1940)
Tables of Partitions.Biometrika, 46
R. Shreve (1974)
Variation of mainstream length with basin area in river networksWater Resources Research, 10
A. Scheidegger (1967)
On the topology of river netsWater Resources Research, 3
R. Shreve (1966)
Statistical Law of Stream NumbersThe Journal of Geology, 74
Shreve's probabilistic‐topologic model for drainage network topology is herein extended and generalized to allow for the presence of lakes. Drainage network topology is represented by an integer string directly analogous to the binary strings used for channel networks without lakes. Validity constraints on integer strings are presented, along with combinatorial results and methods for generating ‘topologically random’ networks. The hypothesis that network element degree and type is independent of position within the integer string leads to good predictions of the relative frequencies of various classes of small subnetworks within a 596‐link network in northern Ontario. For the special case of networks without lakes the model is equivalent to Shreve's.
Water Resources Research – Wiley
Published: Apr 1, 1982
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.