Math 2.0

concept

Stochastic process

Summary

A stochastic process is a family (Xt)t∈T(X_t)_{t \in T} of random variables on one probability space (Ω,F,P)(\Omega, \mathcal{F}, P), all with values in the same measurable space (S,S)(S, \mathcal{S}). The set TT is the index set, often a set of times such as {0,1,2,… }\{0, 1, 2, \dots\} or [0,∞)[0, \infty). The set SS is the state space. For each outcome ω∈Ω\omega \in \Omega, the function t↦Xt(ω)t \mapsto X_t(\omega) is a sample path of the process.

Remarks

The process is in discrete time if TT is countable, such as {0,1,2,… }\{0, 1, 2, \dots\}, and in continuous time if TT is an interval. The finite-dimensional distributions are the laws of the vectors (Xt1,…,Xtn)(X_{t_1}, \dots, X_{t_n}) for finite sets {t1,…,tn}⊆T\{t_1, \dots, t_n\} \subseteq T. The Kolmogorov extension theorem builds a process from a consistent family of such laws. Important examples are the Bernoulli process, random walks, Markov chains, the Poisson process and the Wiener process.

Explanations

L1 human

A stochastic process is a random quantity that changes with time. Examples are the price of a share day by day and the number of customers in a queue. At each time it is a random variable, and one run of the whole process gives a random path.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

12 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Stochastic_process, Stochastic process