6 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DM2024
Block coupling and rapidly mixing k-heights
Stefan Felsner, Daniel Heldt, Sandro Roch +1
A -height on a graph is an assignment such that the value on ajacent vertices differs by at most . We study the Markov chain on -heights…
math.PR2023
Permutations from Random Walk
Peter E. Francis, Evita Nestoridi, Peter Winkler
Xavier and Yushi run a "random race" as follows. An atomless probability distribution on the real line is chosen. The runners begin at zero. At time Xavier draws $\mathbf{X…
math.PR2011★ 6 cited
Avoidance Coupling
Omer Angel, Alexander E. Holroyd, James Martin +2
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 vertice…