Clairvoyant scheduling of random walks

ABSTRACT

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. About 10 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.

REFERENCES

• 1: P. Balister, B. Bollobas, and A. Stacey. Dependent percolation in two dimensions. Probab. Theory Relat. Fields, 117(4):495--513, 2000.
• 2: Don Coppersmith , Prasad Tetali , Peter Winkler, Collisions among random walks on a graph, SIAM Journal on Discrete Mathematics, v.6 n.3, p.363-374, Aug. 1993 [doi>10.1137/0406029]
• 3: Peter Gács, The Clairvoyant Demon Has a Hard Task, Combinatorics, Probability and Computing, v.9 n.5, p.421-424, September 2000 [doi>10.1017/S0963548300004405]
• 4: P. Gács. Compatible sequences and a slow Winkler percolation. www.arXiv.org/abs/(MATH).PR/0011008, 2000.
• 5: P. Gács. Clairvoyant scheduling of random walks. www.arXiv.org/abs/(MATH).PR/0109152, 2001.
• 6: Peter Winkler, Dependent percolation and colliding random walks, Random Structures & Algorithms, v.16 n.1, p.58-84, Jan.1.2000 [doi>10.1002/(SICI)1098-2418(200001)16:1<58::AID-RSA5>3.0.CO;2-E ]

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS

Keywords:
dependent percolation, distributed computing, scheduling