Kolmogorov equations (Markov jump process)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (January 2012) (Learn how and when to remove this template message)

|

In the context of a continuous-time Markov process, the Kolmogorov equations, including Kolmogorov forward equations and Kolmogorov backward equations, are a pair of systems of differential equations that describe the time-evolution of the probability P(x,s;y,t), where x,y∈Ω (the state space) and t>s are the final and initial time respectively.

## Contents

* 1 The equations
* 2 Background
* 3 Relation with the generating function
* 4 History
* 5 See also
* 6 References

## The equations

For the case of a countable state space we put i,j in place of x,y. The Kolmogorov forward equations read

∂Pij∂t(s;t)=∑kPik(s;t)Akj(t),

where A(t) is the transition rate matrix (also known as the generator matrix),

while the Kolmogorov backward equations are

∂Pij∂s(s;t)=−∑kAik(s)Pkj(s;t)

The functions Pij(s;t) are continuous and differentiable in both time arguments. They represent the probability that the system that was in state i at time s jumps to state j at some later time t>s. The continuous quantities Aij(t) satisfy

Aij(t)=[∂Pij∂u(t;u)]u=t,Ajk(t)≥0, j≠k,∑kAjk(t)=0.

## Background

The original derivation of the equations by Kolmogorov starts with the Chapman–Kolmogorov equation (Kolmogorov called it fundamental equation) for time-continuous and differentiable Markov processes on a finite, discrete state space.[1] In this formulation, it is assumed that the probabilities P(i,s;j,t) are continuous and differentiable functions of t>s. Also, adequate limit properties for the derivatives are assumed. Feller derives the equations under slightly different conditions, starting with the concept of purely discontinuous Markov process and then formulating them for more general state spaces.[2] Feller proves the existence of solutions of probabilistic character to the Kolmogorov forward equations and Kolmogorov backward equations under natural conditions.[2]

## Relation with the generating function

Still in the discrete state case, letting s=0 and assuming that the system initially is found in state i, the Kolmogorov forward equations describe an initial-value problem for finding the probabilities of the process, given the quantities Ajk(t). We write pk(t)=Pik(0;t) where ∑kpk(t)=1, then

dpkdt(t)=∑jAjk(t)pj(t);pk(0)=δik,k=0,1,….

For the case of a pure death process with constant rates the only nonzero coefficients are Aj,j−1=μ, j≥1. Letting

Ψ(x,t)=∑kxkpk(t),

the system of equations can in this case be recast as a partial differential equation for Ψ(x,t) with initial condition Ψ(x,0)=xi. After some manipulations, the system of equations reads,[3]

∂Ψ∂t(x,t)=μ(1−x)∂Ψ∂x(x,t);Ψ(x,0)=xi,Ψ(1,t)=1.

## History

A brief historical note can be found at Kolmogorov equations.

## See also

* Continuous-time Markov process
* Jump process
* Master equation
* Fokker–Planck equation
* Kolmogorov backward equations (diffusion)

## References

1. ↑ Kolmogoroff, A. (1931). "Über die analytischen Methoden in der Wahrscheinlichkeitsrechnung". Mathematische Annalen 104: 415–458. doi:10.1007/BF01457949.
2. ↑ 2.0 2.1 Feller, Willy (1940) "On the Integro-Differential Equations of Purely Discontinuous Markoff Processes", Transactions of the American Mathematical Society, 48 (3), 488-515 JSTOR 1990095
3. ↑ Bailey, Norman T.J. (1990) The Elements of Stochastic Processes with Applications to the Natural Sciences, Wiley. ISBN 0-471-52368-2 (page 90)

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Kolmogorov_equations_(Markov_jump_process)&oldid=183475"