Random oriented trees: a model of drainage networks.
From MaRDI portal
Publication:1879908
DOI10.1214/105051604000000288zbMath1047.60098arXivmath/0407118OpenAlexW3099112887MaRDI QIDQ1879908
Sreela Gangopadhyay, Anish Sarkar, Rahul K. Roy
Publication date: 15 September 2004
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0407118
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (16)
Scaling limit for a family of coalescing radial random paths absorbed at the origin ⋮ Hack's law in a drainage network model: a Brownian web approach ⋮ Directed, cylindric and radial Brownian webs ⋮ A drainage network with dependence and the Brownian web ⋮ Convergence to the Brownian web for a generalization of the drainage network model ⋮ The directed spanning forest in the hyperbolic space ⋮ Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web ⋮ Two directed non-planar random networks and their scaling limits ⋮ Navigation on a Poisson point process ⋮ Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree ⋮ The 2D‐directed spanning forest is almost surely a tree ⋮ The radial spanning tree of a Poisson point process ⋮ Point-shift foliation of a point process ⋮ The Brownian web: characterization and convergence ⋮ Limit theorems for random spatial drainage networks ⋮ Scaling Limit for a Drainage Network Model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Density and uniqueness in percolation
- Choosing a spanning tree for the integer lattice uniformly
- Asymptotics for Euclidean minimal spanning trees on random points
- Models of fractal river basins
- Poisson trees, succession lines and coalescing random walks
- Ground-state structure in a highly disordered spin-glass model.
This page was built for publication: Random oriented trees: a model of drainage networks.
