# Markov process

Markov process example

In probability theory and statistics, a Markov process or Markoff process, named after the Russian mathematician Andrey Markov, is a stochastic process satisfying a certain property, called the Markov property. A Markov process can be thought of as 'memoryless': loosely speaking, a process satisfies the Markov property if one can make predictions for the future of the process based solely on its present state just as well as one could knowing the process's full history. I.e., conditional on the present state of the system, its future and past are independent.[1]

Markov processes arise in probability and statistics in one of two ways. A stochastic process, defined via a separate argument, may be shown mathematically to have the Markov property, and as a consequence to have the properties that can be deduced from this for all Markov processes. Alternately, in modelling a process, one may assume the process to be Markov, and take this as the basis for a construction. In modelling terms, assuming that the Markov property holds is one of a limited number of simple ways of introducing statistical dependence into a model for a stochastic process in such a way that allows the strength of dependence at different lags to decline as the lag increases.

Often, the term Markov chain is used to mean a Markov process which has a discrete (finite or countable) state-space. Usually a Markov chain would be defined for a discrete set of times (i.e. a discrete-time Markov chain)[2] although some authors use the same terminology where "time" can take continuous values.[3] Also see continuous-time Markov process.

## Markov property

### The general case

Let $(\Omega,\mathcal{F},\mathbb{P})$ be a probability space with a filtration $(\mathcal{F}_t,\ t \in T)$, for some (totally ordered) index set $T$; and let $(S,\mathcal{S})$ be a measurable space. An S-valued stochastic process $X=(X_t,\ t\in T)$ adapted to the filtration is said to possess the Markov property with respect to the $\{\mathcal{F}_t\}$ if, for each $A\in \mathcal{S}$ and each $s,t\in T$ with s < t,

$\mathbb{P}(X_t \in A |\mathcal{F}_s) = \mathbb{P}(X_t \in A| X_s).$[4]

A Markov process is a stochastic process which satisfies the Markov property with respect to its natural filtration.

### For discrete-time Markov chains

In the case where $S$ is a discrete set with the discrete sigma algebra and $T = \mathbb{N}$, this can be reformulated as follows:

$\mathbb{P}(X_n=x_n|X_{n-1}=x_{n-1}, X_{n-2}=x_{n-2}, \dots, X_0=x_0)=\mathbb{P}(X_n=x_n|X_{n-1}=x_{n-1})$.

## Examples

### Gambling

Suppose that you start with $10 in poker chips, and you repeatedly wager$1 on a (fair) coin toss indefinitely, or until you lose all of your poker chips. If $X_n$ represents the number of dollars you have in chips after n tosses, with $X_0 = 10$, then the sequence $\{X_n : n \in [0,\infty)\}$ is a Markov process. If I know that you have 12 chips now, then I will guess that with even odds, you will either have 11 or 13 chips after the next toss. This guess is not improved by the added knowledge that you started with 10 chips, then went up to 11, down to 10, up to 11, and then to 12.

### A birth-death process

Suppose that you are popping one hundred kernels of popcorn, and each kernel will pop at an independent, exponentially-distributed time. Let $X_t$ denote the number of kernels which have popped up to time t. Then this is a continuous time, non-homogenous Markov process. If after some amount of time, I want to guess how many kernels will pop in the next second, I need only to know how many kernels have popped so far. It will not help me to know when they popped, so knowing $X_t$ for previous times t will not inform my guess.

The process described here is an approximation of a Poisson process - Poisson processes are also Markov.

### A non-Markov example

Suppose that you have a coin purse containing five quarters (each worth 25c), five nickels (each worth 5c) and five dimes (each worth 10c), and one-by-one, you randomly draw coins from the purse and set them on a table. If $X_n$ represents the total value of the coins set on the table after n draws, with $X_0 = 0$, then the sequence $\{X_n : n\in[0,\infty)\}$ is not a Markov process.

To see why this is the case, suppose that in your first six draws, you draw all five nickels, and then a quarter. So $X_6 = \0.50$. If we know not just $X_6$, but the earlier values as well, then we can determine which coins have been drawn, and we know that the next coin will not be a nickel, so we can determine that $X_7 \geq \0.60$ with probability 1. But if we do not know the earlier values, then based only on the value $X_6$ we might guess that we had drawn four dimes and two nickels, in which case it would certainly be possible to draw another nickel next. Thus, our guesses about $X_7$ are impacted by our knowledge of values prior to $X_6$.

## Markovian representations

In some cases, apparently non-Markovian processes may still have Markovian representations, constructed by expanding the concept of the 'current' and 'future' states. For example, let X be a non-Markovian process. Then define a process Y, such that each state of Y represents a time-interval of states of X. Mathematically, this takes the form:

$Y(t) = \big\{ X(s): s \in [a(t), b(t)] \, \big\}.$

If Y has the Markov property, then it is a Markovian representation of X.

An example of a non-Markovian process with a Markovian representation is an autoregressive time series of order greater than one.[citation needed]

## In popular culture

The band Bad Religion has a song titled "The Markovian Process" on their album Stranger Than Fiction. The credited writer of the song, lead singer Greg Graffin, has a Ph.D. in zoology and degrees in anthropology and geology.