Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Conclusion
References
All Topics
Mathematics
Probability

Geometry of river networks. I. Scaling, fluctuations, and deviations

Profile image of Peter Sheridan DoddsPeter Sheridan Dodds

2001, Physical review. E, Statistical, nonlinear, and soft matter physics

https://doi.org/10.1103/PHYSREVE.63.016115
visibility

…

description

16 pages

link

1 file

Abstract

This paper is the first in a series of three papers investigating the detailed geometry of river networks. Branching networks are a universal structure employed in the distribution and collection of material. Large-scale river networks mark an important class of two-dimensional branching networks, being not only of intrinsic interest but also a pervasive natural phenomenon. In the description of river network structure, scaling laws are uniformly observed. Reported values of scaling exponents vary, suggesting that no unique set of scaling exponents exists. To improve this current understanding of scaling in river networks and to provide a fuller description of branching network structure, here we report a theoretical and empirical study of fluctuations about and deviations from scaling. We examine data for continent-scale river networks such as the Mississippi and the Amazon and draw inspiration from a simple model of directed, random networks. We center our investigations on the sc...

Related papers

Impacts of surface elevation on the growth and scaling properties of simulated river networks
Rafael Bras

Geomorphology, 2001

We investigate the connection between surface elevation and the growth and scaling of river networks. Three planar Ž . models Scheidegger, Eden, and invasion percolation are first considered. These models develop aggregating networks according to stochastic rules but do not simulate erosion because the network growth is independent of the surface elevation. We show that none of these planar growth models produces scaling results consistent with observations for natural river basins. We then modify the models to include elevation, simulating the effects of fluvial erosion by enforcing the slope-area Ž relationship. The resulting configurations have scaling properties that still depend on the model Scheidegger, Eden, or . invasion percolation but are closer to natural river networks when compared with those from the planar growth rules. We conclude that inclusion of the vertical dimension in these three models is critical for explaining the formation and regularities of fluvial networks. q

View PDFchevron_right
Quantifying Climatic Controls on River Network Branching Structure Across Scales
Sevil Ranjbar

The branching structure of river networks is an important topologic and geomorphic feature that depends on several factors (e.g., climate and tectonics). However, mechanisms that result in such branching patterns in river networks are poorly understood. Observations from natural catchments have revealed controls of climate on drainage density (D d). In this study, we investigate the effects of climatic forcing on river network topology and geometry beyond D d. For this, we selected 26 basins across the United States with equal D d , however, different climate aridity index (defined here as the ratio of mean annual potential evaporation to precipitation). The river networks of these basins were extracted, using a curvature-based method, from high-resolution (1-m) digital elevation models, and several metrics such as width functions, branching angles, and side branching ratio were computed. We used a multiscale entropy approach to quantify the geometric and topologic irregularity and structural richness of these river networks. Our results revealed the systematic impacts of climate forcing on the structure of river networks. We showed that the width functions of dry basins have higher entropy as compared to those of humid basins across spatial scales. Higher entropy suggests more heterogeneity in drainage network of dry basins. This heterogeneity is manifested in channels and their junctions resulting, on an average, in larger junction angle and longer channel links in dry basins compared to humid basins.

View PDFchevron_right
A GIS Numerical Framework to Study the Process Basis of Scaling Statistics in River Networks
Ricardo Mantilla

A new geographic information system (GIS) numerical framework (NF), called CUENCAS, for flows in river networks is presented. The networks are extracted from digital elevation models (DEMs). The program automatically partitions a basin into hillslopes and channel links that are required to correspond to these features in an actual terrain. To investigate the appropriate DEM resolution for this correspondence, we take a high-resolution DEM at 10-m pixel size, and create DEMs at eight different resolutions in increments of 10 m by averaging. The extracted networks from 10-30 m remain about the same, even though there is a tenfold reduction in the number of pixels. By contrast, the extracted networks show increasing distortions of the original network from 40-90 m DEMs. We show the presence of statistical self-similarity (scaling) in the probability distributions of drainage areas in a Horton-Strahler framework using CUENCAS. The NF for flows takes advantage of the hillslope-link decomposition of an actual terrain and specifies mass and momentum balance equations and physical parameterizations at this scale. These equations are numerically solved. An application of NF is given to test different physical assumptions that produce statistical self-similarity in spatial peak flow statistics in a Horton-Strahler framework.

View PDFchevron_right
Critical Nodes in River Networks
Shiblu Sarker

Scientific Reports, 2019

River drainage networks are important landscape features that have been studied for several decades from a range of geomorphological and hydrological perspectives. However, identifying the most vital (critical) nodes on river networks and analyzing their relationships with geomorphic and climatic properties have not yet been extensively addressed in the literature. in this study, we use an algorithm that determines the set of critical nodes whose removal results in maximum network fragmentation and apply it to various topologies of simulated and natural river networks. Specifically, we consider simulated river networks obtained from optimal channel network (ocn) approach as well as extracted networks from several natural basins across the United States. our results indicate a power-law relationship between the number of connected node pairs in the remaining network and the number of removed critical nodes. We also investigate the characteristics of sub-basins resulted from the removal of critical nodes and compare them with those of central nodes (in the context of betweenness centrality) for both natural basins and ocns with varying energy exponent γ to understand vulnerability and resilience of river networks under potential external disruptions. River networks depend on external forcings such as climate and tectonics 1-12 . These dendritic networks serve as primary pathways for transport of sediment, water, and other environmental fluxes and provide necessary ecosystems to a variety of ecologic and biotic activities . However, these networks are facing significant threats under changing climate and anthropogenic activities. Therefore, the knowledge of the topologic structure and dynamics of river networks is crucial for better understanding of their emergence and evolution under change as well for prediction and management of environmental fluxes operating upon them . Branching patterns of river networks have been argued to exhibit complex topology and share similar properties such as scaling and self-similarity with other complex systems . Recent theoretical and empirical evidences suggest that branching complexity is a key to maintaining meta-population stability and in driving biodiversity patterns . A common way to quantify network complexity is via graph-theoretical approaches that have been used extensively in characterizing networks from diverse fields including but not limited to social networks, transportation networks, communication networks, and networks from computer science and mathematics . Although there are many different approaches for quantifying node importance (see, e.g., Borgatti 36 ), in this study we focus on the one which is based on the effect of node removal to the network structure. The corresponding problem is known as the critical node detection problem (see Lalou et al. for a more detailed discussion on this topic). Specifically, we consider the number of connected pairs of nodes in the remaining network as a measure of "integrity" or "connectivity" of river networks and find the set of nodes whose removal minimizes this measure. Despite significant research on river network characterization using graph theory , to the best of our knowledge, there are no previous studies that focus on critical node identification on river network topologies. As a solution approach for finding exact locations of critical nodes, we use the linear integer programming problem formulation developed in Veremyev et al. due to its simplicity of implementation and effectiveness on the considered networks. In addition, since all river networks investigated here are trees, we demonstrate that the considered critical node identification problem is equivalent to the problem of finding a group of nodes with the highest group betweenness centrality 42 , which can be interpreted as a quantitative measure of the role of a group of nodes as intermediaries in the process monitoring and control of flow in a network . Note that, as discussed in more detail below, there is a difference between the related notions of the highest group betweenness centrality and a group of nodes where each node has a high "individual" betweenness centrality. Therefore, we distinguish the concepts of "critical" and "central" nodes throughout the paper. We investigate the locations of the most influential nodes obtained from both critical nodes and central nodes approaches and their role on the generation of sub-basins via fragmentation of river network topology for various simulated and real river networks.

View PDFchevron_right
Network Disturbance Theory: Spatial and Temporal Organization of Physical Heterogeneity in Rivers
Thomas Dunne, George Pess, Michael Pollock

2003

Hierarchical and branching river networks interact with dynamic watershed disturbances, such as fires, storms, and floods, to impose a spatial and temporal organization on the nonuniform distribution of riverine habitats, with consequences for biological diversity and productivity. Abrupt changes in water and sediment flux occur at channel confluences in river networks and trigger changes in channel and floodplain morphology. This observation, when taken in the context of a river network as a population of channels and their confluences, allows the development of testable predictions about how basin size, basin shape, drainage density, and network geometry interact to regulate the spatial distribution of physical diversity in channel and riparian attributes throughout a river basin. The spatial structure of river networks also regulates how stochastic watershed disturbances influence the morphology and ages of fluvial features found at confluences.

View PDFchevron_right
Constructal view of scaling laws of river basins
Antonio Heitor Reis

Geomorphology, 2006

River basins are examples of naturally organized flow architectures whose scaling properties have been noticed long ago. Based on data of geometric characteristics, Horton [Horton, R.E., 1932. Drainage basin characteristics. EOS Trans. AGU 13, 350–361.], Hack [Hack, J.T., 1957. Studies of longitudinal profiles in Virginia and Maryland. USGS Professional Papers 294-B, Washington DC, pp. 46–97.], and Melton [Melton, M.A, 1958. Correlation structure of morphometric properties of drainage systems and their controlling agents. J. of Geology 66, 35–56.] proposed scaling laws that are considered to describe rather accurately the actual river basins. What we show here is that these scaling laws can be anticipated based on Constructal Theory, which views the pathways by which drainage networks develop in a basin not as the result of chance but as flow architectures that originate naturally as the result of minimization of the overall resistance to flow (Constructal Law).

View PDFchevron_right
Evolution and selection of river networks: statics, dynamics, and complexity
Riccardo Rigon

Proceedings of the National Academy of Sciences of the United States of America, 2014

Moving from the exact result that drainage network configurations minimizing total energy dissipation are stationary solutions of the general equation describing landscape evolution, we review the static properties and the dynamic origins of the scale-invariant structure of optimal river patterns. Optimal channel networks (OCNs) are feasible optimal configurations of a spanning network mimicking landscape evolution and network selection through imperfect searches for dynamically accessible states. OCNs are spanning loopless configurations, however, only under precise physical requirements that arise under the constraints imposed by river dynamics--every spanning tree is exactly a local minimum of total energy dissipation. It is remarkable that dynamically accessible configurations, the local optima, stabilize into diverse metastable forms that are nevertheless characterized by universal statistical features. Such universal features explain very well the statistics of, and the linkag...

View PDFchevron_right
Physical basis of statistical scaling in peak flows and stream flow hydrographs for topologic and spatially embedded random self-similiar channel networks
Ricardo Mantilla

As I have mentioned, the isolated man does not develop any intellectual power. It is necessary for him to be immersed in an environment of other men, whose techniques he absorbs during the first [thirty] years of his life. He may then perhaps do a little research of his own and make a very few discoveries which are passed on to other men. From this point of view the search for new techniques must be regarded as carried out by the human community as a whole, rather than by individuals." ALAN TURING I wish to express my most sincere thanks to my major professor Vijay Gupta who guided this work and supported my pursue of new ideas. I also wish to thank to the members of my committee Hari Rajaram, Bob Grossman, Balaji Rajagopalan and Brent Troutman for their comments and help. To the members of the group that collaborated and helped me during my dissertation Peter Furey and Seth Veitzer. I want to extend my deepest appreciation for the insightful discussions with Brent Troutman and Oscar Mesa. I wish to thank Jason Kean and Jordan Clayton for the data on Hydraulic Geometry that they shared with me. I will always feel very fortunate of having share time with such an amazing group of people. This research was supported by grants from National Science Foundation. This support is gratefully acknowledged. Finally I want thank Bruce Kindel who help me with his editorial and scientific comments. vi

View PDFchevron_right
Probabilistic structure of the distance between tributaries of given size in river networks
Matteo Convertino

2007

We analyze the distribution of the distances between tributaries of a given size (or of sizes larger than a given area) draining along either an open boundary or the mainstream of a river network. By proposing a description of the distance separating prescribed merging contributing areas, we also address related variables, like mean (or bankfull) flow rates and channel and riparian area widths, which are derived under a set of reasonable hydrologic assumptions.

View PDFchevron_right
A reformulation of Horton's Laws for large river networks in terms of statistical self‐similarity
Scott Peckham

Water Resources Research, 1999

The well‐known Norton's laws are empirical observations on how the means of measurements for river networks and basins vary with Horton‐Strahler order. It is now known that these laws are a consequence of an average‐sense self‐similarity in the bifurcation structure of river networks. In this paper we present a reformulation of Horton's laws which generalizes the familiar scaling of first moments, or means, to scaling of entire distributions. We also present extensive data analysis which supports this reformulation and show that this feature is also exhibited by Shreve's well‐known random topology model.

View PDFchevron_right

References (69)

  1. † Author to whom correspondence should be addressed; Electronic address: dodds@segovia.mit.edu; URL: http://segovia. mit.edu/ ‡ Electronic address: dan@segovia.mit.edu
  2. R. Albert, H. Jeong, and A.-L. Barabasi, Nature 401(6749), 130 (1999).
  3. D. J. Watts and S. J. Strogatz, Nature 393, 440 (1998).
  4. M. Zamir, J. Theor. Biol. 197, 517 (1999).
  5. S. N. Coppersmith, C.-h. Liu, S. Majumdar, O. Narayan, and T. A. Witten, Phys. Rev. E 53(5), 4673 (1996).
  6. C. Cherniak, M. Changizi, and D. Kang, Phys. Rev. E 59(5) (1999).
  7. B. B. Mandelbrot, The Fractal Geometry of Nature (Freeman, San Francisco, 1983).
  8. I. Rodríguez-Iturbe and A. Rinaldo, Fractal River Basins: Chance and Self-Organization (Cambridge University Press, Great Britain, 1997).
  9. A. Rinaldo, I. Rodríguez-Iturbe, and R. Rigon, Annu. Rev. Earth Planet. Sci 26, 289 (1998).
  10. P. Ball, The Self-Made Tapestry (Oxford, UK, 1998).
  11. P. S. Dodds and D. H. Rothman, Annu. Rev. Earth Planet. Sci. 28, 571 (2000).
  12. J. T. Hack, U.S. Geol. Surv. Prof. Pap. 294-B, 45 (1957).
  13. A. Maritan, A. Rinaldo, R. Rigon, A. Giacometti, and I. Rodríguez-Iturbe, Phys. Rev. E 53(2), 1510 (1996).
  14. R. Rigon, I. Rodríguez-Iturbe, A. Maritan, A. Gia- cometti, D. G. Tarboton, and A. Rinaldo, Water Resour. Res. 32(11), 3367 (1996).
  15. H. Jaeger, S. Nagel, and R. Behringer, Rev. Mod. Phys. 68(4), 1259 (1996).
  16. L. Kadanoff, Rev. Mod. Phys. 71(1), 435 (1999).
  17. T. R. Smith and F. P. Bretherton, Water Resour. Res. 3(6), 1506 (1972).
  18. S. Kramer and M. Marder, Phys. Rev. Lett. 68(2), 205 (1992).
  19. N. Izumi and G. Parker, Journal of Fluid Mechanics 283, 341 (1995).
  20. K. Sinclair and R. C. Ball, Phys. Rev. Lett. 76(18), 3360 (1996).
  21. J. R. Banavar, F. Colaiori, A. Flammini, A. Gia- cometti, A. Maritan, and A. Rinaldo, Phys. Rev. Lett. 78, 4522 (1997).
  22. E. Somfai and L. M. Sander, Phys. Rev. E 56(1), R5 (1997).
  23. R. Pastor-Satorras and D. H. Rothman, Phys. Rev. Lett. 80(19), 4349 (1998).
  24. R. Pastor-Satorras and D. H. Rothman, J. Stat. Phys. 93, 477 (1998).
  25. M. Cieplak, A. Giacometti, A. Maritan, A. Rinal- do, I. Rodríguez-Iturbe, and J. R. Banavar, J. Stat. Phys. 91(1/2), 1 (1998).
  26. A. Giacometti, Local minimal energy landscapes in river networks (2000), preprint.
  27. H. Takayasu and H. Inaoka, Phys. Rev. Lett. 68(7), 966 (1992).
  28. R. L. Leheny, Phys. Rev. E 52(5), 5610 (1995).
  29. G. Caldarelli, A. Giacometti, A. Maritan, I. Rodríguez-Iturbe, and A. Rinaldo, Phys. Rev. E 55(5), 4865 (1997).
  30. C. P. Stark, Nature 352, 405 (1991).
  31. T. Sun, P. Meakin, and T. Jøssang, Phys. Rev. E 49(6), 4865 (1994).
  32. T. Sun, P. Meakin, and T. Jøssang, Phys. Rev. E 51(6), 5353 (1995).
  33. L. B. Leopold and W. B. Langbein, U.S. Geol. Surv. Prof. Pap. 500-A, 1 (1962).
  34. A. E. Scheidegger, Bull. Int. Assoc. Sci. Hydrol. 12(1), 15 (1967).
  35. S. S. Manna and B. Subramanian, Phys. Rev. Lett. 76(18), 3460 (1996).
  36. A. Maritan, F. Colaiori, A. Flammini, M. Cieplak, and J. R. Banavar, Science 272, 984 (1996).
  37. P. S. Dodds and D. H. Rothman, Geometry of River Networks II: Distributions of Component Size and Number (2000), submitted to PRE.
  38. P. S. Dodds and D. H. Rothman, Geometry of River Networks III: Characterization of Component Con- nectivity (2000), submitted to PRE.
  39. R. E. Horton, Bull. Geol. Soc. Am 56(3), 275 (1945).
  40. P. S. Dodds and D. H. Rothman, Phys. Rev. E 59(5), 4865 (1999), cond-mat/9808244.
  41. E. Tokunaga, Geophys. Bull. Hokkaido Univ. 15, 1 (1966).
  42. E. Tokunaga, Geogr. Rep., Tokyo Metrop. Univ. 13, 1 (1978).
  43. E. Tokunaga, Trans. Jpn. Geomorphol. Union 5(2), 71 (1984).
  44. D. M. Gray, J. Geophys. Res. 66(4), 1215 (1961).
  45. J. E. Mueller, Geological Society of America Bulletin 83, 3471 (1972).
  46. M. P. Mosley and R. S. Parker, Geological Society of America Bulletin 84, 3123 (1973).
  47. J. E. Mueller, Geological Society of America Bulletin 84, 3127 (1973).
  48. D. R. Montgomery and W. E. Dietrich, Science 255, 826 (1992).
  49. R. Rigon, I. Rodríguez-Iturbe, and A. Rinalod, Water Resour. Res. 34(11), 3181 (1998).
  50. The topography used to extract areas and stream lengths is a composite of United States Geologi- cal Survey three-arc-second digital elevation models available on the Internet at www.usgs.gov. These datasets provide grids of elevation data with hor- izontal resolution on the order of 90 meters. The Kansas river was analyzed directly from the data while the Mississippi basin was studied on a coarse- grained version with horizontal resolution of approx- imately 1000 meters.
  51. D. G. Tarboton, R. L. Bras, and I. Rodríguez-Iturbe, Water Resour. Res. 26(9), 2243 (1990).
  52. H. Takayasu, I. Nishikawa, and H. Tasaki, Phys. Rev. A 37(8), 3110 (1988).
  53. P. Meakin, J. Feder, and T. Jøssang, Physica A 176, 409 (1991).
  54. G. Huber, Physica A 170, 463 (1991).
  55. D. Dhar and S. N. Majumdar, J. Phys. A: Math. Gen. 23, 4333 (1990).
  56. D. Dhar, Physica A 186, 82 (1992).
  57. D. Dhar, Physica A 263, 4 (1999).
  58. W. Feller, An Introduction to Probability Theory and Its Applications, vol. I (John Wiley & Sons, New York, 1968), third ed.
  59. W. Feller, An Introduction to Probability Theory and Its Applications, vol. II (John Wiley & Sons, New York, 1968), third ed.
  60. The data for the Nile and Congo was obtained from the United States Geological Survey's 30-arc-second Hydro1K dataset which may be accessed on the Internet at edcftp.cr.usgs.gov. Note that these Hydro1K datasets have undergone the extra process- ing of projection onto a uniform grid.
  61. The dataset used for the Amazon has a horizontal resolution of approximately 1000 meters and comes from 30 arc second terrain data provided by the National Imagery and Mapping Agency available on the Internet at www.nima.mil.
  62. W. Dietrich and D. Montgomery, in Scale Depen- dence and Scale Invariance in Hydrology, edited by G. Sposito (Cambridge University Press, Cambridge, United Kingdom, 1998), pp. 30-60.
  63. W. E. Dietrich and T. Dunne, in Channel Network Hydrology, edited by K. Beven and M. Kirkby (John Wiley & Sons Ltd, New York, 1993), chap. 7, pp. 175-219.
  64. A. N. Strahler, EOS Trans. AGU 38(6), 913 (1957).
  65. S. A. Schumm, Bull. Geol. Soc. Am 67, 597 (1956).
  66. S. Peckham and V. Gupta, Water Resour. Res. 35(9), 2763 (1999).
  67. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C (Cambridge University Press, 1992), second ed.
  68. E. L. Lehman, Nonparametrics : statistical methods based on ranks (Holden-Day, San Francisoc, 1975).
  69. P. Sprent, Applied Nonparametric Statistical Meth- ods (Chapman & Hall, New York, 1993), second ed.

Related papers

Unified view of scaling laws for river networks
Peter Sheridan Dodds

Physical Review E, 1999

Scaling laws that describe the structure of river networks are shown to follow from three simple assumptions. These assumptions are ͑1͒ river networks are structurally self-similar, ͑2͒ single channels are self-affine, and ͑3͒ overland flow into channels occurs over a characteristic distance ͑drainage density is uniform͒.W e obtain a complete set of scaling relations connecting the exponents of these scaling laws and find that only two of these exponents are independent. We further demonstrate that the two predominant descriptions of network structure ͑Tokunaga's law and Horton's laws͒ are equivalent in the case of landscapes with uniform drainage density. The results are tested with data from both real landscapes and a special class of random networks.

View PDFchevron_right
Scaling and elevation in river networks
Rafael Bras

Water Resources Research, 1989

The analysis of large fiver networks obtained from digital elevation models has given insight into the variation of channel slope with scale. Investigators have recently suggested that channel slopes are self-similar with magnitude or area as a scaling parameter. Our data indicates otherwise; in particular, the variance of channel slope is larger than that predicted by simple self-similarity. This suggests multiscaling. The scaling exponent for the standard deviation is approximately half the corresponding exponent in the relationship of the slope mean to magnitude or area. A model for channel slopes based on a point process of elevation drops along the channel is presented. The model reproduces observed multiscaling properties when the density of elevation increments is related to area (or magnitude) as A-0. 1. Zhang, Y., Plotting positions of annual flood extremes considering extraordinary values, Water Resour. Res., 18(4), 859-864, 1982.

View PDFchevron_right
Simple statistical models for river networks
Jens Feder, Paul Meakin, Torstein Jøssang

Physica A: Statistical Mechanics and its Applications, 1991

The geometric scaling properties associated with simple river network models have been studied using computer simulations. In these models the river networks arc comprised of random trajectories which start at randomly selected positions on a square lattice and continue until they either reach an edge of the lattice or join a previous trajectory to form a branched network. For those cases where the trajectories are either self-avoiding random walks (SAWS) or indefinitely growing self-avoiding walks (IGSAWs) the river basins are compact but have fractal basin boundaries with a dimensionality near to 514. For the IGSAW model the longest river is a self-similar fractal with a fractal dimensionality close to or equal to that of the IGSAW itself. If the trajectory is a directed walk. then the model is very similar to the Scheidegger river network model. In this case the basin boundary and the longest channei are self-affine Brownian processes. The resuhs ohtaincd from the IGSAW and directed walk models can be dcsxibed in terms of a simple scaling model. For the SAW models this scaling picture does not apply and it appears that practical simulations are far from the asymptotic (large system size) limit.

View PDFchevron_right
A transition from river networks to scale-free networks
anjan nandi

New Journal of Physics, 2007

A spatial network is constructed on a two dimensional space where the nodes are geometrical points located at randomly distributed positions which are labeled sequentially in increasing order of one of their coordinates. Starting with N such points the network is grown by including them one by one according to the serial number into the growing network. The t-th point is attached to the i-th node of the network using the probability: πi(t) ∼ ki(t)ℓ α ti where ki(t) is the degree of the i-th node and ℓti is the Euclidean distance between the points t and i. Here α is a continuously tunable parameter and while for α = 0 one gets the simple Barabási-Albert network, the case for α → −∞ corresponds to the spatially continuous version of the well known Scheidegger's river network problem. The modulating parameter α is tuned to study the transition between the two different critical behaviors at a specific value αc which we numerically estimate to be-2.

View PDFchevron_right
Analysis of Spatial Variability of River Network Morphology, Flow and Potential Energy
Renzo Rosso

Entropy and Energy Dissipation in Water Resources, 1992

Spatial variability of morphological characteristics and flow in river networks, and its relation to power distribution are analytically and empirically investigated. It is assumed, and positively tested, that Horton-type laws describe the downstream change in link morphological and topological characteristics. Accordingly, surrogates to the traditional stream length and area ratios are provided by the link number ratio, and the total link number ratio, respectively. The opposite statistical behaviour of stream and link length, as being dependent and independent variables, respectively, is found to be reversed in the case of link and stream heights. This property leads to an identical trend in the spatial variability of slope in both cases. On the other hand, assessment the of the self-similar model of link altitudinal geometry [Gupta & Waymire, 1989] reveals that previous testing, upon which the model has been refuted by Tarboton et al. [1989] was inadequately performed. However, our results show an increasing structured departure from simple-scaling for the n-th order moments. Finally, using Horton-type laws for height and flow yields the distribution of power to be characterized by a state of maximum spatial uniformity for a given flow quantile, for which the scaling exponent of mean link slope equals the one that describes mean flow pattern. This result is found to be implicitly explained by using the informational entropy principles as introduced by Kapoor [1990] for river networks.

View PDFchevron_right

Related topics

  • Engineering
  • Random Networks
  • Scaling Law

    • Cited by

    Global carbon dioxide emissions from inland waters
    Robert Striegl

    Nature, 2013

    Carbon dioxide (CO 2 ) transfer from inland waters to the atmosphere, known as CO 2 evasion, is a component of the global carbon cycle. Global estimates of CO 2 evasion have been hampered, however, by the lack of a framework for estimating the inland water surface area and gas transfer velocity and by the absence of a global CO 2 database. Here we report regional variations in global inland water surface area, dissolved CO 2 and gas transfer velocity. We obtain global CO 2 evasion rates of 1.8 10.25 20.25 petagrams of carbon (Pg C) per year from streams and rivers and 0.32 10.52 20.26 Pg C yr 21 from lakes and reservoirs, where the upper and lower limits are respectively the 5th and 95th confidence interval percentiles. The resulting global evasion rate of 2.1 Pg C yr 21 is higher than previous estimates owing to a larger stream and river evasion rate. Our analysis predicts global hotspots in stream and river evasion, with about 70 per cent of the flux occurring over just 20 per cent of the land surface. The source of inland water CO 2 is still not known with certainty and new studies are needed to research the mechanisms controlling CO 2 evasion globally.

    View PDFchevron_right
    Optimal Form of Branching Supply and Collection Networks
    Peter Sheridan Dodds

    Physical Review Letters, 2010

    For the problem of efficiently supplying material to a spatial region from a single source, we present a simple scaling argument based on branching network volume minimization that identifies limits to the scaling of sink density. We discuss implications for two fundamental and unresolved problems in organismal biology and geomorphology: how basal metabolism scales with body size for homeotherms and the scaling of drainage basin shape on eroding landscapes. PACS numbers: 89.75.Fb,89.75.Hc,92.40.Gc In both natural and man-made systems, branching networks universally facilitate the essential task of supplying material from a central source to a widely distributed sink population. Branching networks also underlie the complementary process of collecting material from many sources at a single sink. Such networks typically exhibit structural self-similarity over many orders of magnitude: river networks drain continents [1, 2, 3], arterial and venal networks move blood between the macroscopic heart and microscopic capillaries , and trees and plants orient leaves in space taking on the roles of both structure and transportation.

    View PDFchevron_right
    Packing-limited growth of irregular objects
    Peter Sheridan Dodds

    Physical Review E, 2003

    We study growth limited by packing for irregular objects in two dimensions. We generate packings by seeding objects randomly in time and space and allowing each object to grow until it collides with another object. The objects we consider allow us to investigate the separate effects of anisotropy and nonunit aspect ratio. By means of a connection to the decay of pore-space volume, we measure power law exponents for the object size distribution. We carry out a scaling analysis, showing that it provides an upper bound for the size distribution exponent. We find that while the details of the growth mechanism are irrelevant, the exponent is strongly shape dependent. Potential applications lie in ecological and biological environments where sessile organisms compete for limited space as they grow.

    View PDFchevron_right
    Statistical mechanics of complex networks
    Albert Diaz-Guilera, Miguel Rubi, Ricard SOLÉ

    Reviews of Modern Physics, 2002

    Complex networks describe a wide range of systems in nature and society. Frequently cited examples include the cell, a network of chemicals linked by chemical reactions, and the Internet, a network of routers and computers connected by physical links. While traditionally these systems have been modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks are governed by robust organizing principles. This article reviews the recent advances in the field of complex networks, focusing on the statistical mechanics of network topology and dynamics. After reviewing the empirical data that motivated the recent interest in networks, the authors discuss the main models and analytical tools, covering random graphs, small-world and scale-free networks, the emerging theory of evolving networks, and the interplay between topology and the network's robustness against failures and attacks.

    View PDFchevron_right
    Scaling behaviour of braided active channels: a Taylor’s power law approach
    Carmine Fallico

    The European Physical Journal Plus

    At a channel (reach) scale, braided channels are fluvial, geomorphological, complex systems that are characterized by a shift of bars during flood events. In such events water flows are channeled in multiple and mobile channels across a gravel floodplain that remain in unmodified conditions. From a geometrical point of view, braided patterns of the active hydraulic channels are characterized by multicursal nature with structures that are spatially developed by either simple- and multi-scaling behavior. Since current studies do not take into account a general procedure concerning scale measurements, the latter behavior is still not well understood. The aim of our investigation is to analyze directly, through a general procedure, the scaling behavior of hydraulically active channels per transect and per reach analyzed. Our generalized stochastic approach is based on Taylor’s law, and the theory of exponential dispersion distributions. In particular, we make use of a power law, based o...

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved