Abstract
We consider a Markov chain on a countable state space, on which is placed a random field of traps, and ask whether the chain gets trapped almost surely. We show that the quenched problem (when the traps are fixed) is equivalent to the annealed problem (when the traps are updated each unit of time) and give a criterion for almost sure trapping versus positive probability of nontrapping. The hypotheses on the Markov chain are minimal, and in particular, our results encompass the results of den Hollander, Menshikov and Volkov (1995).
Similar content being viewed by others
REFERENCE
den Hollander, F., Menshikov, M., and Volkov, S. (1995). Two problems about random walks in a random field of traps. Markov Proc. Rel. Fields 1, 185–202.
Rights and permissions
About this article
Cite this article
Pemantle, R., Volkov, S. Markov Chains in a Field of Traps. Journal of Theoretical Probability 11, 561–569 (1998). https://doi.org/10.1023/A:1022648209343
Issue Date:
DOI: https://doi.org/10.1023/A:1022648209343