Suppose that, in a Markov chain with just two states, the probabilities of going from state i
Question:
Suppose that, in a Markov chain with just two states, the probabilities of going from state i to state j in one time unit are given by the entries of the matrix
in which i represents the row and j the column. Show that the probability of getting from state i to state j in t time units is given by the tth power of the matrix A and that
Deduce that, irrespective of the state the chain started in, after a long time it will be in the first state with probability 2/s and in the second state with probability 3/5.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: