A combinatorial perspective on the Kemeny constant and more
Luis Fredes, Jean-Fran\c{c}ois Marckert

TL;DR
This paper provides a combinatorial perspective on the Kemeny constant, showing that certain generating functions related to hitting times in Markov chains are independent of initial states, leading to new insights and relations involving moments.
Contribution
It generalizes Kemeny's result by demonstrating the independence of a generating function involving hitting times and determinants from the initial state in Markov chains.
Findings
The generating function sum is independent of the starting state.
Derived relations involving higher moments of hitting times.
Connected determinants to the invariant measure.
Abstract
Let be an irreducible transition matrix on a finite state space . For a Markov chain with transition matrix , let denote the first positive hitting time of by , and the unique invariant measure of . Kemeny proved that if is sampled according to independently of , the expected value of the first positive hitting time of by does not depend on the starting state of the chain: all the values are equal. \par In this paper, we show that this property follows from a more general result: the generating function is independent of the starting state , where is obtained from by deleting the row and column corresponding to the state . The factors appearing in this generating function are:…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
