I apologise: Java applets are no longer supported in browsers. Please wait until this page is eventually updated.

The matrix for the Markov chain comprises the transition probablities. These numbers are the probabilities of changing from one version of the loop to another at the end of each one-second interval.

The higher probabilities on the diagonal mean the current version is more likely to continue than it is to change. On these figures, it will take an average of three to nine seconds to change, depending on which version is showing. There may be large deviations from these averages.

I apologise: Java applets are no longer supported in browsers. Please wait until this page is eventually updated.

Powers of the matrix represent longer-term transition probabilites. For example, the tenth power comprises the transition probablities after ten intervals (ten seconds). These changing probabilities eventually settle down. The numbers then represent the long-term probabilities for each version. For example, the first number shows that the raw, noisy version will been shown almost a quarter of the time (in the long run).