We show that the convergence of finite state space Markov chains to stationarity can often
be considerably speeded up by alternating every step of the chain with a deterministic move …

Correction to: Speeding up Markov chains with deterministic jumps | SpringerLink Skip to
main content Advertisement SpringerLink Log in Menu Find a journal Publish with us …

We study a permuted random walk process on a graph G. Given a fixed sequence of
permutations on the vertices of G, the permuted random walker alternates between taking …

Given a permutation σ of the integers {− n,− n+ 1,…, n} we consider the Markov chain X σ,
which jumps from k to σ (k±1) equally likely if k≠− n, n. We prove that the expected hitting …

Correction to: Speeding up Markov chains with deterministic jumps Page 1 Vol.:(0123456789)
Probability Theory and Related Fields (2021) 181:377–400 https://doi.org/10.1007/s00440-021-01049-1 …