Article,

Markov chains with almost exponential hitting times

.
Stochastic Processes and their Applications, 13 (3): 305--310 (September 1982)Uses quasistationarity..

Abstract

If a Markov chain converges rapidly to stationarity, then the time until the first hit on a rarely-visited set of states is approximately exponentially distributed; moreover an explicit bound for the error in this approximation can be given. This complements results of Keilson.

Tags

Users

  • @aldousdj
  • @peter.ralph
  • @gwpl

Comments and Reviews