Template:Discrete Markov Chain: Difference between revisions
Jump to navigation
Jump to search
John Leavitt (talk | contribs) No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
A Markov chain diagram is the graphical representation of a system that can be in various states, | A Markov chain diagram is the graphical representation of a system that can be in various states, including the possible transitions between those states. Each state block represents a state, while each transition line represents a fixed probability (discrete Markov) or constant transition rate (continuous Markov) to move from one state to another. | ||
In discrete Markov diagrams, the system moves from state to state in steps. These steps are not necessarily time-based; although they can represent a fixed period of time, they can also represent distance or any other measurement. At each step, there is a fixed probability of the system transitioning to another state. | In discrete Markov diagrams, the system moves from state to state in steps. These steps are not necessarily time-based; although they can represent a fixed period of time, they can also represent distance or any other measurement. At each step, there is a fixed probability of the system transitioning to another state. | ||
Revision as of 16:48, 16 February 2015
A Markov chain diagram is the graphical representation of a system that can be in various states, including the possible transitions between those states. Each state block represents a state, while each transition line represents a fixed probability (discrete Markov) or constant transition rate (continuous Markov) to move from one state to another.
In discrete Markov diagrams, the system moves from state to state in steps. These steps are not necessarily time-based; although they can represent a fixed period of time, they can also represent distance or any other measurement. At each step, there is a fixed probability of the system transitioning to another state.