Difference between revisions of "Markov chain"
Jump to navigation
Jump to search
m (if it's AKA, then that article should only refer back to this one, so unlink; also, change cat) |
|||
| 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]] |
Revision as of 21:15, November 8, 2009
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.