Journal article
Avoidance Coupling
- 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.
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1214/ECP.v18-2275
Authors
- Journal:
- Electronic Communications in Probability, 18 no. 58, 2013 More from this journal
- Volume:
- 18
- Issue:
- 0
- Pages:
- 1-13
- Publication date:
- 2011-12-14
- DOI:
- EISSN:
-
1083-589X
- ISSN:
-
1083-589X
- Language:
-
English
- Keywords:
- Pubs id:
-
pubs:416538
- UUID:
-
uuid:38f938d1-61eb-4569-9444-fc22190b5b03
- Local pid:
-
pubs:416538
- Source identifiers:
-
416538
- Deposit date:
-
2013-11-17
- ARK identifier:
Terms of use
- Copyright date:
- 2011
- Notes:
- 13 pages, 3 figures
If you are the owner of this record, you can report an update to it here: Report update to this record