ITWissen.info - Tech know how online

Markov process

Markov processes, further notations: Markov or Markoff processes, represent a tool for modeling stochastic processes

. The definition of Markov processes goes back to the Russian mathematician Andrej Markov (1856 - 1922). Markov processes are important for the description of processes in physics, natural sciences, economics and biology. Markov processes characterize a stochastic process

. A distinction is made between continuous and discrete processes. If it is a discrete process, it is also called a Markov chain.States and state transitions form the basic concept of Markov processes. Since this can be better imagined for discrete, at most countably many states and it also fits better to the discrete approach of waiting systems

, the further representation is limited to Markov chains. In the modeling, suitable states and state transitions must be defined. The consideration of chains also has the advantage that they can be graphically represented as state graphs.

Conditions for the stochastic and the Markov process

Conditions for the stochastic and the Markov process

A stochastic process is called a Markov process if these conditions are fulfilled (formula 1).The Markov property now states that a next state always depends only on the just current one and not on the previous state, especially not on the starting state. The current state thus contains everything that needs to be known about the past.

Structure of a Markov chain

Structure of a Markov chain

The Markov chain is used to describe the stochastic occupancy behavior of the queue. The circles model the possible occupancy states of the queue and the directed marked edges of the graph

(arrows) model the state transitions, where the transition from state "i" to state "j" occurs with the transition probability p(ij) i .

States in the Markov chain

States in the Markov chain

The Markov chain shown is characterized by the fact that each state has transitions only to its immediate neighbors, but not to more distant states. Since the number of states is finite, all states have exactly two transitions to their neighbors. Two states each have only one transition to their neighbors.

Transition probability

Transition probability

In the discrete-time case shown, each occupancy state also has one transition to itself with the transition probability (formula 2). In general, the future random behavior of a Markov chain at any time "t" depends only on the even active state, but not on the past random behavior that activated the state. This directly applies to the occupancy behavior of the memory of a queueing system as well.

Informationen zum Artikel
Englisch: Markov process
Updated at: 14.01.2010
#Words: 481
Links:
Translations: DE