title: Geometry of river networks. III. Characterization of component connectivity.
abstract: Essential to understanding the overall structure of river networks is a knowledge of their detailed architecture. Here we explore the presence of randomness in river network structure and the details of its consequences. We first show that an averaged view of network architecture is provided by a proposed self-similarity statement about the scaling of drainage density, a local measure of stream concentration. This scaling of drainage density is shown to imply Tokunaga's law, a description of the scaling of side branch abundance along a given stream, as well as a scaling law for stream lengths. We then consider fluctuations in drainage density and consequently the numbers of side branches. Data are analyzed for the Mississippi River basin and a model of random directed networks. Numbers of side streams are found to follow exponential distributions, as are intertributary distances along streams. Finally, we derive a joint variation of side stream abundance with stream length, affording a full description of fluctuations in network structure. Fluctuations in side stream numbers are shown to be a direct result of fluctuations in stream lengths. This is the last paper in a series of three on the geometry of river networks.
authors: Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA. dodds@segovia.mit.edu
authors: P S
authors: PS
authors: Dodds
authors: D H
authors: DH
authors: Rothman
mesh_terms: D017753:Ecosystem; D005618:Fresh Water; D008962:Models, Theoretical