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

Authors: Jeffrey J. Hunter

Communications in Statistics - Theory and Methods, 43:7, 1309-1321, 2014
arXiv: 1208.4716v1 - DOI (math.PR)
13 pages

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.

Submitted to arXiv on 23 Aug. 2012

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Look for similar papers (in beta version)

By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.