Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

Department of Mathematical Sciences

Seminar Archives

On this page you can find information about seminars in this and previous academic years, where available on the database.

Statistics Seminars: Random Oriented Trees: A Model of Drainage Networks

Presented by Rahul Roy,

11 October 2002 00:00 in CM221

"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 non-uniqueness 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 or 3 and it is an infinite collection of distinct trees for d >=4. In addition, for any dimension, we show that there is no bi-infinite path in the tree.
"

"Indian Statistical Institute, New Delhi"

Contact sunil.chhita@durham.ac.uk for more information