Changes

15 bytes added ,  21:15, November 8, 2009
no edit summary
Line 1: Line 1:  
A '''Markov chain''', sometimes called a Markov process, is a sequence in which any state in the sequence depends only on the previous state, and is independent of all other states.  An example of a Markov process is the [[random walk problem]].
 
A '''Markov chain''', sometimes called a Markov process, is a sequence in which any state in the sequence depends only on the previous state, and is independent of all other states.  An example of a Markov process is the [[random walk problem]].
   −
[[category:Probability]]
+
[[category:Probability and Statistics]]
17,394

edits