Markov chain
Summary
A Markov chain is a random process in which the next state depends only on the present state, and not on the earlier history. The node Markov chain gives the precise definition in discrete time with a countable state space.
What this node needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Markov_chain, lead section
What links here
Definitions
- Markov chain 033TJBZDG0