Limiting Behavior of Markov Chains with Eager Attractors

Abstract

We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with probability 1 from every other state, and the eagerness condition requires that the probability of avoiding the attractor in n or more steps after leaving it is exponentially bounded in n… (More)
DOI: 10.1109/QEST.2006.24

Topics

  • Presentations referencing similar topics