Connectivity properties of random interlacement and intersection of random walks

Details Connectivity properties of random interlacement and intersection of random walks Connectivity properties of random interlacement and intersection of random walks

2010-12-21

arxiv.org/abs/1012.4711v2

ALEA, 2012, 9, 67-83

Mathematics

Probability

minor corrections

Scientific paper

We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least one of these trajectories is the random interlacement at level u of Sznitman arXiv:0704.2560 . We prove that for any u>0, almost surely, (1) any two vertices in the random interlacement at level u are connected via at most ceiling(d/2) trajectories of the point process, and (2) there are vertices in the random interlacement at level u which can only be connected via at least ceiling(d/2) trajectories of the point process. In particular, this implies the already known result of Sznitman arXiv:0704.2560 that the random interlacement at level u is connected.

Affiliated with

Also associated with

No associations

Rating

Connectivity properties of random interlacement and intersection of 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 Connectivity properties of random interlacement and intersection of random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity properties of random interlacement and intersection of random walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-96353