| Revision as of 14:23, 6 April 2002 editMiguel~enwiki (talk | contribs)3,710 editsNo edit summary← Previous edit | Revision as of 20:15, 6 April 2002 edit undoMiguel~enwiki (talk | contribs)3,710 editsNo edit summaryNext edit → | ||
| Line 25: | Line 25: | ||
| ## what is the probability that f(x) has a limit as x->infty? | ## what is the probability that f(x) has a limit as x->infty? | ||
| === Constructing stochastic processes: the Kolmogorov Extension === | |||
| ⚫ | In the ordinary ] of ] by means of ], the problem is to construct a ] of ] subsets of the space of all functions, and then put a finite ] on it. For this purpose one uses |
||
| ⚫ | In the ordinary ] of ] by means of ], the problem is to construct a ] of ] subsets of the space of all functions, and then put a finite ] on it. For this purpose one traditionally uses a method called ] extension. | ||
| The Kolmogorov extension proceeds along the following lines: assuming that a probability measure on the space of functions f : X -> Y exists, then it can be used to specify the probability distribution of finite-dimensional marginal random variables (f(x_1),...,f(x_n)). These finite-dimensional distributions must satisfy the Chapman-Kolmogorov compatibility condition. | |||
Revision as of 20:15, 6 April 2002
A stochastic process is a random function. This means that, if
f : D -> R
is a random function with domain D and range R, the image of each point of D, f(x), is a random variable with values in R.
Of course, the mathematical definition of a function includes the case "a function from {1,...,n} to R is a vector in R^n", so multidimensional random variables are a special case of stochastic processes.
For our first infinite example, take the domain to be N, the natural numbers, and our range to be R, the real numbers. Then, a function f : N -> R is a sequence of real numbers, and the following questions arise:
- How is a random sequence specified?
- How do we find the answers to typical questions about sequences, such as
- what is the probability distribution of the value of f(i)?
- what is the probability that f is bounded?
- what is the probability that is f monotonic?
- what is the probability that f(i) has a limit as i->infty?
- if we construct a series from f(i), what is the probability that the series converges? What is the probability distribution of the sum?
Another important class of examples is when the domain is not a discrete space such as the natural numbers, but a continuous space such as the unit interval , the positive real numbers [0,infty) or the entire real line, R. In this case, we have a different set of questions that we might want to answer:
- How is a random function specified?
- How do we find the answers to typical questions about functions, such as
- what is the probability distribution of the value of f(x)?
- what is the probability that f is bounded/integrable/continuous/differentiable...?
- what is the probability that f(x) has a limit as x->infty?
Constructing stochastic processes: the Kolmogorov Extension
In the ordinary axiomatization of probability theory by means of measure theory, the problem is to construct a sigma-algebra of measurable subsets of the space of all functions, and then put a finite measure on it. For this purpose one traditionally uses a method called Kolmogorov extension.
The Kolmogorov extension proceeds along the following lines: assuming that a probability measure on the space of functions f : X -> Y exists, then it can be used to specify the probability distribution of finite-dimensional marginal random variables (f(x_1),...,f(x_n)). These finite-dimensional distributions must satisfy the Chapman-Kolmogorov compatibility condition.