Chapman-Kolmogorov equation
From Wikipedia, the free encyclopedia
In mathematics, specifically in probability theory, and yet more specifically in the theory of stochastic processes, the Chapman-Kolmogorov equation is an identity relating the joint probability distributions of different sets of coordinates on a stochastic process.
Suppose that { fi } is an indexed collection of random variables, that is, a stochastic process. Let
be the joint probability density function of the values of the random variables f1 to fn. Then, the Chapman-Kolmogorov equation is
i.e. a straightforward marginalization over the nuisance variable.
(Note that we have not yet assumed anything about the temporal (or any other) ordering of the random variables -- the above equation applies equally to the marginalization of any of them).
[edit] Particularization to Markov chains
When the stochastic process under consideration is Markovian, the Chapman-Kolmogorov equation is equivalent to an identity on transition densities. In the Markov chain setting, one assumes that . Then, because of the Markov property,
where the conditional probability is the transition probability between the times i > j. So, the Chapman-Kolmogorov equation takes the form
When the probability distribution on the state space of a Markov chain is discrete and the Markov chain is homogeneous, the Chapman-Kolmogorov equations can be expressed in terms of (possibly infinite-dimensional) matrix multiplication, thus:
where P(t) is the transition matrix, i.e., if Xt is the state of the process at time t, then for any two points i and j in the state space, we have
[edit] See also
[edit] References
- The Legacy of Andrei Nikolaevich Kolmogorov Curriculum Vitae and Biography. Kolmogorov School. Ph.D. students and descendants of A.N. Kolmogorov. A.N. Kolmogorov works, books, papers, articles. Photographs and Portraits of A.N. Kolmogorov.
- Eric W. Weisstein, Chapman-Kolmogorov Equation at MathWorld.