Abstract
This chapter has been devoted to some selected special discrete-time Markov chains with wide applications including random walk, simple random walk, simple symmetric random walk, Gambler’s ruin problem as a special simple random walk, branching process, hidden Markov chains, time-reversible discrete-time Markov chains, and Markov decision processes. Some illustrative examples and problems have been provided for each special discrete-time Markov chain.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
