A drainage network with dependence and the Brownian web

From MaRDI portal
Publication:2674347



Abstract: We study a system of coalescing random walks on the integer lattice mathbbZd in which the walk is oriented in the d-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 d=2,3 and infinitely many disjoint trees for dimensions dgeq4. Also, there is no bi-infinite path in the graph almost surely for dgeq2. Subsequently, we prove that for d=2 the diffusive scaling of this system converges in distribution to the Brownian web.












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)