Kemeny's Constant for Markov Processes

Abstract

The mean time taken by an irreducible Markov chain on a finite state space to hit a target chosen at random according to the stationary distribution does not depend on the initial state of the chain. This mean time is known as Kemeny's constant. I present a new approach, based on time reversal and a mean occupation time formula. The method is used to prove an analogous result for continuous-time Markov processes. We also present a second approach, based on work of N.~Eisenbaum and H.~Kaspi, when all states are regular. Examples are provided.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…