Avoidance Coupling
Probability
2013-07-11 v2
Abstract
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.
Cite
@article{arxiv.1112.3304,
title = {Avoidance Coupling},
author = {Omer Angel and Alexander E. Holroyd and James Martin and David B. Wilson and Peter Winkler},
journal= {arXiv preprint arXiv:1112.3304},
year = {2013}
}
Comments
13 pages, 3 figures