A Two-State, Discrete-Time Markov Chain
Wolfram Demonstrations Project · 2008
Consider a system that is always in one of two states 1 or 2. Every time a clock ticks the system updates itself according to a 2×2 matrix of transition probabilities the entry of which gives the probability that the system moves from state to state at any clock tick. A twoÃÂâÃÂÃÂÃÂÃÂstate Markov chain is a system like this in which the next state depends only on the current state and not on previ;;