Difference between revisions of "Markov chain"
Jump to navigation
Jump to search
DavidB4-bot (talk | contribs) (→top: clean up & uniformity) |
|||
| 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 and Statistics]] |
Revision as of 15:45, July 13, 2016
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.