Advertisement
Published in:
2015 | OriginalPaper | Chapter
5. Reducible Markov Chains
Author : Fayez Gebali
Published in: Analysis of Computer Networks
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Reducible Markov chains describe systems that have particular states such that once we visit one of those states, we cannot visit other states. An example of systems that can be modeled by reducible Markov chains is games of chance where once the gambler is broke, the game stops and the casino either kicks him out or gives him some compensation (comp). The gambler moved from being in a state of play to being in a comp state and the game stops there.