Chapman Kolmogorov Th. - generality?

  • Context: Graduate 
  • Thread starter Thread starter Stephen Tashi
  • Start date Start date
  • Tags Tags
    Kolmogorov
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
Does the Chapman - Kolmogorov equation hold for an arbitrary stochastic process?

The current wikipedia article on "Stochastic process" ( https://en.wikipedia.org/wiki/Stochastic_process ) seems to say that the Chapman-Kolmogorov equation is not valid for an arbitrary stochastic process.

I say "seems to say" since I can't interpret what the article means by "same class" in the passage:

Note that the obvious compatibility condition, namely, that this marginal probability distribution be in the same class as the one derived from the full-blown stochastic process, is not a requirement. Such a condition only holds, for example, if the stochastic process is a Wiener process (in which case the marginals are all gaussian distributions of the exponential class) but not in general for all stochastic processes. When this condition is expressed in terms of probability densities, the result is called the Chapman–Kolmogorov equation.
 
Whether the equation is true for an arbitrary process depends on what one calls "the Chapman-Kolmogorov Equation". In "Handbook Of Stochastic Methods" by C.W. Gardiner, second edition, pages 43-44, marginalization is a proof for the equation:

[tex]p(x_1,t_1) = \int dx_2 \ p(x_1,t_1; x_2, t_2)[/tex]

which corresponds to the equation in the current Wikipedia article given by:

[tex]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[/tex]

which that article calls "the Chapman-Kolmogorov equation".

However, Gardiner does not call that equation "the Chapman-Kolmogorov Equation".

Marginalization also proves the equation

[tex]p(x_1,t_1\ |\ x_3,t_3) = \int dx_2\ p(x_1,t_1; x_2,t_2|x_3,t_3)[/tex]
[tex]= \int dx_2\ p(x_1,t_1| x_2,t_2; x_3,t_3)\ p(x_2,t_2 | x_3,t_3)[/tex]

Gardiner says
This equation is also always valid. We now introduce the Markov assumption. If [itex]t_1 \ge t_2 \ge t_3[/itex] we can drop the [itex]t_3[/itex] dependence in the double conditioned probability and write

[tex]p(x_1,t_1 | x_3,t_3) = \int dx_2\ p(x_1,t_1| x_2,t_2) p(x_2,t_2| x_3,t_3)[/tex]

which is the Chapman-Kolmogorov equation.