BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 56 definitions for Chapman.  Also try: Kolmogorov's theorem.

Chapman-Kolmogorov equation

Print-Friendly
About 1 pages (325 words)

Bookmark and Share Questions on this topic? Just ask!

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

<math>p_{i_1,\ldots,i_n}(f_1,\ldots,f_n)</math>

be the joint probability density function of the values of the random variables f1 to fn. Then, the Chapman-Kolmogorov equation is

<math>p_{i_1,\ldots,i_{n-1}}(f_1,\ldots,f_{n-1})=\int_{-\infty}^{\infty}p_{i_1,\ldots,i_n}(f_1,\ldots,f_n)\,df_n</math>

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).

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 <math>i_1<\ldots<i_n</math>. Then, because of the Markov property,

<math>p_{i_1,\ldots,i_n}(f_1,\ldots,f_n)=p_{i_1}(f_1)p_{i_2;i_1}(f_2\mid f_1)\cdots p_{i_n;i_{n-1}}(f_n\mid

f_{n-1}),</math> where the conditional probability <math>p_{i;j}(f_i\mid f_j)</math> is the transition probability between the times <math>i>j</math>. So, the Chapman-Kolmogorov equation takes the form

<math>p_{i_3;i_1}(f_3\mid f_1)=\int_{-\infty}^\infty p_{i_3;i_2}(f_3\mid f_2)p_{i_2;i_1}(f_2\mid f_1)df_2.</math>

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:

<math>P(t+s)=P(t)P(s)\,</math>

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

<math>P_{ij}(t)=P(X_t=j\mid X_0=i).</math>

See also

References

View More Summaries on Chapman-Kolmogorov equation
 
Ask any question on Chapman-Kolmogorov equation and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Chapman-Kolmogorov equation from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy