Markov Chain probability steady state
3 views (last 30 days)
Show older comments
Hi there,
A matrix relates to a random walk on a 3 * 3 grid. The grid has nine sqaures and the particles starts at square 1. The particle can move either horizontally or vertically after each step. It stops when it reaches one of the three corners. e.g (1--> 4--> 5--> 8--> 7) Below is the image of the grid and the probability.
I need help in finding the probability of the particle reaching each of the three corner squares at each time until the probabilties settle to a steady value.
0 Comments
Answers (1)
James Tursa
on 17 Sep 2020
Hint: The probability of moving from one state to another state in n steps is P^n
0 Comments
See Also
Categories
Find more on Markov Chain Models in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!