# Markov chain

Last updated

A Markov chain or Markov process is a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event. [1] [2] [3] A countably infinite sequence, in which the chain moves state at discrete time steps, gives a discrete-time Markov chain (DTMC). A continuous-time process is called a continuous-time Markov chain (CTMC). It is named after the Russian mathematician Andrey Markov.

## Contents

Markov chains have many applications as statistical models of real-world processes, [1] [4] [5] [6] such as studying cruise control systems in motor vehicles, queues or lines of customers arriving at an airport, currency exchange rates and animal population dynamics. [7]

Markov processes are the basis for general stochastic simulation methods known as Markov chain Monte Carlo, which are used for simulating sampling from complex probability distributions, and have found application in Bayesian statistics, thermodynamics, statistical mechanics, physics, chemistry, economics, finance, signal processing, information theory and speech processing. [7] [8] [9]

The adjectives Markovian and Markov are used to describe something that is related to a Markov process. [1] [10] [11]

## Introduction

### Definition

A Markov process is a stochastic process that satisfies the Markov property [1] (sometimes characterized as "memorylessness"). In simpler terms, it is a process for which predictions can be made regarding future outcomes based solely on its present state and—most importantly—such predictions are just as good as the ones that could be made knowing the process's full history. [12] In other words, conditional on the present state of the system, its future and past states are independent.

A Markov chain is a type of Markov process that has either a discrete state space or a discrete index set (often representing time), but the precise definition of a Markov chain varies. [13] For example, it is common to define a Markov chain as a Markov process in either discrete or continuous time with a countable state space (thus regardless of the nature of time), [14] [15] [16] [17] but it is also common to define a Markov chain as having discrete time in either countable or continuous state space (thus regardless of the state space). [13]

### Types of Markov chains

The system's state space and time parameter index need to be specified. The following table gives an overview of the different instances of Markov processes for different levels of state space generality and for discrete time v. continuous time:

Countable state spaceContinuous or general state space
Discrete-time(discrete-time) Markov chain on a countable or finite state space Markov chain on a measurable state space (for example, Harris chain)
Continuous-timeContinuous-time Markov process or Markov jump processAny continuous stochastic process with the Markov property (for example, the Wiener process)

Note that there is no definitive agreement in the literature on the use of some of the terms that signify special cases of Markov processes. Usually the term "Markov chain" is reserved for a process with a discrete set of times, that is, a discrete-time Markov chain (DTMC), [1] [18] but a few authors use the term "Markov process" to refer to a continuous-time Markov chain (CTMC) without explicit mention. [19] [20] [21] In addition, there are other extensions of Markov processes that are referred to as such but do not necessarily fall within any of these four categories (see Markov model). Moreover, the time index need not necessarily be real-valued; like with the state space, there are conceivable processes that move through index sets with other mathematical constructs. Notice that the general state space continuous-time Markov chain is general to such a degree that it has no designated term.

While the time parameter is usually discrete, the state space of a Markov chain does not have any generally agreed-on restrictions: the term may refer to a process on an arbitrary state space. [22] However, many applications of Markov chains employ finite or countably infinite state spaces, which have a more straightforward statistical analysis. Besides time-index and state-space parameters, there are many other variations, extensions and generalizations (see Variations). For simplicity, most of this article concentrates on the discrete-time, discrete state-space case, unless mentioned otherwise.

### Transitions

The changes of state of the system are called transitions. [1] The probabilities associated with various state changes are called transition probabilities. The process is characterized by a state space, a transition matrix describing the probabilities of particular transitions, and an initial state (or initial distribution) across the state space. By convention, we assume all possible states and transitions have been included in the definition of the process, so there is always a next state, and the process does not terminate.

A discrete-time random process involves a system which is in a certain state at each step, with the state changing randomly between steps. [1] The steps are often thought of as moments in time, but they can equally well refer to physical distance or any other discrete measurement. Formally, the steps are the integers or natural numbers, and the random process is a mapping of these to states. [23] The Markov property states that the conditional probability distribution for the system at the next step (and in fact at all future steps) depends only on the current state of the system, and not additionally on the state of the system at previous steps.

Since the system changes randomly, it is generally impossible to predict with certainty the state of a Markov chain at a given point in the future. [23] However, the statistical properties of the system's future can be predicted. [23] In many applications, it is these statistical properties that are important.

## History

Markov studied Markov processes in the early 20th century, publishing his first paper on the topic in 1906. [24] [25] [26] [27] Markov processes in continuous time were discovered long before Andrey Markov's work in the early 20th century [1] in the form of the Poisson process. [28] [29] [30] Markov was interested in studying an extension of independent random sequences, motivated by a disagreement with Pavel Nekrasov who claimed independence was necessary for the weak law of large numbers to hold. [1] [31] In his first paper on Markov chains, published in 1906, Markov showed that under certain conditions the average outcomes of the Markov chain would converge to a fixed vector of values, so proving a weak law of large numbers without the independence assumption, [1] [25] [26] [27] which had been commonly regarded as a requirement for such mathematical laws to hold. [27] Markov later used Markov chains to study the distribution of vowels in Eugene Onegin, written by Alexander Pushkin, and proved a central limit theorem for such chains. [1] [25]

In 1912 Henri Poincaré studied Markov chains on finite groups with an aim to study card shuffling. Other early uses of Markov chains include a diffusion model, introduced by Paul and Tatyana Ehrenfest in 1907, and a branching process, introduced by Francis Galton and Henry William Watson in 1873, preceding the work of Markov. [25] [26] After the work of Galton and Watson, it was later revealed that their branching process had been independently discovered and studied around three decades earlier by Irénée-Jules Bienaymé. [32] Starting in 1928, Maurice Fréchet became interested in Markov chains, eventually resulting in him publishing in 1938 a detailed study on Markov chains. [25] [33]

Andrei Kolmogorov developed in a 1931 paper a large part of the early theory of continuous-time Markov processes. [34] [35] Kolmogorov was partly inspired by Louis Bachelier's 1900 work on fluctuations in the stock market as well as Norbert Wiener's work on Einstein's model of Brownian movement. [34] [36] He introduced and studied a particular set of Markov processes known as diffusion processes, where he derived a set of differential equations describing the processes. [34] [37] Independent of Kolmogorov's work, Sydney Chapman derived in a 1928 paper an equation, now called the Chapman–Kolmogorov equation, in a less mathematically rigorous way than Kolmogorov, while studying Brownian movement. [38] The differential equations are now called the Kolmogorov equations [39] or the Kolmogorov–Chapman equations. [40] Other mathematicians who contributed significantly to the foundations of Markov processes include William Feller, starting in 1930s, and then later Eugene Dynkin, starting in the 1950s. [35]

## Examples

Random walks based on integers and the gambler's ruin problem are examples of Markov processes. [41] [42] Some variations of these processes were studied hundreds of years earlier in the context of independent variables. [43] [44] [45] Two important examples of Markov processes are the Wiener process, also known as the Brownian motion process, and the Poisson process, [28] which are considered the most important and central stochastic processes in the theory of stochastic processes. [46] [47] [48] These two processes are Markov processes in continuous time, while random walks on the integers and the gambler's ruin problem are examples of Markov processes in discrete time. [41] [42]

A famous Markov chain is the so-called "drunkard's walk", a random walk on the number line where, at each step, the position may change by +1 or −1 with equal probability. From any position there are two possible transitions, to the next or previous integer. The transition probabilities depend only on the current position, not on the manner in which the position was reached. For example, the transition probabilities from 5 to 4 and 5 to 6 are both 0.5, and all other transition probabilities from 5 are 0. These probabilities are independent of whether the system was previously in 4 or 6.

Another example is the dietary habits of a creature that eats only grapes, cheese, or lettuce, and whose dietary habits conform to the following rules:

• It eats exactly once a day.
• If it ate cheese today, tomorrow it will eat lettuce or grapes with equal probability.
• If it ate grapes today, tomorrow it will eat grapes with probability 1/10, cheese with probability 4/10, and lettuce with probability 5/10.
• If it ate lettuce today, tomorrow it will eat grapes with probability 4/10 or cheese with probability 6/10. It will not eat lettuce again tomorrow.

This creature's eating habits can be modeled with a Markov chain since its choice tomorrow depends solely on what it ate today, not what it ate yesterday or any other time in the past. One statistical property that could be calculated is the expected percentage, over a long period, of the days on which the creature will eat grapes.

A series of independent events (for example, a series of coin flips) satisfies the formal definition of a Markov chain. However, the theory is usually applied only when the probability distribution of the next step depends non-trivially on the current state.

### A non-Markov example

Suppose that there is a coin purse containing five quarters (each worth 25¢), five dimes (each worth 10¢), and five nickels (each worth 5¢), and one by one, coins are randomly drawn from the purse and are set on a table. If ${\displaystyle X_{n}}$ represents the total value of the coins set on the table after n draws, with ${\displaystyle X_{0}=0}$, then the sequence ${\displaystyle \{X_{n}:n\in \mathbb {N} \}}$ is not a Markov process.

To see why this is the case, suppose that in the first six draws, all five nickels and a quarter are drawn. Thus ${\displaystyle X_{6}=\0.50}$. If we know not just ${\displaystyle 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 ${\displaystyle X_{7}\geq \0.60}$ with probability 1. But if we do not know the earlier values, then based only on the value ${\displaystyle 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 ${\displaystyle X_{7}}$ are impacted by our knowledge of values prior to ${\displaystyle X_{6}}$.

However, it is possible to model this scenario as a Markov process. Instead of defining ${\displaystyle X_{n}}$ to represent the total value of the coins on the table, we could define ${\displaystyle X_{n}}$ to represent the count of the various coin types on the table. For instance, ${\displaystyle X_{6}=1,0,5}$ could be defined to represent the state where there is one quarter, zero dimes, and five nickels on the table after 6 one-by-one draws. This new model would be represented by 216 possible states (that is, 6x6x6 states, since each of the three coin types could have zero to five coins on the table by the end of the 6 draws). Suppose that the first draw results in state ${\displaystyle X_{1}=0,1,0}$. The probability of achieving ${\displaystyle X_{2}}$ now depends on ${\displaystyle X_{1}}$; for example, the state ${\displaystyle X_{2}=1,0,1}$ is not possible. After the second draw, the third draw depends on which coins have so far been drawn, but no longer only on the coins that were drawn for the first state (since probabilistically important information has since been added to the scenario). In this way, the likelihood of the ${\displaystyle X_{n}=i,j,k}$ state depends exclusively on the outcome of the ${\displaystyle X_{n-1}=\ell ,m,p}$ state.

## Formal definition

### Discrete-time Markov chain

A discrete-time Markov chain is a sequence of random variables X1, X2, X3, ... with the Markov property, namely that the probability of moving to the next state depends only on the present state and not on the previous states:

${\displaystyle \Pr(X_{n+1}=x\mid X_{1}=x_{1},X_{2}=x_{2},\ldots ,X_{n}=x_{n})=\Pr(X_{n+1}=x\mid X_{n}=x_{n}),}$ if both conditional probabilities are well defined, that is, if ${\displaystyle \Pr(X_{1}=x_{1},\ldots ,X_{n}=x_{n})>0.}$

The possible values of Xi form a countable set S called the state space of the chain.

#### Variations

• Time-homogeneous Markov chains are processes where
${\displaystyle \Pr(X_{n+1}=x\mid X_{n}=y)=\Pr(X_{n}=x\mid X_{n-1}=y)}$
for all n. The probability of the transition is independent of n.
• Stationary Markov chains are processes where
${\displaystyle \Pr(X_{0}=x_{0},X_{1}=x_{1},\ldots ,X_{k}=x_{k})=\Pr(X_{n}=x_{0},X_{n+1}=x_{1},\ldots ,X_{n+k}=x_{k})}$
for all n and k. Every stationary chain can be proved to be time-homogeneous by Bayes' rule.
A necessary and sufficient condition for a time-homogeneous Markov chain to be stationary is that the distribution of ${\displaystyle X_{0}}$ is a stationary distribution of the Markov chain.
• A Markov chain with memory (or a Markov chain of order m) where m is finite, is a process satisfying
{\displaystyle {\begin{aligned}{}&\Pr(X_{n}=x_{n}\mid X_{n-1}=x_{n-1},X_{n-2}=x_{n-2},\dots ,X_{1}=x_{1})\\=&\Pr(X_{n}=x_{n}\mid X_{n-1}=x_{n-1},X_{n-2}=x_{n-2},\dots ,X_{n-m}=x_{n-m}){\text{ for }}n>m\end{aligned}}}
In other words, the future state depends on the past m states. It is possible to construct a chain ${\displaystyle (Y_{n})}$ from ${\displaystyle (X_{n})}$ which has the 'classical' Markov property by taking as state space the ordered m-tuples of X values, i.e., ${\displaystyle Y_{n}=\left(X_{n},X_{n-1},\ldots ,X_{n-m+1}\right)}$.

### Continuous-time Markov chain

A continuous-time Markov chain (Xt)t  0 is defined by a finite or countable state space S, a transition rate matrix Q with dimensions equal to that of the state space and initial probability distribution defined on the state space. For i  j, the elements qij are non-negative and describe the rate of the process transitions from state i to state j. The elements qii are chosen such that each row of the transition rate matrix sums to zero, while the row-sums of a probability transition matrix in a (discrete) Markov chain are all equal to one.

There are three equivalent definitions of the process. [49]

#### Infinitesimal definition

Let ${\displaystyle X_{t}}$ be the random variable describing the state of the process at time t, and assume the process is in a state i at time t. Then, knowing ${\displaystyle X_{t}=i}$, ${\displaystyle X_{t+h}=j}$ is independent of previous values ${\displaystyle \left(X_{s}:s, and as h → 0 for all j and for all t,

${\displaystyle \Pr(X(t+h)=j\mid X(t)=i)=\delta _{ij}+q_{ij}h+o(h)}$,

where ${\displaystyle \delta _{ij}}$ is the Kronecker delta, using the little-o notation. The ${\displaystyle q_{ij}}$ can be seen as measuring how quickly the transition from i to j happens.

#### Jump chain/holding time definition

Define a discrete-time Markov chain Yn to describe the nth jump of the process and variables S1, S2, S3, ... to describe holding times in each of the states where Si follows the exponential distribution with rate parameter −qYiYi.

#### Transition probability definition

For any value n = 0, 1, 2, 3, ... and times indexed up to this value of n: t0, t1, t2, ... and all states recorded at these times i0, i1, i2, i3, ... it holds that

${\displaystyle \Pr(X_{t_{n+1}}=i_{n+1}\mid X_{t_{0}}=i_{0},X_{t_{1}}=i_{1},\ldots ,X_{t_{n}}=i_{n})=p_{i_{n}i_{n+1}}(t_{n+1}-t_{n})}$

where pij is the solution of the forward equation (a first-order differential equation)

${\displaystyle P'(t)=P(t)Q}$

with initial condition P(0) is the identity matrix.

### Finite state space

If the state space is finite, the transition probability distribution can be represented by a matrix, called the transition matrix, with the (i, j)th element of P equal to

${\displaystyle p_{ij}=\Pr(X_{n+1}=j\mid X_{n}=i).}$

Since each row of P sums to one and all elements are non-negative, P is a right stochastic matrix.

#### Stationary distribution relation to eigenvectors and simplices

A stationary distribution π is a (row) vector, whose entries are non-negative and sum to 1, is unchanged by the operation of transition matrix P on it and so is defined by

${\displaystyle \pi \mathbf {P} =\pi .}$

By comparing this definition with that of an eigenvector we see that the two concepts are related and that

${\displaystyle \pi ={\frac {e}{\sum _{i}{e_{i}}}}}$

is a normalized (${\textstyle \sum _{i}\pi _{i}=1}$) multiple of a left eigenvector e of the transition matrix P with an eigenvalue of 1. If there is more than one unit eigenvector then a weighted sum of the corresponding stationary states is also a stationary state. But for a Markov chain one is usually more interested in a stationary state that is the limit of the sequence of distributions for some initial distribution.

The values of a stationary distribution ${\displaystyle \textstyle \pi _{i}}$ are associated with the state space of P and its eigenvectors have their relative proportions preserved. Since the components of π are positive and the constraint that their sum is unity can be rewritten as ${\textstyle \sum _{i}1\cdot \pi _{i}=1}$ we see that the dot product of π with a vector whose components are all 1 is unity and that π lies on a simplex.

#### Time-homogeneous Markov chain with a finite state space

If the Markov chain is time-homogeneous, then the transition matrix P is the same after each step, so the k-step transition probability can be computed as the k-th power of the transition matrix, Pk.

If the Markov chain is irreducible and aperiodic, then there is a unique stationary distribution π. [50] Additionally, in this case Pk converges to a rank-one matrix in which each row is the stationary distribution π:

${\displaystyle \lim _{k\to \infty }\mathbf {P} ^{k}=\mathbf {1} \pi }$

where 1 is the column vector with all entries equal to 1. This is stated by the Perron–Frobenius theorem. If, by whatever means, ${\textstyle \lim _{k\to \infty }\mathbf {P} ^{k}}$ is found, then the stationary distribution of the Markov chain in question can be easily determined for any starting distribution, as will be explained below.

For some stochastic matrices P, the limit ${\textstyle \lim _{k\to \infty }\mathbf {P} ^{k}}$ does not exist while the stationary distribution does, as shown by this example:

${\displaystyle \mathbf {P} ={\begin{pmatrix}0&1\\1&0\end{pmatrix}}\qquad \mathbf {P} ^{2k}=I\qquad \mathbf {P} ^{2k+1}=\mathbf {P} }$
${\displaystyle {\begin{pmatrix}{\frac {1}{2}}&{\frac {1}{2}}\end{pmatrix}}{\begin{pmatrix}0&1\\1&0\end{pmatrix}}={\begin{pmatrix}{\frac {1}{2}}&{\frac {1}{2}}\end{pmatrix}}}$

(This example illustrates a periodic Markov chain.)

Because there are a number of different special cases to consider, the process of finding this limit if it exists can be a lengthy task. However, there are many techniques that can assist in finding this limit. Let P be an n×n matrix, and define ${\textstyle \mathbf {Q} =\lim _{k\to \infty }\mathbf {P} ^{k}.}$

It is always true that

${\displaystyle \mathbf {QP} =\mathbf {Q} .}$

Subtracting Q from both sides and factoring then yields

${\displaystyle \mathbf {Q} (\mathbf {P} -\mathbf {I} _{n})=\mathbf {0} _{n,n},}$

where In is the identity matrix of size n, and 0n,n is the zero matrix of size n×n. Multiplying together stochastic matrices always yields another stochastic matrix, so Q must be a stochastic matrix (see the definition above). It is sometimes sufficient to use the matrix equation above and the fact that Q is a stochastic matrix to solve for Q. Including the fact that the sum of each the rows in P is 1, there are n+1 equations for determining n unknowns, so it is computationally easier if on the one hand one selects one row in Q and substitutes each of its elements by one, and on the other one substitutes the corresponding element (the one in the same column) in the vector 0, and next left-multiplies this latter vector by the inverse of transformed former matrix to find Q.

Here is one method for doing so: first, define the function f(A) to return the matrix A with its right-most column replaced with all 1's. If [f(PIn)]−1 exists then [51] [50]

${\displaystyle \mathbf {Q} =f(\mathbf {0} _{n,n})[f(\mathbf {P} -\mathbf {I} _{n})]^{-1}.}$
Explain: The original matrix equation is equivalent to a system of n×n linear equations in n×n variables. And there are n more linear equations from the fact that Q is a right stochastic matrix whose each row sums to 1. So it needs any n×n independent linear equations of the (n×n+n) equations to solve for the n×n variables. In this example, the n equations from “Q multiplied by the right-most column of (P-In)” have been replaced by the n stochastic ones.

One thing to notice is that if P has an element Pi,i on its main diagonal that is equal to 1 and the ith row or column is otherwise filled with 0's, then that row or column will remain unchanged in all of the subsequent powers Pk. Hence, the ith row or column of Q will have the 1 and the 0's in the same positions as in P.

#### Convergence speed to the stationary distribution

As stated earlier, from the equation ${\displaystyle {\boldsymbol {\pi }}={\boldsymbol {\pi }}\mathbf {P} ,}$ (if exists) the stationary (or steady state) distribution π is a left eigenvector of row stochastic matrix P. Then assuming that P is diagonalizable or equivalently that P has n linearly independent eigenvectors, speed of convergence is elaborated as follows. (For non-diagonalizable, that is, defective matrices, one may start with the Jordan normal form of P and proceed with a bit more involved set of arguments in a similar way. [52]

Let U be the matrix of eigenvectors (each normalized to having an L2 norm equal to 1) where each column is a left eigenvector of P and let Σ be the diagonal matrix of left eigenvalues of P, that is, Σ = diag(λ1,λ2,λ3,...,λn). Then by eigendecomposition

${\displaystyle \mathbf {P} =\mathbf {U\Sigma U} ^{-1}.}$

Let the eigenvalues be enumerated such that:

${\displaystyle 1=|\lambda _{1}|>|\lambda _{2}|\geq |\lambda _{3}|\geq \cdots \geq |\lambda _{n}|.}$

Since P is a row stochastic matrix, its largest left eigenvalue is 1. If there is a unique stationary distribution, then the largest eigenvalue and the corresponding eigenvector is unique too (because there is no other π which solves the stationary distribution equation above). Let ui be the i-th column of U matrix, that is, ui is the left eigenvector of P corresponding to λi. Also let x be a length n row vector that represents a valid probability distribution; since the eigenvectors ui span ${\displaystyle \mathbb {R} ^{n},}$ we can write

${\displaystyle \mathbf {x} ^{\mathsf {T}}=\sum _{i=1}^{n}a_{i}\mathbf {u} _{i},\qquad a_{i}\in \mathbb {R} .}$

If we multiply x with P from right and continue this operation with the results, in the end we get the stationary distribution π. In other words, π = uixPP...P = xPk as k → ∞. That means

{\displaystyle {\begin{aligned}{\boldsymbol {\pi }}^{(k)}&=\mathbf {x} \left(\mathbf {U\Sigma U} ^{-1}\right)\left(\mathbf {U\Sigma U} ^{-1}\right)\cdots \left(\mathbf {U\Sigma U} ^{-1}\right)\\&=\mathbf {xU\Sigma } ^{k}\mathbf {U} ^{-1}\\&=\left(a_{1}\mathbf {u} _{1}^{\mathsf {T}}+a_{2}\mathbf {u} _{2}^{\mathsf {T}}+\cdots +a_{n}\mathbf {u} _{n}^{\mathsf {T}}\right)\mathbf {U\Sigma } ^{k}\mathbf {U} ^{-1}\\&=a_{1}\lambda _{1}^{k}\mathbf {u} _{1}^{\mathsf {T}}+a_{2}\lambda _{2}^{k}\mathbf {u} _{2}^{\mathsf {T}}+\cdots +a_{n}\lambda _{n}^{k}\mathbf {u} _{n}^{\mathsf {T}}&&u_{i}\bot u_{j}{\text{ for }}i\neq j\\&=\lambda _{1}^{k}\left\{a_{1}\mathbf {u} _{1}^{\mathsf {T}}+a_{2}\left({\frac {\lambda _{2}}{\lambda _{1}}}\right)^{k}\mathbf {u} _{2}^{\mathsf {T}}+a_{3}\left({\frac {\lambda _{3}}{\lambda _{1}}}\right)^{k}\mathbf {u} _{3}^{\mathsf {T}}+\cdots +a_{n}\left({\frac {\lambda _{n}}{\lambda _{1}}}\right)^{k}\mathbf {u} _{n}^{\mathsf {T}}\right\}\end{aligned}}}

Since π = u1, π(k) approaches to π as k → ∞ with a speed in the order of λ2/λ1 exponentially. This follows because ${\displaystyle |\lambda _{2}|\geq \cdots \geq |\lambda _{n}|,}$ hence λ2/λ1 is the dominant term. The smaller the ratio is, the faster the convergence is. [53] Random noise in the state distribution π can also speed up this convergence to the stationary distribution. [54]

### General state space

#### Harris chains

Many results for Markov chains with finite state space can be generalized to chains with uncountable state space through Harris chains.

The use of Markov chains in Markov chain Monte Carlo methods covers cases where the process follows a continuous state space.

#### Locally interacting Markov chains

Considering a collection of Markov chains whose evolution takes in account the state of other Markov chains, is related to the notion of locally interacting Markov chains. This corresponds to the situation when the state space has a (Cartesian-) product form. See interacting particle system and stochastic cellular automata (probabilistic cellular automata). See for instance Interaction of Markov Processes [55] or [56]

## Properties

Two states communicate with each other if both are reachable from one another by a sequence of transitions that have positive probability. This is an equivalence relation which yields a set of communicating classes. A class is closed if the probability of leaving the class is zero. A Markov chain is irreducible if there is one communicating class, the state space.

A state i has period ${\displaystyle k}$ if ${\displaystyle k}$ is the greatest common divisor of the number of transitions by which i can be reached, starting from i. That is:

${\displaystyle k=\gcd\{n>0:\Pr(X_{n}=i\mid X_{0}=i)>0\}}$

A state i is said to be transient if, starting from i, there is a non-zero probability that the chain will never return to i. It is recurrent otherwise. For a recurrent state i, the mean hitting time is defined as:

${\displaystyle M_{i}=E[T_{i}]=\sum _{n=1}^{\infty }n\cdot f_{ii}^{(n)}.}$

State i is positive recurrent if ${\displaystyle M_{i}}$ is finite and null recurrent otherwise. Periodicity, transience, recurrence and positive and null recurrence are class properties—that is, if one state has the property then all states in its communicating class have the property.

A state i is called absorbing if there are no outgoing transitions from the state.

### Ergodicity

A state i is said to be ergodic if it is aperiodic and positive recurrent. In other words, a state i is ergodic if it is recurrent, has a period of 1, and has finite mean recurrence time. If all states in an irreducible Markov chain are ergodic, then the chain is said to be ergodic.[ dubious ]

It can be shown that a finite state irreducible Markov chain is ergodic if it has an aperiodic state. More generally, a Markov chain is ergodic if there is a number N such that any state can be reached from any other state in any number of steps less or equal to a number N. In case of a fully connected transition matrix, where all transitions have a non-zero probability, this condition is fulfilled with N = 1.

A Markov chain with more than one state and just one out-going transition per state is either not irreducible or not aperiodic, hence cannot be ergodic.

### 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:

${\displaystyle 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. [57]

### Hitting times

The hitting time is the time, starting in a given set of states until the chain arrives in a given state or set of states. The distribution of such a time period has a phase type distribution. The simplest such distribution is that of a single exponentially distributed transition.

#### Expected hitting times

For a subset of states A  S, the vector kA of hitting times (where element ${\displaystyle k_{i}^{A}}$ represents the expected value, starting in state i that the chain enters one of the states in the set A) is the minimal non-negative solution to [58]

{\displaystyle {\begin{aligned}k_{i}^{A}=0&{\text{ for }}i\in A\\-\sum _{j\in S}q_{ij}k_{j}^{A}=1&{\text{ for }}i\notin A.\end{aligned}}}

### Time reversal

For a CTMC Xt, the time-reversed process is defined to be ${\displaystyle {\hat {X}}_{t}=X_{T-t}}$. By Kelly's lemma this process has the same stationary distribution as the forward process.

A chain is said to be reversible if the reversed process is the same as the forward process. Kolmogorov's criterion states that the necessary and sufficient condition for a process to be reversible is that the product of transition rates around a closed loop must be the same in both directions.

### Embedded Markov chain

One method of finding the stationary probability distribution, π, of an ergodic continuous-time Markov chain, Q, is by first finding its embedded Markov chain (EMC). Strictly speaking, the EMC is a regular discrete-time Markov chain, sometimes referred to as a jump process . Each element of the one-step transition probability matrix of the EMC, S, is denoted by sij, and represents the conditional probability of transitioning from state i into state j. These conditional probabilities may be found by

${\displaystyle s_{ij}={\begin{cases}{\frac {q_{ij}}{\sum _{k\neq i}q_{ik}}}&{\text{if }}i\neq j\\0&{\text{otherwise}}.\end{cases}}}$

From this, S may be written as

${\displaystyle S=I-\left(\operatorname {diag} (Q)\right)^{-1}Q}$

where I is the identity matrix and diag(Q) is the diagonal matrix formed by selecting the main diagonal from the matrix Q and setting all other elements to zero.

To find the stationary probability distribution vector, we must next find ${\displaystyle \varphi }$ such that

${\displaystyle \varphi S=\varphi ,}$

with ${\displaystyle \varphi }$ being a row vector, such that all elements in ${\displaystyle \varphi }$ are greater than 0 and ${\displaystyle \|\varphi \|_{1}}$ = 1. From this, π may be found as

${\displaystyle \pi ={-\varphi (\operatorname {diag} (Q))^{-1} \over \left\|\varphi (\operatorname {diag} (Q))^{-1}\right\|_{1}}.}$

(S may be periodic, even if Q is not. Once π is found, it must be normalized to a unit vector.)

Another discrete-time process that may be derived from a continuous-time Markov chain is a δ-skeletonthe (discrete-time) Markov chain formed by observing X(t) at intervals of δ units of time. The random variables X(0), X(δ), X(2δ), ... give the sequence of states visited by the δ-skeleton.

## Special types of Markov chains

### Markov model

Markov models are used to model changing systems. There are 4 main types of models, that generalize Markov chains depending on whether every sequential state is observable or not, and whether the system is to be adjusted on the basis of observations made:

System state is fully observableSystem state is partially observable
System is autonomousMarkov chain Hidden Markov model
System is controlled Markov decision process Partially observable Markov decision process

### Bernoulli scheme

A Bernoulli scheme is a special case of a Markov chain where the transition probability matrix has identical rows, which means that the next state is independent of even the current state (in addition to being independent of the past states). A Bernoulli scheme with only two possible states is known as a Bernoulli process.

Note, however, by the Ornstein isomorphism theorem, that every aperiodic and irreducible Markov chain is isomorphic to a Bernoulli scheme; [59] thus, one might equally claim that Markov chains are a "special case" of Bernoulli schemes. The isomorphism generally requires a complicated recoding. The isomorphism theorem is even a bit stronger: it states that any stationary stochastic process is isomorphic to a Bernoulli scheme; the Markov chain is just one such example.

### Subshift of finite type

When the Markov matrix is replaced by the adjacency matrix of a finite graph, the resulting shift is terms a topological Markov chain or a subshift of finite type. [59] A Markov matrix that is compatible with the adjacency matrix can then provide a measure on the subshift. Many chaotic dynamical systems are isomorphic to topological Markov chains; examples include diffeomorphisms of closed manifolds, the Prouhet–Thue–Morse system, the Chacon system, sofic systems, context-free systems and block-coding systems. [59]

## Applications

Research has reported the application and usefulness of Markov chains in a wide range of topics such as physics, chemistry, biology, medicine, music, game theory and sports.

### Physics

Markovian systems appear extensively in thermodynamics and statistical mechanics, whenever probabilities are used to represent unknown or unmodelled details of the system, if it can be assumed that the dynamics are time-invariant, and that no relevant history need be considered which is not already included in the state description. [60] [61] For example, a thermodynamic state operates under a probability distribution that is difficult or expensive to acquire. Therefore, Markov Chain Monte Carlo method can be used to draw samples randomly from a black-box to approximate the probability distribution of attributes over a range of objects. [61]

The paths, in the path integral formulation of quantum mechanics, are Markov chains. [62]

Markov chains are used in lattice QCD simulations. [63]

### Chemistry

${\displaystyle {\ce {{E}+{\underset {Substrate \atop binding}{S<=>E}}{\overset {Catalytic \atop step}{S->E}}+P}}}$
Michaelis-Menten kinetics. The enzyme (E) binds a substrate (S) and produces a product (P). Each reaction is a state transition in a Markov chain.

A reaction network is a chemical system involving multiple reactions and chemical species. The simplest stochastic models of such networks treat the system as a continuous time Markov chain with the state being the number of molecules of each species and with reactions modeled as possible transitions of the chain. [64] Markov chains and continuous-time Markov processes are useful in chemistry when physical systems closely approximate the Markov property. For example, imagine a large number n of molecules in solution in state A, each of which can undergo a chemical reaction to state B with a certain average rate. Perhaps the molecule is an enzyme, and the states refer to how it is folded. The state of any single enzyme follows a Markov chain, and since the molecules are essentially independent of each other, the number of molecules in state A or B at a time is n times the probability a given molecule is in that state.

The classical model of enzyme activity, Michaelis–Menten kinetics, can be viewed as a Markov chain, where at each time step the reaction proceeds in some direction. While Michaelis-Menten is fairly straightforward, far more complicated reaction networks can also be modeled with Markov chains. [65]

An algorithm based on a Markov chain was also used to focus the fragment-based growth of chemicals in silico towards a desired class of compounds such as drugs or natural products. [66] As a molecule is grown, a fragment is selected from the nascent molecule as the "current" state. It is not aware of its past (that is, it is not aware of what is already bonded to it). It then transitions to the next state when a fragment is attached to it. The transition probabilities are trained on databases of authentic classes of compounds. [67]

Also, the growth (and composition) of copolymers may be modeled using Markov chains. Based on the reactivity ratios of the monomers that make up the growing polymer chain, the chain's composition may be calculated (for example, whether monomers tend to add in alternating fashion or in long runs of the same monomer). Due to steric effects, second-order Markov effects may also play a role in the growth of some polymer chains.

Similarly, it has been suggested that the crystallization and growth of some epitaxial superlattice oxide materials can be accurately described by Markov chains. [68]

### Biology

Markov chains are used in various areas of biology. Notable examples include:

### Testing

Several theorists have proposed the idea of the Markov chain statistical test (MCST), a method of conjoining Markov chains to form a "Markov blanket", arranging these chains in several recursive layers ("wafering") and producing more efficient test sets—samples—as a replacement for exhaustive testing. MCSTs also have uses in temporal state-based networks; Chilukuri et al.'s paper entitled "Temporal Uncertainty Reasoning Networks for Evidence Fusion with Applications to Object Detection and Tracking" (ScienceDirect) gives a background and case study for applying MCSTs to a wider range of applications.

Solar irradiance variability assessments are useful for solar power applications. Solar irradiance variability at any location over time is mainly a consequence of the deterministic variability of the sun's path across the sky dome and the variability in cloudiness. The variability of accessible solar irradiance on Earth's surface has been modeled using Markov chains, [71] [72] [73] [74] also including modeling the two states of clear and cloudiness as a two-state Markov chain. [75] [76]

### Speech recognition

Hidden Markov models are the basis for most modern automatic speech recognition systems.

### Information theory

Markov chains are used throughout information processing. Claude Shannon's famous 1948 paper A Mathematical Theory of Communication , which in a single step created the field of information theory, opens by introducing the concept of entropy through Markov modeling of the English language. Such idealized models can capture many of the statistical regularities of systems. Even without describing the full structure of the system perfectly, such signal models can make possible very effective data compression through entropy encoding techniques such as arithmetic coding. They also allow effective state estimation and pattern recognition. Markov chains also play an important role in reinforcement learning.

Markov chains are also the basis for hidden Markov models, which are an important tool in such diverse fields as telephone networks (which use the Viterbi algorithm for error correction), speech recognition and bioinformatics (such as in rearrangements detection [77] ).

The LZMA lossless data compression algorithm combines Markov chains with Lempel-Ziv compression to achieve very high compression ratios.

### Queueing theory

Markov chains are the basis for the analytical treatment of queues (queueing theory). Agner Krarup Erlang initiated the subject in 1917. [78] This makes them critical for optimizing the performance of telecommunications networks, where messages must often compete for limited resources (such as bandwidth). [79]

Numerous queueing models use continuous-time Markov chains. For example, an M/M/1 queue is a CTMC on the non-negative integers where upward transitions from i to i + 1 occur at rate λ according to a Poisson process and describe job arrivals, while transitions from i to i  1 (for i > 1) occur at rate μ (job service times are exponentially distributed) and describe completed services (departures) from the queue.

### Internet applications

The PageRank of a webpage as used by Google is defined by a Markov chain. [80] [81] [82] It is the probability to be at page ${\displaystyle i}$ in the stationary distribution on the following Markov chain on all (known) webpages. If ${\displaystyle N}$ is the number of known webpages, and a page ${\displaystyle i}$ has ${\displaystyle k_{i}}$ links to it then it has transition probability ${\displaystyle {\frac {\alpha }{k_{i}}}+{\frac {1-\alpha }{N}}}$ for all pages that are linked to and ${\displaystyle {\frac {1-\alpha }{N}}}$ for all pages that are not linked to. The parameter ${\displaystyle \alpha }$ is taken to be about 0.15. [83]

Markov models have also been used to analyze web navigation behavior of users. A user's web link transition on a particular website can be modeled using first- or second-order Markov models and can be used to make predictions regarding future navigation and to personalize the web page for an individual user.

### Statistics

Markov chain methods have also become very important for generating sequences of random numbers to accurately reflect very complicated desired probability distributions, via a process called Markov chain Monte Carlo (MCMC). In recent years this has revolutionized the practicability of Bayesian inference methods, allowing a wide range of posterior distributions to be simulated and their parameters found numerically.

### Economics and finance

Markov chains are used in finance and economics to model a variety of different phenomena, including the distribution of income, the size distribution of firms, asset prices and market crashes. D. G. Champernowne built a Markov chain model of the distribution of income in 1953. [84] Herbert A. Simon and co-author Charles Bonini used a Markov chain model to derive a stationary Yule distribution of firm sizes. [85] Louis Bachelier was the first to observe that stock prices followed a random walk. [86] The random walk was later seen as evidence in favor of the efficient-market hypothesis and random walk models were popular in the literature of the 1960s. [87] Regime-switching models of business cycles were popularized by James D. Hamilton (1989),who used a Markov chain to model switches between periods high and low GDP growth (or alternatively, economic expansions and recessions). [88] A more recent example is the Markov switching multifractal model of Laurent E. Calvet and Adlai J. Fisher, which builds upon the convenience of earlier regime-switching models. [89] [90] It uses an arbitrarily large Markov chain to drive the level of volatility of asset returns.

Dynamic macroeconomics makes heavy use of Markov chains. An example is using Markov chains to exogenously model prices of equity (stock) in a general equilibrium setting. [91]

Credit rating agencies produce annual tables of the transition probabilities for bonds of different credit ratings. [92]

### Social sciences

Markov chains are generally used in describing path-dependent arguments, where current structural configurations condition future outcomes. An example is the reformulation of the idea, originally due to Karl Marx's Das Kapital , tying economic development to the rise of capitalism. In current research, it is common to use a Markov chain to model how once a country reaches a specific level of economic development, the configuration of structural factors, such as size of the middle class, the ratio of urban to rural residence, the rate of political mobilization, etc., will generate a higher probability of transitioning from authoritarian to democratic regime. [93]

### Games

Markov chains can be used to model many games of chance. [1] The children's games Snakes and Ladders and "Hi Ho! Cherry-O", for example, are represented exactly by Markov chains. At each turn, the player starts in a given state (on a given square) and from there has fixed odds of moving to certain other states (squares).

### Music

Markov chains are employed in algorithmic music composition, particularly in software such as Csound, Max, and SuperCollider. In a first-order chain, the states of the system become note or pitch values, and a probability vector for each note is constructed, completing a transition probability matrix (see below). An algorithm is constructed to produce output note values based on the transition matrix weightings, which could be MIDI note values, frequency (Hz), or any other desirable metric. [94]

1st-order matrix
NoteACE
A0.10.60.3
C0.250.050.7
E0.70.30
2nd-order matrix
AA0.180.60.22
AG0.150.750.1
DD001
DA0.2500.75
DG0.90.10
GG0.40.40.2
GA0.50.250.25
GD100

A second-order Markov chain can be introduced by considering the current state and also the previous state, as indicated in the second table. Higher, nth-order chains tend to "group" particular notes together, while 'breaking off' into other patterns and sequences occasionally. These higher-order chains tend to generate results with a sense of phrasal structure, rather than the 'aimless wandering' produced by a first-order system. [95]

Markov chains can be used structurally, as in Xenakis's Analogique A and B. [96] Markov chains are also used in systems which use a Markov model to react interactively to music input. [97]

Usually musical systems need to enforce specific control constraints on the finite-length sequences they generate, but control constraints are not compatible with Markov models, since they induce long-range dependencies that violate the Markov hypothesis of limited memory. In order to overcome this limitation, a new approach has been proposed. [98]

### Baseball

Markov chain models have been used in advanced baseball analysis since 1960, although their use is still rare. Each half-inning of a baseball game fits the Markov chain state when the number of runners and outs are considered. During any at-bat, there are 24 possible combinations of number of outs and position of the runners. Mark Pankin shows that Markov chain models can be used to evaluate runs created for both individual players as well as a team. [99] He also discusses various kinds of strategies and play conditions: how Markov chain models have been used to analyze statistics for game situations such as bunting and base stealing and differences when playing on grass vs. AstroTurf. [100]

### Markov text generators

Markov processes can also be used to generate superficially real-looking text given a sample document. Markov processes are used in a variety of recreational "parody generator" software (see dissociated press, Jeff Harrison, [101] Mark V. Shaney, [102] [103] and Academias Neutronium). Several open-source text generation libraries using Markov chains exist, including The RiTa Toolkit.

### Probabilistic forecasting

Markov chains have been used for forecasting in several areas: for example, price trends, [104] wind power, [105] and solar irradiance. [106] The Markov chain forecasting models utilize a variety of settings, from discretizing the time series, [105] to hidden Markov models combined with wavelets, [104] and the Markov chain mixture distribution model (MCM). [106]

## Notes

1. Gagniuc, Paul A. (2017). Markov Chains: From Theory to Implementation and Experimentation. USA, NJ: John Wiley & Sons. pp. 1–235. ISBN   978-1-119-38755-8.
2. "Markov chain | Definition of Markov chain in US English by Oxford Dictionaries". Oxford Dictionaries | English. Retrieved 2017-12-14.
3. Definition at Brilliant.org "Brilliant Math and Science Wiki". Retrieved on 12 May 2019
4. Samuel Karlin; Howard E. Taylor (2 December 2012). A First Course in Stochastic Processes. Academic Press. p. 47. ISBN   978-0-08-057041-9. Archived from the original on 23 March 2017.
5. Bruce Hajek (12 March 2015). Random Processes for Engineers. Cambridge University Press. ISBN   978-1-316-24124-0. Archived from the original on 23 March 2017.
6. G. Latouche; V. Ramaswami (1 January 1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM. pp. 4–. ISBN   978-0-89871-425-8. Archived from the original on 23 March 2017.
7. Sean Meyn; Richard L. Tweedie (2 April 2009). Markov Chains and Stochastic Stability. Cambridge University Press. p. 3. ISBN   978-0-521-73182-9. Archived from the original on 23 March 2017.
8. Reuven Y. Rubinstein; Dirk P. Kroese (20 September 2011). Simulation and the Monte Carlo Method. John Wiley & Sons. p. 225. ISBN   978-1-118-21052-9. Archived from the original on 23 March 2017.
9. Dani Gamerman; Hedibert F. Lopes (10 May 2006). Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference, Second Edition. CRC Press. ISBN   978-1-58488-587-0. Archived from the original on 23 March 2017.
10. . Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)
11. Øksendal, B. K. (Bernt Karsten) (2003). Stochastic differential equations : an introduction with applications (6th ed.). Berlin: Springer. ISBN   3540047581. OCLC   52203046.
12. Søren Asmussen (15 May 2003). Applied Probability and Queues. Springer Science & Business Media. p. 7. ISBN   978-0-387-00211-8. Archived from the original on 23 March 2017.
13. Emanuel Parzen (17 June 2015). Stochastic Processes. Courier Dover Publications. p. 188. ISBN   978-0-486-79688-8. Archived from the original on 20 November 2017.
14. Samuel Karlin; Howard E. Taylor (2 December 2012). A First Course in Stochastic Processes. Academic Press. pp. 29 and 30. ISBN   978-0-08-057041-9. Archived from the original on 23 March 2017.
15. John Lamperti (1977). Stochastic processes: a survey of the mathematical theory. Springer-Verlag. pp. 106–121. ISBN   978-3-540-90275-1. Archived from the original on 2017-03-23.
16. Sheldon M. Ross (1996). Stochastic processes. Wiley. pp. 174 and 231. ISBN   978-0-471-12062-9. Archived from the original on 2017-03-23.
17. Everitt, B.S. (2002) The Cambridge Dictionary of Statistics. CUP. ISBN   0-521-81099-X
18. Parzen, E. (1962) Stochastic Processes, Holden-Day. ISBN   0-8162-6664-6 (Table 6.1)
19. Dodge, Y. (2003) The Oxford Dictionary of Statistical Terms, OUP. ISBN   0-19-920613-9 (entry for "Markov chain")
20. Dodge, Y. The Oxford Dictionary of Statistical Terms, OUP. ISBN   0-19-920613-9
21. Meyn, S. Sean P., and Richard L. Tweedie. (2009) Markov chains and stochastic stability. Cambridge University Press. (Preface, p. iii)
22. Gagniuc, Paul A. (2017). Markov Chains: From Theory to Implementation and Experimentation. USA, NJ: John Wiley & Sons. pp. 159–163. ISBN   978-1-119-38755-8.
23. Gagniuc, Paul A. (2017). Markov Chains: From Theory to Implementation and Experimentation. USA, NJ: John Wiley & Sons. pp. 2–8. ISBN   978-1-119-38755-8.
24. Charles Miller Grinstead; James Laurie Snell (1997). Introduction to Probability. American Mathematical Soc. pp.  464–466. ISBN   978-0-8218-0749-1.
25. Pierre Bremaud (9 March 2013). Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer Science & Business Media. p. ix. ISBN   978-1-4757-3124-8. Archived from the original on 23 March 2017.
26. Hayes, Brian (2013). "First links in the Markov chain". American Scientist. 101 (2): 92–96. doi:10.1511/2013.101.92.
27. Sheldon M. Ross (1996). Stochastic processes. Wiley. pp. 235 and 358. ISBN   978-0-471-12062-9. Archived from the original on 2017-03-23.
28. Jarrow, Robert; Protter, Philip (2004). "A short history of stochastic integration and mathematical finance: The early years, 1880–1970". A Festschrift for Herman Rubin. Institute of Mathematical Statistics Lecture Notes – Monograph Series. pp. 75–91. CiteSeerX  . doi:10.1214/lnms/1196285381. ISBN   978-0-940600-61-4. ISSN   0749-2170.
29. Guttorp, Peter; Thorarinsdottir, Thordis L. (2012). "What Happened to Discrete Chaos, the Quenouille Process, and the Sharp Markov Property? Some History of Stochastic Point Processes". International Statistical Review. 80 (2): 253–268. doi:10.1111/j.1751-5823.2012.00181.x. ISSN   0306-7734.
30. Seneta, E. (1996). "Markov and the Birth of Chain Dependence Theory". International Statistical Review / Revue Internationale de Statistique. 64 (3): 255–257. doi:10.2307/1403785. ISSN   0306-7734. JSTOR   1403785.
31. Seneta, E. (1998). "I.J. Bienaymé [1796–1878]: Criticality, Inequality, and Internationalization". International Statistical Review / Revue Internationale de Statistique. 66 (3): 291–292. doi:10.2307/1403518. ISSN   0306-7734. JSTOR   1403518.
32. Bru B, Hertz S (2001). "Maurice Fréchet". In Heyde CC, Seneta E, Crépel P, Fienberg SE, Gani J (eds.). Statisticians of the Centuries. New York, NY: Springer. pp. 331–334. doi:10.1007/978-1-4613-0179-0_71. ISBN   978-0-387-95283-3.
33. Kendall, D. G.; Batchelor, G. K.; Bingham, N. H.; Hayman, W. K.; Hyland, J. M. E.; Lorentz, G. G.; Moffatt, H. K.; Parry, W.; Razborov, A. A.; Robinson, C. A.; Whittle, P. (1990). "Andrei Nikolaevich Kolmogorov (1903–1987)". Bulletin of the London Mathematical Society. 22 (1): 33. doi:10.1112/blms/22.1.31. ISSN   0024-6093.
34. Cramér, Harald (1976). "Half a Century with Probability Theory: Some Personal Recollections". The Annals of Probability. 4 (4): 509–546. doi:. ISSN   0091-1798.
35. Marc Barbut; Bernard Locker; Laurent Mazliak (23 August 2016). Paul Lévy and Maurice Fréchet: 50 Years of Correspondence in 107 Letters. Springer London. p. 5. ISBN   978-1-4471-7262-8. Archived from the original on 23 March 2017.
36. Valeriy Skorokhod (5 December 2005). Basic Principles and Applications of Probability Theory. Springer Science & Business Media. p. 146. ISBN   978-3-540-26312-8. Archived from the original on 23 March 2017.
37. Bernstein, Jeremy (2005). "Bachelier". American Journal of Physics. 73 (5): 395–398. Bibcode:2005AmJPh..73..395B. doi:10.1119/1.1848117. ISSN   0002-9505.
38. William J. Anderson (6 December 2012). Continuous-Time Markov Chains: An Applications-Oriented Approach. Springer Science & Business Media. p. vii. ISBN   978-1-4612-3038-0. Archived from the original on 23 March 2017.
39. Kendall, D. G.; Batchelor, G. K.; Bingham, N. H.; Hayman, W. K.; Hyland, J. M. E.; Lorentz, G. G.; Moffatt, H. K.; Parry, W.; Razborov, A. A.; Robinson, C. A.; Whittle, P. (1990). "Andrei Nikolaevich Kolmogorov (1903–1987)". Bulletin of the London Mathematical Society. 22 (1): 57. doi:10.1112/blms/22.1.31. ISSN   0024-6093.
40. Ionut Florescu (7 November 2014). Probability and Stochastic Processes. John Wiley & Sons. pp. 373 and 374. ISBN   978-1-118-59320-2. Archived from the original on 23 March 2017.
41. Samuel Karlin; Howard E. Taylor (2 December 2012). A First Course in Stochastic Processes. Academic Press. p. 49. ISBN   978-0-08-057041-9. Archived from the original on 23 March 2017.
42. Gagniuc, Paul A. (2017). Markov Chains: From Theory to Implementation and Experimentation. USA, NJ: John Wiley & Sons. pp. 1–2. ISBN   978-1-119-38755-8.
43. Weiss, George H. (2006). "Random Walks". Encyclopedia of Statistical Sciences. p. 1. doi:10.1002/0471667196.ess2180.pub2. ISBN   978-0471667193.
44. Michael F. Shlesinger (1985). The Wonderful world of stochastics: a tribute to Elliott W. Montroll. North-Holland. pp. 8–10. ISBN   978-0-444-86937-1. Archived from the original on 2017-03-23.
45. Emanuel Parzen (17 June 2015). Stochastic Processes. Courier Dover Publications. p. 7 and 8. ISBN   978-0-486-79688-8. Archived from the original on 20 November 2017.
46. Joseph L. Doob (1990). Stochastipoic processes. Wiley. p. 46 and 47. Archived from the original on 2017-11-20.
47. Donald L. Snyder; Michael I. Miller (6 December 2012). Random Point Processes in Time and Space. Springer Science & Business Media. p. 32. ISBN   978-1-4612-3166-0. Archived from the original on 20 November 2017.
48. Norris, J. R. (1997). "Continuous-time Markov chains I". Markov Chains. pp. 60–107. doi:10.1017/CBO9780511810633.004. ISBN   9780511810633.
49. Serfozo, Richard (2009). . Probability and Its Applications. doi:10.1007/978-3-540-89332-5. ISBN   978-3-540-89331-8. ISSN   1431-7028.
50. "Chapter 11 "Markov Chains"" (PDF). Archived (PDF) from the original on 2017-02-15. Retrieved 2017-06-02.
51. Schmitt, Florian; Rothlauf, Franz (2001). "On the Importance of the Second Largest Eigenvalue on the Convergence Rate of Genetic Algorithms". Proceedings of the 14th Symposium on Reliable Distributed Systems. CiteSeerX  .
52. Rosenthal, Jeffrey S. (1995). "Convergence Rates for Markov Chains". SIAM Review. 37 (3): 387–405. doi:10.1137/1037083. ISSN   0036-1445. JSTOR   2132659 . Retrieved 2021-05-31.
53. Franzke, Brandon; Kosko, Bart (1 October 2011). "Noise can speed convergence in Markov chains". Physical Review E. 84 (4): 041112. Bibcode:2011PhRvE..84d1112F. doi:10.1103/PhysRevE.84.041112. PMID   22181092.
54. Spitzer, Frank (1970). "Interaction of Markov Processes". Advances in Mathematics . 5 (2): 246–290. doi:.
55. R. L. Dobrushin; V. I. Kri︠u︡kov; A. L. Toom (1978). Stochastic Cellular Systems: Ergodicity, Memory, Morphogenesis. ISBN   9780719022067. Archived from the original on 2017-02-05. Retrieved 2016-03-04.
56. Doblinger, G. (September 1998). "Smoothing of noisy AR signals using an adaptive Kalman filter" (PDF). 9th European Signal Processing Conference (EUSIPCO 1998): 781–784.
57. Norris, J. R. (1997). "Continuous-time Markov chains II". Markov Chains. pp. 108–127. doi:10.1017/CBO9780511810633.005. ISBN   9780511810633.
58. Matthew Nicol and Karl Petersen, (2009) "Ergodic Theory: Basic Examples and Constructions", Encyclopedia of Complexity and Systems Science, Springer https://doi.org/10.1007/978-0-387-30440-3_177
59. Fitzpatrick, Richard. "Thermodynamics and Statistical Mechanics" (PDF). Archived (PDF) from the original on 2016-11-30. Retrieved 2017-06-02.
60. van Ravenzwaaij, Don; Cassey, Pete; Brown, Scott D. (2016-03-11). "A simple introduction to Markov Chain Monte–Carlo sampling". Psychonomic Bulletin & Review. 25 (1): 143–154. doi:10.3758/s13423-016-1015-8. ISSN   1069-9384. PMC  . PMID   26968853.
61. Ryder, Lewis H. (1985). . Cambridge [Cambridgeshire]: Cambridge University Press. pp.  160. ISBN   978-0521338592. OCLC   10533049.
62. Gattringer, Christof; Lang, Christian B (2010). Quantum Chromodynamics on the Lattice. Lecture Notes in Physics. 788. Springer-Verlag Berlin Heidelberg. doi:10.1007/978-3-642-01850-3. ISBN   978-3-642-01849-7. Archived from the original on 2017-08-01.
63. Anderson, David F.; Kurtz, Thomas G. (2011), "Continuous Time Markov Chain Models for Chemical Reaction Networks", Design and Analysis of Biomolecular Circuits, Springer New York, pp. 3–42, doi:10.1007/978-1-4419-6766-4_1, ISBN   9781441967657
64. Du, Chao; Kou, S. C. (September 2012). "Correlation analysis of enzymatic reaction of a single protein molecule". The Annals of Applied Statistics. 6 (3): 950–976. arXiv:. Bibcode:2012arXiv1209.6210D. doi:10.1214/12-aoas541. ISSN   1932-6157. PMC  . PMID   23408514.
65. Kutchukian, Peter; Lou, David; Shakhnovich, Eugene (2009). "FOG: Fragment Optimized Growth Algorithm for the de Novo Generation of Molecules occupying Druglike Chemical". Journal of Chemical Information and Modeling. 49 (7): 1630–1642. doi:10.1021/ci9000458. PMID   19527020.
66. Kutchukian, Peter S.; Lou, David; Shakhnovich, Eugene I. (2009-06-15). "FOG: Fragment Optimized Growth Algorithm for the de Novo Generation of Molecules Occupying Druglike Chemical Space". Journal of Chemical Information and Modeling. 49 (7): 1630–1642. doi:10.1021/ci9000458. ISSN   1549-9596. PMID   19527020.
67. Kopp, V. S.; Kaganer, V. M.; Schwarzkopf, J.; Waidick, F.; Remmele, T.; Kwasniewski, A.; Schmidbauer, M. (2011). "X-ray diffraction from nonperiodic layered structures with correlations: Analytical calculation and experiment on mixed Aurivillius films". Acta Crystallographica Section A. 68 (Pt 1): 148–155. Bibcode:2012AcCrA..68..148K. doi:10.1107/S0108767311044874. PMID   22186291.
68. George, Dileep; Hawkins, Jeff (2009). Friston, Karl J. (ed.). "Towards a Mathematical Theory of Cortical Micro-circuits". PLOS Comput Biol. 5 (10): e1000532. Bibcode:2009PLSCB...5E0532G. doi:10.1371/journal.pcbi.1000532. PMC  . PMID   19816557.
69. Gupta, Ankur; Rawlings, James B. (April 2014). "Comparison of Parameter Estimation Methods in Stochastic Chemical Kinetic Models: Examples in Systems Biology". AIChE Journal. 60 (4): 1253–1268. doi:10.1002/aic.14409. PMC  . PMID   27429455.
70. Aguiar, R. J.; Collares-Pereira, M.; Conde, J. P. (1988). "Simple procedure for generating sequences of daily radiation values using a library of Markov transition matrices". Solar Energy. 40 (3): 269–279. Bibcode:1988SoEn...40..269A. doi:10.1016/0038-092X(88)90049-7.
71. Ngoko, B. O.; Sugihara, H.; Funaki, T. (2014). "Synthetic generation of high temporal resolution solar radiation data using Markov models". Solar Energy. 103: 160–170. Bibcode:2014SoEn..103..160N. doi:10.1016/j.solener.2014.02.026.
72. Bright, J. M.; Smith, C. I.; Taylor, P. G.; Crook, R. (2015). "Stochastic generation of synthetic minutely irradiance time series derived from mean hourly weather observation data". Solar Energy. 115: 229–242. Bibcode:2015SoEn..115..229B. doi:.
73. Munkhammar, J.; Widén, J. (2018). "An N-state Markov-chain mixture distribution model of the clear-sky index". Solar Energy. 173: 487–495. Bibcode:2018SoEn..173..487M. doi:10.1016/j.solener.2018.07.056.
74. Morf, H. (1998). "The stochastic two-state solar irradiance model (STSIM)". Solar Energy. 62 (2): 101–112. Bibcode:1998SoEn...62..101M. doi:10.1016/S0038-092X(98)00004-8.
75. Munkhammar, J.; Widén, J. (2018). "A Markov-chain probability distribution mixture approach to the clear-sky index". Solar Energy. 170: 174–183. Bibcode:2018SoEn..170..174M. doi:10.1016/j.solener.2018.05.055.
76. Pratas, D; Silva, R; Pinho, A; Ferreira, P (May 18, 2015). "An alignment-free method to find and visualise rearrangements between pairs of DNA sequences". Scientific Reports. 5 (10203): 10203. Bibcode:2015NatSR...510203P. doi:10.1038/srep10203. PMC  . PMID   25984837.
77. S. P. Meyn, 2007. Control Techniques for Complex Networks Archived 2015-05-13 at the Wayback Machine , Cambridge University Press, 2007.
78. Gupta, Brij; Agrawal, Dharma P.; Yamaguchi, Shingo (16 May 2016). Handbook of Research on Modern Cryptographic Solutions for Computer and Cyber Security. IGI Global. pp. 448–. ISBN   978-1-5225-0106-0. Archived from the original on 23 March 2017.
79. Langville, Amy N.; Meyer, Carl D. (2006). "A Reordering for the PageRank Problem" (PDF). SIAM Journal on Scientific Computing. 27 (6): 2112–2113. CiteSeerX  . doi:10.1137/040607551. ISSN   1064-8275. Archived (PDF) from the original on 2017-09-21.
80. Page, Lawrence; Brin, Sergey; Motwani, Rajeev; Winograd, Terry (1999). The PageRank Citation Ranking: Bringing Order to the Web (Technical report). CiteSeerX  .
81. Champernowne, D (1953). "A model of income distribution". The Economic Journal. 63 (250): 318–51. doi:10.2307/2227127. JSTOR   2227127.
82. Simon, Herbert; C Bonini (1958). "The size distribution of business firms". Am. Econ. Rev. 42: 425–40.
83. Bachelier, Louis (1900). "Théorie de la spéculation". Annales Scientifiques de l'École Normale Supérieure. 3: 21–86. doi:10.24033/asens.476. hdl:.
84. e.g.Fama, E (1965). "The behavior of stock market prices". Journal of Business. 38.
85. Hamilton, James (1989). "A new approach to the economic analysis of nonstationary time series and the business cycle". Econometrica. 57 (2): 357–84. CiteSeerX  . doi:10.2307/1912559. JSTOR   1912559.
86. Calvet, Laurent E.; Fisher, Adlai J. (2001). "Forecasting Multifractal Volatility". Journal of Econometrics . 105 (1): 27–58. doi:10.1016/S0304-4076(01)00069-0. S2CID   119394176.
87. Calvet, Laurent; Adlai Fisher (2004). "How to Forecast long-run volatility: regime-switching and the estimation of multifractal processes". Journal of Financial Econometrics. 2: 49–83. CiteSeerX  . doi:10.1093/jjfinec/nbh003. S2CID   6020401.
88. Brennan, Michael; Xiab, Yihong. "Stock Price Volatility and the Equity Premium" (PDF). Department of Finance, the Anderson School of Management, UCLA. Archived from the original (PDF) on 2008-12-28.
89. "A Markov Chain Example in Credit Risk Modelling Columbia University lectures" (PDF). Archived from the original (PDF) on March 24, 2016.
90. Acemoglu, Daron; Georgy Egorov; Konstantin Sonin (2011). "Political model of social evolution". Proceedings of the National Academy of Sciences. 108: 21292–21296. Bibcode:2011PNAS..10821292A. CiteSeerX  . doi:. PMC  . PMID   22198760.
91. K McAlpine; E Miranda; S Hoggar (1999). "Making Music with Algorithms: A Case-Study System". Computer Music Journal. 23 (2): 19–30. doi:10.1162/014892699559733. S2CID   40057162.
92. Curtis Roads (ed.) (1996). The Computer Music Tutorial. MIT Press. ISBN   978-0-262-18158-7.CS1 maint: extra text: authors list (link)
93. Xenakis, Iannis; Kanach, Sharon (1992) Formalized Music: Mathematics and Thought in Composition, Pendragon Press. ISBN   1576470792
94. "Continuator". Archived from the original on July 13, 2012.
95. Pachet, F.; Roy, P.; Barbieri, G. (2011) "Finite-Length Markov Processes with Constraints" Archived 2012-04-14 at the Wayback Machine , Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI, pages 635–642, Barcelona, Spain, July 2011
96. Pankin, Mark D. "MARKOV CHAIN MODELS: THEORETICAL BACKGROUND". Archived from the original on 2007-12-09. Retrieved 2007-11-26.
97. Pankin, Mark D. "BASEBALL AS A MARKOV CHAIN". Archived from the original on 2009-05-13. Retrieved 2009-04-24.
98. "Poet's Corner – Fieralingue". Archived from the original on December 6, 2010.
99. Kenner, Hugh; O'Rourke, Joseph (November 1984). "A Travesty Generator for Micros". BYTE. 9 (12): 129–131, 449–469.
100. Hartman, Charles (1996). . Hanover, NH: Wesleyan University Press. ISBN   978-0-8195-2239-9.
101. de Souza e Silva, E.G.; Legey, L.F.L.; de Souza e Silva, E.A. (2010). "Forecasting oil price trends using wavelets and hidden Markov models". Energy Economics. 32.
102. Carpinone, A; Giorgio, M; Langella, R.; Testa, A. (2015). "Markov chain modeling for very-short-term wind power forecasting". Electric Power Systems Research. 122: 152–158. doi:.
103. Munkhammar, J.; van der Meer, D.W.; Widén, J. (2019). "Probabilistic forecasting of high-resolution clear-sky index time-series using a Markov-chain mixture distribution model". Solar Energy. 184: 688–695. Bibcode:2019SoEn..184..688M. doi:10.1016/j.solener.2019.04.014.

## Related Research Articles

In mathematics, a stochastic matrix is a square matrix used to describe the transitions of a Markov chain. Each of its entries is a nonnegative real number representing a probability. It is also called a probability matrix, transition matrix, substitution matrix, or Markov matrix. The stochastic matrix was first developed by Andrey Markov at the beginning of the 20th century, and has found use throughout a wide variety of scientific fields, including probability theory, statistics, mathematical finance and linear algebra, as well as computer science and population genetics. There are several different definitions and types of stochastic matrices:

A continuous-time Markov chain (CTMC) is a continuous stochastic process in which, for each state, the process will change state according to an exponential random variable and then move to a different state as specified by the probabilities of a stochastic matrix. An equivalent formulation describes the process as changing state according to the least value of a set of exponential random variables, one for each possible state it can move to, with the parameters determined by the current state.

In probability, a discrete-time Markov chain (DTMC) is a sequence of random variables, known as a stochastic process, in which the value of the next variable depends only on the value of the current variable, and not any variables in the past. For instance, a machine may have two states, A and E. When it is in state A, there is a 40% chance of it moving to state E and a 60% chance of it remaining in state A. When it is in state E, there is a 70% chance of it moving to A and a 30% chance of it staying in E. The sequence of states of the machine is a Markov chain. If we denote the chain by then is the state which the machine starts in and is the random variable describing its state after 10 transitions. The process continues forever, indexed by the natural numbers.

A phase-type distribution is a probability distribution constructed by a convolution or mixture of exponential distributions. It results from a system of one or more inter-related Poisson processes occurring in sequence, or phases. The sequence in which each of the phases occur may itself be a stochastic process. The distribution can be represented by a random variable describing the time until absorption of a Markov process with one absorbing state. Each of the states of the Markov process represents one of the phases.

In mathematics, the Cheeger bound is a bound of the second largest eigenvalue of the transition matrix of a finite-state, discrete-time, reversible stationary Markov chain. It can be seen as a special case of Cheeger inequalities in expander graphs.

A number of different Markov models of DNA sequence evolution have been proposed. These substitution models differ in terms of the parameters used to describe the rates at which one nucleotide replaces another during evolution. These models are frequently used in molecular phylogenetic analyses. In particular, they are used during the calculation of likelihood of a tree and they are used to estimate the evolutionary distance between sequences from the observed differences between the sequences.

The discrete phase-type distribution is a probability distribution that results from a system of one or more inter-related geometric distributions occurring in sequence, or phases. The sequence in which each of the phases occur may itself be a stochastic process. The distribution can be represented by a random variable describing the time until absorption of an absorbing Markov chain with one absorbing state. Each of the states of the Markov chain represents one of the phases.

In probability theory, the telegraph process is a memoryless continuous-time stochastic process that shows two distinct values. It models burst noise. If the two possible values that a random variable can take are and , then the process can be described by the following master equations:

In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue.

Multiple-try Metropolis (MTM) is a sampling method that is a modified form of the Metropolis–Hastings method, first presented by Liu, Liang, and Wong in 2000. It is designed to help the sampling trajectory converge faster, by increasing both the step size and the acceptance rate.

In probability theory, a balance equation is an equation that describes the probability flux associated with a Markov chain in and out of states or set of states.

In queueing theory, a discipline within the mathematical theory of probability, the M/M/c queue is a multi-server queueing model. In Kendall's notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers, and job service times are exponentially distributed. It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.

In probability theory, uniformization method, is a method to compute transient solutions of finite state continuous-time Markov chains, by approximating the process by a discrete time Markov chain. The original chain is scaled by the fastest transition rate γ, so that transitions occur at the same rate in every state, hence the name. The method is simple to program and efficiently calculates an approximation to the transient distribution at a single point in time. The method was first introduced by Winfried Grassmann in 1977.

In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian, service times have a General distribution and there is a single server. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.

In queueing theory, a discipline within the mathematical theory of probability, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The model has been used to approximate discrete models, model the spread of wildfires, in ruin theory and to model high speed data networks. The model applies the leaky bucket algorithm to a stochastic source.

In queueing theory, a discipline within the mathematical theory of probability, the M/M/∞ queue is a multi-server queueing model where every arrival experiences immediate service and does not wait. In Kendall's notation it describes a system where arrivals are governed by a Poisson process, there are infinitely many servers, so jobs do not need to wait for a server. Each job has an exponentially distributed service time. It is a limit of the M/M/c queue model where the number of servers c becomes very large.

In queueing theory, a discipline within the mathematical theory of probability, an M/D/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times are fixed (deterministic). The model name is written in Kendall's notation. Agner Krarup Erlang first published on this model in 1909, starting the subject of queueing theory. An extension of this model with more than one server is the M/D/c queue.

In probability theory, a transition rate matrix is an array of numbers describing the instantaneous rate at which a continuous time Markov chain transitions between states.

In probability theory, the matrix analytic method is a technique to compute the stationary probability distribution of a Markov chain which has a repeating structure and a state space which grows unboundedly in no more than one dimension. Such models are often described as M/G/1 type Markov chains because they can describe transitions in an M/G/1 queue. The method is a more complicated version of the matrix geometric method and is the classical solution method for M/G/1 chains.

In probability theory, Kelly's lemma states that for a stationary continuous time Markov chain, a process defined as the time-reversed process has the same stationary distribution as the forward-time process. The theorem is named after Frank Kelly.