Question: Consider a discrete time Markov chain with state space S = {1,2,3,4,5,6} and transition matrix Consider a discrete time Markay chain with state space S
Consider a discrete time Markov chain with state space S = {1,2,3,4,5,6} and transition matrix

Consider a discrete time Markay chain with state space S = | 1, 2, 3, 4, 5, 6, and transition matrix 0. 8 0 0. 5 D = $ 0. 3 0. 4 0 2 0. 1 0 . 1 NOD 0 0. 2 D O.B 0 . 1 $ 0. 4 D $ 0. 5 (a) Draw the transition probability graph associated to this Markay chain . I bj It is known that I is a recurrent state . Identify all other recurrent states . (c) How many recurrence classes are there"! Identify them . I'd; Let (a; 1 1 = 1. 2. ... . O' be the probability that state I is the first recurrent state that you will enter . starting from state i. Determine all the a; I{_. [Flint : First convert recurrent states into absorption states as mentioned in the class lecture notes .\\
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
