Hint: The probability of moving from one state to another state in n steps is P^n
Markov Chain probability steady state
3 次查看(过去 30 天)
显示 更早的评论
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 个评论
回答(1 个)
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Markov Chain Models 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!