Hack's law in a drainage network model: a Brownian web approach
From MaRDI portal
Publication:303974
DOI10.1214/15-AAP1134zbMATH Open1344.60017arXiv1501.01382MaRDI QIDQ303974FDOQ303974
Authors: Rahul Roy, Kumarjit Saha, Anish Sarkar
Publication date: 23 August 2016
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Abstract: Hack [Studies of longitudinal stream profiles in Virginia and Maryland (1957). Report], while studying the drainage system in the Shenandoah valley and the adjacent mountains of Virginia, observed a power law relation between the length of a stream from its source to a divide and the area of the basin that collects the precipitation contributing to the stream as tributaries. We study the tributary structure of Howard's drainage network model of headward growth and branching studied by Gangopadhyay, Roy and Sarkar [Ann. Appl. Probab. 14 (2004) 1242-1266]. We show that the exponent of Hack's law is for Howard's model. Our study is based on a scaling of the process whereby the limit of the watershed area of a stream is area of a Brownian excursion process. To obtain this, we define a dual of the model and show that under diffusive scaling, both the original network and its dual converge jointly to the standard Brownian web and its dual.
Full work available at URL: https://arxiv.org/abs/1501.01382
Recommendations
- A drainage network with dependence and the Brownian web
- Convergence to the Brownian web for a generalization of the drainage network model
- Limit theorems for random spatial drainage networks
- Stochastic flows in the Brownian web and net
- Dynamics of drainage under stochastic rainfall in river networks
- Scaling limit for a drainage network model
- A fractal interaction model for winding paths through complex distributions: application to soil drainage networks
- The equivalence of diffusions on networks to Brownian motion
- A diffusion approximation for a network of reservoirs with power law release rule
- Statistical aspects of flow in a random network of channels
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Heavy-Tail Phenomena
- Title not available (Why is that?)
- Martingale Central Limit Theorems
- The true self-repelling motion
- Tail estimates for the Brownian excursion area and other Brownian areas
- An invariance principle for random walk conditioned by a late return to zero
- On a functional central limit theorem for random walks conditioned to stay positive
- Weak convergence to Brownian meander and Brownian excursion
- Functionals of Brownian meander and Brownian excursion
- Reflection and coalescence between independent one-dimensional Brownian paths
- Convergence of coalescing nonsimple random walks to the Brownian web
- The Brownian web: characterization and convergence
- Random oriented trees: a model of drainage networks.
- The Brownian net
- Two-dimensional Poisson trees converge to the Brownian web
- Hack's law in a drainage network model: a Brownian web approach
- Scaling limit for a drainage network model
- Proof of the Van den Berg–Kesten Conjecture
Cited In (8)
- Dynamics of drainage under stochastic rainfall in river networks
- Hack's law in a drainage network model: a Brownian web approach
- Convergence to the Brownian web for a generalization of the drainage network model
- Cycles in random meander systems
- Scaling limit for a drainage network model
- Unimodular Hausdorff and Minkowski dimensions
- A drainage network with dependence and the Brownian web
- The 2D-directed spanning forest converges to the Brownian web
This page was built for publication: Hack's law in a drainage network model: a Brownian web approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q303974)