Predictable process

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In stochastic analysis, a part of the mathematical theory of probability, a predictable process is a stochastic process whose value is knowable at a prior time. The predictable processes form the smallest class that is closed under taking limits of sequences and contains all adapted left-continuous processes.[clarification needed]

Mathematical definition

[edit | edit source]

Discrete-time process

[edit | edit source]

Given a filtered probability space (Ω,,(n)n,), then a stochastic process (Xn)n is predictable if Xn+1 is measurable with respect to the σ-algebra n for each n.[1]

Continuous-time process

[edit | edit source]

Given a filtered probability space (Ω,,(t)t0,), then a continuous-time stochastic process (Xt)t0 is predictable if X, considered as a mapping from Ω×+, is measurable with respect to the σ-algebra generated by all left-continuous adapted processes.[2] This σ-algebra is also called the predictable σ-algebra.

Examples

[edit | edit source]

See also

[edit | edit source]

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).