A permuted random walk exits faster

Let $σ$ be a permutation of $\{0,\ldots,n\}$. We consider the Markov chain $X$ which jumps from $k\neq 0,n$ to $σ(k+1)$ or $σ(k-1)$, equally likely. When $X$ is at 0 it jumps to either $σ(0)$ or $σ(1)$ equally likely, and when $X$ is at $n$ it jumps to either $σ(n)$ or $σ(n-1)$, equally likely. We show that the identity permutation maximizes the expected hitting time of n, when the walk starts at 0. More generally, we prove that the hitting time of a random walk on a strongly connected $d$-directed graph is maximized when the graph is the line $[0,n]\cap\Z$ with $d-2$ self-loops at every vertex and $d-1$ self-loops at 0 and $n$.

No reviews yet.

No comments yet.