In a Markov chain started at a state x, the hitting time τ(y) is the first time that the chain reaches another state y. We study the probability $\mathbb{P}_x(\tau(y) = t)$ that the first visit to y occurs precisely at a given time t. Informally speaking, the event that a new state is visited at a large time t may be considered a ‘surprise’. We prove the following three bounds.

• • In any Markov chain with n states, $\mathbb{P}_x(\tau(y) = t) \le {n}/{t}$.

• • In a reversible chain with n states, $\mathbb{P}_x(\tau(y) = t) \le {\sqrt{2n}}/{t}$ for $t \ge 4n + 4$.

• • For random walk on a simple graph with n ≥ 2 vertices, $\mathbb{P}_x(\tau(y) = t) \le 4e \log(n)/t$.

We construct examples showing that these bounds are close to optimal. The main feature of our bounds is that they require very little knowledge of the structure of the Markov chain.

To prove the bound for random walk on graphs, we establish the following estimate conjectured by Aldous, Ding and Oveis-Gharan (private communication): for random walk on an n-vertex graph, for every initial vertex x,