Hack's law in a drainage network model: a Brownian web approach
From MaRDI portal
Publication:303974
DOI10.1214/15-AAP1134zbMath1344.60017arXiv1501.01382MaRDI QIDQ303974
Anish Sarkar, Rahul K. Roy, Kumarjit Saha
Publication date: 23 August 2016
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01382
Related Items (4)
Hack's law in a drainage network model: a Brownian web approach ⋮ Cycles in random meander systems ⋮ The 2D-directed spanning forest converges to the Brownian web ⋮ Unimodular Hausdorff and Minkowski dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Hack's law in a drainage network model: a Brownian web approach
- 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
- The true self-repelling motion
- 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
- Scaling Limit for a Drainage Network Model
- Proof of the Van den Berg–Kesten Conjecture
- Heavy-Tail Phenomena
- Martingale Central Limit Theorems
This page was built for publication: Hack's law in a drainage network model: a Brownian web approach