pith. sign in

arxiv: 1208.4716 · v1 · pith:J5PBG3XSnew · submitted 2012-08-23 · 🧮 math.PR

The Role of Kemeny's Constant in Properties of Markov Chains

classification 🧮 math.PR
keywords constantkemenymarkovchainfirstgraphsmeanmixing
0
0 comments X
read the original abstract

In a finite state irreducible Markov chain with stationary probabilities \pi_i and mean first passage times m_(ij) (mean recurrence time when i = j) it was first shown by Kemeny and Snell (1960) that \sum_j \pi_j m_(ij) is a constant K, not depending on i. This constant has since become known as Kemeny's constant. A variety of techniques for finding expressions and various bounds for K are derived. 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.