Poisson trees, succession lines and coalescing random walks

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages. Second version with minor corrections

Scientific paper

10.1016/j.anihpb.2003.12.001

We give a deterministic algorithm to construct a graph with no loops (a tree or a forest) whose vertices are the points of a d-dimensional stationary Poisson process S, subset of R^d. The algorithm is independent of the origin of coordinates. We show that (1) the graph has one topological end --that is, from any point there is exactly one infinite self-avoiding path; (2) the graph has a unique connected component if d=2 and d=3 (a tree) and it has infinitely many components if d\ge 4 (a forest); (3) in d=2 and d=3 we construct a bijection between the points of the Poisson process and Z using the preorder-traversal algorithm. To construct the graph we interpret each point in S as a space-time point (x,r)\in\R^{d-1}\times R. Then a (d-1) dimensional random walk in continuous time continuous space starts at site x at time r. The first jump of the walk is to point x', at time r'>r, (x',r')\in S, where r' is the minimal time after r such that |x-x'|<1. All the walks jumping to x' at time r' coalesce with the one starting at (x',r'). Calling (x',r') = \alpha(x,r), the graph has vertex set S and edges {(s,\alpha(s)), s\in S}. This enables us to shift the origin of S^o = S + \delta_0 (the Palm version of S) to another point in such a way that the distribution of S^o does not change (to any point if d = 2 and d = 3; point-stationarity).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Poisson trees, succession lines and coalescing random walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Poisson trees, succession lines and coalescing random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Poisson trees, succession lines and coalescing random walks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-171529

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.