5 ms·
Markov Chains Explained
- hellodevnull 12y agoI liked this visual explanation http://setosa.io/blog/2014/07/26/markov-chains/ http://setosa.io/blog/2014/07/26/markov-chains/
- pavel_lishin 12y agoVisual and interactive - this is pretty great!
- floatrock 12y agoStuff like this is where the power of "visualization" really shines.
- IndianAstronaut 12y agoAnother useful thing to study along with Markov chains is stochastic matrices. They are useful and come up in many situations such as NLP, combinatorics, etc.
- zerooneinfinity 12y agoVery nice, thanks!
- DonPellegrino 12y agoMarkov chains are fun and relatively simple. I wrote one that generates Reddit comments from other Reddit comments, you can try it here: http://simongrondin.name/files/reddit.html http://simongrondin.name/files/reddit.html and the code (really dirty, sorry, I wrote the whole thing in 30-45 minutes iirc) is here: https://github.com/SGrondin/reddit-markov-chains/blob/master/index._coffee https://github.com/SGrondin/reddit-markov-chains/blob/master...
- mbenjaminsmith 12y agoDidn't really look at it but the spirit of it I love. Thanks for sharing.
- learnstats2 12y agoI know what Markov Chains are (the probabilities for the next state of the chain is dependent only on the current state) What I would prefer to know is why are they more useful than a more nuanced model with non-fixed probabilities, or memory of previous states? - given that these are not really harder to simulate. It seems to me that Markov Chains are very often used as an inappropriate simplification. Is there some mathematical advantage to using them?
- coherentpony 12y agoWhat you are referring to are non-Markov processes. That is, process with a memory. These can be useful too, but the reason Markovian processes are preferred is because of the independence (lack of memory). Independence is a sufficient condition for many theorems that use Markov processes to prove things about average behaviour.
- learnstats2 12y agoYes, I understand. But why does a lack of memory help? What useful theorems are there?
- dangerlibrary 12y agoThe formal definition of a single Markov Chain is one with a fixed transition matrix. In practice, many software implementations of Markov models update/modify the transition matrix as new information becomes available. Formally, you're no longer working with the same Markov chain, but that doesn't mean that the model isn't useful.
- learnstats2 12y agoRight; I don't think this should be described as a Markov Chain variant, since it breaks the fundamental property of a Markov Chain; Any old simulation works in this way.
- thomaspaine 12y agoMarkov chains have a lot of nice features you can derive from them, like convergence to a stationary distribution. It's hard to say that it's an inappropriate simplification if it happens to be pragmatic (like most simplifications). For example PageRank can be modeled using markov chains. You can surely develop more complicated models but markov chains provide a good starting point.
- ramblerman 12y agoWhats the difference between a 'first order' markov chain and a simple conditional probability? I mean, what's the big mathematical revelation that grants this it's own name.