Question

An absorbing Markov Chain has 5 states where states #1 and #2 are absorbing states and the following transition probabilities are known: p3,2=0.1,   p3,   3=0.4,    p3,5=0.5 p4,1=0.1,   p4,3=0.5,   ...

An absorbing Markov Chain has 5 states where states #1 and #2 are absorbing states and the following transition probabilities are known:

p3,2=0.1,   p3,   3=0.4,    p3,5=0.5

p4,1=0.1,   p4,3=0.5,    p4,4=0.4

p5,1=0.3,    p5,2=0.2,    p5,4=0.3,    p5,5 = 0.2

(a) Let T denote the transition matrix. Compute T3. Find the probability that if you start in state #3 you will be in state #5 after 3 steps.


(b) Compute the matrix N = (I - Q)-1. Find the expected value for the number of steps prior to hitting an absorbing state if you start in state #3. (Hint: This will be the sum of one of the rows of N.)
steps

(c) Compute the matrix B = NR. Determine the probability that you eventually wind up in state #1 if you start in state #4.

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
An absorbing Markov Chain has 5 states where states #1 and #2 are absorbing states and the following transition probabilities are known: p3,2=0.1,   p3,   3=0.4,    p3,5=0.5 p4,1=0.1,   p4,3=0.5,   ...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT