Abstract
Answering a question by Angel, Holroyd, Martin, Wilson and Winkler [1], we show that the maximal number of non-colliding coupled simple random walks on the complete graph KN, which take turns, moving one at a time, is monotone in N. We use this fact to couple [N/4] such walks on KN, improving the previous Ω(N/log N) lower bound of Angel et al. We also introduce a new generalization of simple avoidance coupling which we call partially ordered simple avoidance coupling, and provide a monotonicity result for this extension as well.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference7 articles.
1. Tetali P. and Winkler P. (1993) Simultaneous reversible Markov chains. In Combinatorics: Paul Erdős is Eighty, Vol. 1, János Bolyai Mathematical Society, pp. 433–451.
2. Shy couplings
3. Avoidance Coupling
4. Clairvoyant scheduling of random walks
5. Shy couplings, $\operatorname{CAT} ({0})$ spaces, and the lion and man
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Avoidance couplings on non‐complete graphs;Random Structures & Algorithms;2021-02-12
2. An Upper Bound on the Size of Avoidance Couplings;Combinatorics, Probability and Computing;2018-12-11