Random oriented Trees: a Model of drainage networks

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 d\geq4. 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 νand (b) the number of edges of a fixed length l.

Cited by in corpus (8)

• The Brownian web: Characterization and convergence
• The radial spanning tree of a Poisson point process
• The 2d-Directed Spanning Forest is almost surely a tree
• Semi-infinite paths of the 2d-Radial Spanning Tree
• Navigation on a Poisson point process
• Hack's law in a drainage network model: A Brownian web approach
• Limit theorems for random spatial drainage networks
• Transmission and navigation on disordered lattice networks, directed spanning forests and Brownian web