Robin Pemantle, Stanislav Volkov
Published 1997-01-23Version 1
A general criterion is given for when a Markov chain trapped with probability p(x) in state x will be almost surely trapped. The quenched (state x is a trap forever with probability p(x)) and annealed (state x traps with probability p(x) on each visit) problems are shown to be equivalent.
Surprise probabilities in Markov chains
Doob-Martin compactification of a Markov chain for growing random words sequentially
Limit theorems for additive functionals of a Markov chain
![QR code for arXiv:math/9701223 [math.PR]](http://oss.arxitics.com/images/favicon.svg)