Markov Chain

A Markov chain (discrete-time Markov chain or DTMC[1]) named after Andrey Markov, is a mathematical system that undergoes transitions from one state to another, among a finite or countable number of possible states. It is a random process usually characterized as MemoryLess: the next state depends only on the current state and not on the sequence of events that preceded it. This specific kind of "memorylessness" is called the Markov property. http://en.wikipedia.org/wiki/Markov_chain

Variation: Inside-out Markov Chain

cf Robert Anton Wilson character Markoff Chaney and his Operation Mindfuck in the Illuminatus Trilogy and Schrodingers Cat Trilogy.

Buster Benson applying it to Twitter: 2013-09-26-BensonMarkovChainTweets including Ruby code

• Parker Moore packaged it as a Ruby gem https://github.com/parkr/ebooks
• I used some in one of my TwitterBot-s

Discussion Forum comments? Also relating to Bayesian analysis. http://www.codinghorror.com/blog/2008/06/markov-and-you.html

Swift Key writing sonnets.

Python code

• http://www.decontextualize.com/teaching/rwet/n-grams-and-markov-chains/
• http://agiliq.com/blog/2009/06/generating-pseudo-random-text-with-markov-chains-u/
• see TwitterBot page for Leonard Richardson code that I forked
• for IrcBot http://charlesleifer.com/blog/building-markov-chain-irc-bot-python-and-redis/