Finite-State, Discrete-Time Markov Chains
Wolfram Demonstrations Project · 2008
Consider a system that is always in one of states numbered 1 through . Every time a clock ticks the system updates itself according to an matrix of transition probabilities the entry of which gives the probability that the system moves from state to state at any clock tick. A Markov chain is a system like this in which the next state depends only on the current state and not on previous states;;