Avoidance Coupling

Details Avoidance Coupling Avoidance Coupling

2011-12-14

arxiv.org/abs/1112.3304v1

Mathematics

Probability

12 pages

Scientific paper

We examine the question of whether a collection of random walks on a graph
can be coupled so that they never collide. In particular, we show that on the
complete graph on n vertices, with or without loops, there is a Markovian
coupling keeping apart Omega(n/log n) random walks, taking turns to move in
discrete time.

Affiliated with

Also associated with

No associations

Rating

Avoidance Coupling 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 Avoidance Coupling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoidance Coupling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-228176