Mouse in a Maze A mouse is placed in one of the compartments of the maze shown in Fig. 7. After each minute of looking unsuccessfully for food, the mouse exits through one of the doors at random and moves to an adjacent compartment. The Exit door is one way; that is, the mouse cannot return after it has exited the maze.
Figure 7
a. Draw the transition diagram for the Markov process.
b. Set up an absorbing stochastic matrix for the Markov process.
c. Find the stable matrix.
d. If the mouse begins in compartment A, what is the expected amount of time that it spends in the maze?
Note:
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
Finite Mathematics & Its Applications (12th Edition)
- Explain how you can determine the steady state matrix X of an absorbing Markov chain by inspection.arrow_forwardFind the steady state matrix for each stochastic matrix in Exercises 16. 1. [25253575] 2. [1+21222] 3. [0.30.160.250.30.60.250.30.160.5] 4. [0.30.50.20.10.20.70.80.10.1] 5. [1000010000100001] 6. [12291441516131441516291441516291415]arrow_forward
- Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage LearningLinear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning