Clairvoyant scheduling of random walks

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

86 pages, 24 figures. Additional corrections, this is the version accepted for publication

Scientific paper

Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler asked the question: for which graphs are two independent walks compatible with positive probability. Up to now, no such graphs were found. We show in this paper that large complete graphs have this property. The question is equivalent to a certain dependent percolation with a power-law behavior: the probability that the origin is blocked at distance n but not closer decreases only polynomially fast and not, as usual, exponentially.

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

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

Rate now

     

Profile ID: LFWR-SCP-O-658059

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