Markov Chains in a Field of Traps


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… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics