Let a Reversible Markov chain start in its Stationary distribution , and let . Define to be the first time an occurrence of has been followed strictly later by an occurrence of :
For each fixed , the event says that the path segment contains before . Reversing that segment changes the event into the existence of before . Stationary reversibility therefore gives for every , so the two completion times have the same distribution.
For a finite irreducible chain, all these expected hitting times are finite. Let and , with . The Strong Markov property at gives . Applying the same argument with reversed yields
If the diagonal is instead defined by the positive mean return time , its contribution to each stationary-weighted mean is one by Kac's lemma. Those equal additions cancel in the displayed difference.

Articles by others on the same topic (0)

There are currently no matching articles.