Markov Chains MATH 107: Finite Mathematics University of Louisville April 7, 2014
Transitions 2 / 13
A Simple Question
Consider this simple maze: Suppose a mouse is in the leftmost chamber, and every second, it chooses randomly to go through one of the holes or to stay where it is, with equal probability. Where is the mouse likely to be in 2 seconds? In 5 seconds? In 10 seconds? This is an example of a repeated state transition.
MATH 107 (UofL) Notes April 7, 2014