Summary: Limiting Behavior of Markov Chains with Eager Attractors
Parosh Aziz Abdulla
Uppsala University, Sweden.
parosh@it.uu.se
Noomene Ben Henda
Uppsala University, Sweden.
Noomene.BenHenda@it.uu.se
Richard Mayr
NC State University, USA.
mayr@csc.ncsu.edu
Sven Sandberg
Uppsala University, Sweden.
svens@it.uu.se
Abstract
We consider discrete infinite­state Markov chains
which contain an eager finite attractor. A finite attrac­
tor is a finite subset of states that is eventually reached
with probability 1 from every other state, and the ea­
gerness condition requires that the probability of return­
ing to the attractor in n or more steps is exponentially

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences