Abstract
In a finite irreducible Markov chain with stationary probabilities {π
i
} and mean first passage times m
ij
(mean recurrence time when i = j) it was first shown, by Kemeny and Snell (Citation1960), that is a constant, K, (Kemeny's constant) not depending on i. A variety of techniques for finding expressions and bounds for K are given. The main interpretation focuses on its role as the expected time to mixing in a Markov chain. Various applications are considered including perturbation results, mixing on directed graphs and its relation to the Kirchhoff index of regular graphs.
Mathematics Subject Classification: