Random directed forest and the Brownian web

Abstract: Consider the

d

dimensional lattice

m a t h b b Z^{d}

where each vertex is open or closed with probability

p

or

1 - p

respectively. An open vertex

m a t h b b u := (m a t h b b u (1), m a t h b b u (2), ..., m a t h b b u (d))

is connected by an edge to another open vertex which has the minimum

L_{1}

distance among all the open vertices with

m a t h b b x (d) > m a t h b b u (d)

. It is shown that this random graph is a tree almost surely for

d = 2

and 3 and it is an infinite collection of disjoint trees for

d g e q 4

. In addition for

d = 2

, we show that when properly scaled, family of its paths converges in distribution to the Brownian web.

Recommendations

Cited in

(14)

This page was built for publication: Random directed forest and the Brownian web