Collisions among Random Walks on a Graph

@inproceedings{Karonski1993CollisionsAR,
  title={Collisions among Random Walks on a Graph},
  author={Michal Karonski},
  year={1993}
}
17 There is one further consideration, which leads perhaps to the most intriguing conjecture of all. Let us put two tokens on a graph and let them take random walks, as before; but now suppose the schedule demon is clairvoyant|that is, he can see where each token will go, innnitely far into the future. The question is, with this advantage, can he now keep the tokens apart forever ? Of course we must ask the question in a probabilistic context, since the tokens may e.g. be headed toward each… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 233 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 95 extracted citations

Dependent Percolation and Colliding Random

WalksPeter, Gesche Winkler
2008
View 4 Excerpts
Highly Influenced

Random Walks on Graphs : A SurveyL

Paul Erd
2007
View 8 Excerpts
Highly Influenced

Clairvoyant scheduling of random walks

STOC • 2002
View 4 Excerpts
Highly Influenced

N ov 2 00 0 The Coppersmith-Tetali-Winkler Identity for Mechanical Systems

Andrĕı Kotlov
2000
View 4 Excerpts
Highly Influenced

Random Walks on Graphs: a Survey

Paul Erd
1993
View 8 Excerpts
Highly Influenced

Clairvoyant scheduling of random walks

Random Struct. Algorithms • 2011
View 3 Excerpts
Highly Influenced

Randomized rendezvous with limited memory

ACM Trans. Algorithms • 2011
View 3 Excerpts
Highly Influenced

Centers for Random Walks on Trees

SIAM J. Discrete Math. • 2009
View 7 Excerpts
Highly Influenced

233 Citations

01020'92'98'05'12'19
Citations per Year
Semantic Scholar estimates that this publication has 233 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Random walks and e ective resistance of networks

L. Khachiyan
J . Theoretical Prob . No . • 1991

Conductance and the rapid mixing property for Markov chains : the approximation of the permanent resolved

A. Sinclair
Proc . 20 nd Annual ACM Symposium onTheory of Computing • 1988