## Abstract

A pair of random walks (R, S) on the vertices of a graph G is successful if two tokens moving one at a time can be scheduled (moving only one token at a time) to travel along R and S without colliding. We consider questions related to P. Winklers clairvoyant demon problem, which asks whether for random walks R and S on G, Pr[(R, S) is successful] > 0. We introduce the notion of an evasive walk on G: a walk S so that for a random walk R on G, Pr[(R, S) is successful] > 0. We characterize graphs G having evasive walks, giving explicit constructions on such G. Also, we show that on a cycle, the tokens must collide quickly with high probability.

Original language | English (US) |
---|---|

Pages (from-to) | 239-248 |

Number of pages | 10 |

Journal | Random Structures and Algorithms |

Volume | 20 |

Issue number | 2 |

DOIs | |

State | Published - Mar 2002 |

## ASJC Scopus subject areas

- Software
- Mathematics(all)
- Computer Graphics and Computer-Aided Design
- Applied Mathematics