Geometry of river networks. I. Scaling, fluctuations, and deviations.
نویسندگان
چکیده
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 scaling of the length of a subbasin's dominant stream with its area, a characterization of basin shape known as Hack's law. We generalize this relationship to a joint probability density, and provide observations and explanations of deviations from scaling. We show that fluctuations about scaling are substantial, and grow with system size. We find strong deviations from scaling at small scales which can be explained by the existence of a linear network structure. At intermediate scales, we find slow drifts in exponent values, indicating that scaling is only approximately obeyed and that universality remains indeterminate. At large scales, we observe a breakdown in scaling due to decreasing sample space and correlations with overall basin shape. The extent of approximate scaling is significantly restricted by these deviations, and will not be improved by increases in network resolution.
منابع مشابه
Geometry of river networks. III. Characterization of component connectivity.
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...
متن کاملRiver scaling analysis and the BHP universality hypothesis
The XY-model shows in two dimensions in the strong coupling regime a universal distribution, named BHP, which in turn also describes other models of criticality and self-organized criticality and even describes natural data as river level and flow. We start by analysing the two dimensional XY-model and calculate the BHP probability density function. The results obtained for several dissimilar p...
متن کاملGeometry of river networks. II. Distributions of component size and number.
The structure of a river network may be seen as a discrete set of nested subnetworks built out of individual stream segments. These network components are assigned an integral stream order via a hierarchical and discrete ordering method. Exponential relationships, known as Horton's laws, between stream order and ensemble-averaged quantities pertaining to network components are observed. We exte...
متن کاملAnalysis and forecast of Pontic shad (Alosa immaculata) catch in the Danube River
The relationship between the Lower Danube River level and Romanian annual catches of Pontic shad (Alosa immaculata, Bennett 1835) were analyzed. For analysis of long term data on the Danube River water level and Pontic shad catch, combinations of different methods were applied using statistical programs, SPSS 13.0 and MATLAB 6. Periodograms, containing cyclic patterns, were obtained using Fouri...
متن کاملEpidemic extinction in networks: Insights from the 12,110 smallest graphs
We investigate the expected time to extinction in the susceptible-infectious-susceptible (SIS) model of disease spreading. Rather than using stochastic simulations, or asymptotic calculations in network models, we solve the extinction time exactly for all connected graphs with three to eight vertices. This approach enables us to discover scaling relations that would be inaccessible with stochas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 63 1 Pt 2 شماره
صفحات -
تاریخ انتشار 2001