Example 12.10
Suppose that a mouse is moving inside the maze shown in Figure 12.1, from one cell to another, in search of food. When at a cell, the mouse will move to one of the adjoining cells randomly. For n ≥ 0, let Xnbe the cell number the mouse will visit after having changed cells n times. Then {Xn: n = 0, 1,...} is a Markov chain with state space {1, 2, . . . , 9} and transition probability matrix
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here