1.
|
Avoidance Coupling
Angel, Omer; University of British Columbia - Holroyd, Alexander E; Microsoft Research - Martin, James; University of Oxford - Winkler, Peter; Dartmouth College - Wilson, David B; Microsoft Research
Formato: |
Peer-reviewed Article |
Enlaces: |
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…
|
Fecha: |
2013-01-03 |
Recurso: |
Electronic communications in probability |
|