Random oriented trees: a model of drainage networks.

DOI10.1214/105051604000000288MaRDI QIDQ1879908zbMATH OpenOpenAlexFDO

Authors Sreela Gangopadhyay, Anish Sarkar, Rahul 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

zbMATH Keywords

central limit theoremmartingalerandom graphrandom walk

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: Consider the d-dimensional lattice Z^d where each vertex is ``open or ``closed with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w satisfy w(d)=v(d)-1. In case of nonuniqueness of such a vertex w, we choose any one of the closest vertices with equal probability and independently of the other random mechanisms. It is shown that this random graph is a tree almost surely for d=2 and 3 and it is an infinite collection of distinct trees for dgeq4. In addition, for any dimension, we show that there is no bi-infinite path in the tree and we also obtain central limit theorems of (a) the number of vertices of a fixed degree u and (b) the number of edges of a fixed length l.

Recommendations

• Random directed trees and forest -- drainage networks with dependence
• Limit theorems for random spatial drainage networks
• Choosing a spanning tree for the integer lattice uniformly
• Random directed forest and the Brownian web
• A drainage network with dependence and the Brownian web

Cites work

• Asymptotics for Euclidean minimal spanning trees on random points
• Choosing a spanning tree for the integer lattice uniformly
• Density and uniqueness in percolation
• Ground-state structure in a highly disordered spin-glass model.
• scientific article; zbMATH DE number 4013703 (Why is no real title available?)
• scientific article; zbMATH DE number 3620754 (Why is no real title available?)
• scientific article; zbMATH DE number 3638844 (Why is no real title available?)
• scientific article; zbMATH DE number 3194856 (Why is no real title available?)
• Models of fractal river basins
• Poisson trees, succession lines and coalescing random walks

Cited in

(19)

• Random directed trees and forest -- drainage networks with dependence
• Point-shift foliation of a point process
• The Brownian web: characterization and convergence
• Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web
• Navigation on a Poisson point process
• The radial spanning tree of a Poisson point process
• Directed, cylindric and radial Brownian webs
• A drainage network with dependence and the Brownian web
• Hack's law in a drainage network model: a Brownian web approach
• Limit theorems for random spatial drainage networks
• Scaling limit for a drainage network model
• Convergence to the Brownian web for a generalization of the drainage network model
• The 2D-directed spanning forest is almost surely a tree
• Semi-Infinite Paths of the Two-Dimensional Radial Spanning Tree
• Scaling limit for a family of coalescing radial random paths absorbed at the origin
• The directed spanning forest in the hyperbolic space
• Two directed non-planar random networks and their scaling limits
• Convergence of the dynamical discrete web to the dynamical Brownian web
• Directed spanning forest for Ginibre ensemble is a tree

This page was built for publication: Random oriented trees: a model of drainage networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879908)