A drainage network with dependence and the Brownian web
From MaRDI portal
Publication:2674347
Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Brownian motion (60J65) Coalescent processes (60J90) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Abstract: We study a system of coalescing random walks on the integer lattice in which the walk is oriented in the -th direction and follows certain specified rules. We first study the geometry of the paths and show that, almost surely, the paths from a graph consisting of just one tree for dimentions and infinitely many disjoint trees for dimensions . Also, there is no bi-infinite path in the graph almost surely for . Subsequently, we prove that for the diffusive scaling of this system converges in distribution to the Brownian web.
Recommendations
- Convergence to the Brownian web for a generalization of the drainage network model
- Hack's law in a drainage network model: a Brownian web approach
- Limit theorems for random spatial drainage networks
- Stochastic flows in the Brownian web and net
- Dynamics of drainage under stochastic rainfall in river networks
- Random oriented trees: a model of drainage networks.
- Scaling limit for a drainage network model
- A broader view of Brownian networks
- The Brownian net
- The equivalence of diffusions on networks to Brownian motion
Cites work
- Applied Probability and Queues
- Collision times of random walks and applications to the Brownian web
- Convergence to the Brownian web for a generalization of the drainage network model
- Density and uniqueness in percolation
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Probability. Theory and examples.
- Random directed forest and the Brownian web
- Random directed trees and forest -- drainage networks with dependence
- Random oriented trees: a model of drainage networks.
- The 2D-directed spanning forest converges to the Brownian web
- The 2D-directed spanning forest is almost surely a tree
- The Brownian Web
- The Brownian web: characterization and convergence
- The true self-repelling motion
- Two-dimensional Poisson trees converge to the Brownian web
Cited in
(9)- Random directed trees and forest -- drainage networks with dependence
- The Brownian web: characterization and convergence
- Random oriented trees: a model of drainage networks.
- Hack's law in a drainage network model: a Brownian web approach
- Scaling limit for a drainage network model
- Convergence to the Brownian web for a generalization of the drainage network model
- Scaling limit for a family of coalescing radial random paths absorbed at the origin
- Two directed non-planar random networks and their scaling limits
- On the convergence of the drainage network with branching
This page was built for publication: A drainage network with dependence and the Brownian web
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674347)