Stochastic convergence: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Ragnar Schroder
(→‎Basic example: - modifying.)
imported>Ragnar Schroder
(Replacing phrase "stochastic variable" by "random variable", rephrasing)
Line 44: Line 44:
The business income varies unpredictably from month to month, while income from interest is predictable and given by a simple function f.
The business income varies unpredictably from month to month, while income from interest is predictable and given by a simple function f.


The income for month i can thus be modeled by a stochastic variable <math>U_i=X_i+f(i)</math>,  where <math>X_i</math> is the income from the  business.
The income for month i can thus be modeled by a random variable <math>U_i=X_i+f(i)</math>,  where <math>X_i</math> is the income from the  business.


Now assume <math>X_i</math> converges almost surely to 0 (history bears out that all businesses sooner or later fold up).  
Now assume <math>X_i</math> converges almost surely to 0 (history bears out that all businesses sooner or later fold up).  
Line 52: Line 52:
===Formal definition===
===Formal definition===


Let <math>\scriptstyle X_0, X_1, ... </math> be an infinite sequence of [[stochastic variable|stochastic variables]] defined over a subset of R.  
Let <math>\scriptstyle X_0, X_1, ... </math> be an infinite sequence of [[random variable|random variables]] defined over a subset of R.  


Then the actual outcomes will be an ordinary sequence of real numbers.  
Then the actual outcomes will be an ordinary sequence of real numbers.  
Line 64: Line 64:
Note that we may replace the real number a above by a real-valued function <math>f(i)</math> of i,  and obtain almost sure convergence to a function rather than a fixed number.   
Note that we may replace the real number a above by a real-valued function <math>f(i)</math> of i,  and obtain almost sure convergence to a function rather than a fixed number.   


The number a may also be the outcome of a stochastic variable X.  In that case the compact notation <math>P(\lim_{i \to \infty} X_i = X) = 1 </math> is often used.
The number a may also be the outcome of a random variable X.  In that case the compact notation <math>P(\lim_{i \to \infty} X_i = X) = 1 </math> is often used.


Commonly used notation: <math>X_i \rightarrow^{a.s.} a </math>, <math>X_i \rightarrow^{a.s.} X </math>.
Commonly used notation: <math>X_i \rightarrow^{a.s.} a </math>, <math>X_i \rightarrow^{a.s.} X </math>.
Line 80: Line 80:
Tomorrow he plays the game using 1 envelope, the second day he uses two envelopes, the 3rd day there'll be 3 envelopes,  etc.
Tomorrow he plays the game using 1 envelope, the second day he uses two envelopes, the 3rd day there'll be 3 envelopes,  etc.


Then the amount of dollars you earn from the game on a given day will be a stochastic variable that converges in probability to $1, because the probability of guessing the "right" envelope steadily shrinks.
Then the amount of dollars you earn from the game on a given day will be a random variable that converges in probability to $1, because the probability of guessing the "right" envelope steadily shrinks.


In the long run, then, an outcome different from $1 will become an increasingly "freaky" event.
In the long run, then, an outcome different from $1 will become an increasingly "freaky" event.


===Formal definition===
===Formal definition===
Let <math>\scriptstyle X_0, X_1, ... </math> be an infinite sequence of [[stochastic variable|stochastic variables]] defined over a subset of R.  
Let <math>\scriptstyle X_0, X_1, ... </math> be an infinite sequence of [[random variable|random variables]] defined over a subset of R.  


If there exists a real number ''a'' such that <math>\lim_{i \to \infty} P( |X_i - a| > \varepsilon) = 0 </math>  
If there exists a real number ''a'' such that <math>\lim_{i \to \infty} P( |X_i - a| > \varepsilon) = 0 </math>  
Line 111: Line 111:
Let <math>\scriptstyle X_n</math> be the result of flipping n unbiased coins,  and noting the fraction of heads.
Let <math>\scriptstyle X_n</math> be the result of flipping n unbiased coins,  and noting the fraction of heads.


<math>\scriptstyle X_1</math> will then follow the uniform discrete probability distribution with [[expected value of a stochastic variable|expected value]] <math>\mu=0.5</math> and [[variance of a stochastic variable|variance]] <math>\sigma^2=0.25</math>,  but as n grows larger,  <math>\scriptstyle X_n</math> will follow a distribution that gradually takes on more and more similarity to the [[normal distribution|gaussian distribution]] .
<math>\scriptstyle X_1</math> will then follow the uniform discrete probability distribution with [[expected value of a random variable|expected value]] <math>\mu=0.5</math> and [[variance of a random variable|variance]] <math>\sigma^2=0.25</math>,  but as n grows larger,  <math>\scriptstyle X_n</math> will follow a distribution that gradually takes on more and more similarity to the [[normal distribution|gaussian distribution]] .


Forming the stochastic sequence <math>\scriptstyle Z_n= \frac{ (X_n - \mu) }{\frac {\sigma} {\sqrt {n }}} </math>,  we find the variables <math>Z_n </math> becoming distributed more and more like the standard normal distribution as n increases.  
Forming the sequence <math>\scriptstyle Z_n= \frac{ (X_n - \mu) }{\frac {\sigma} {\sqrt {n }}} </math>,  we find the random variables <math>Z_n </math> becoming distributed more and more like the standard normal distribution as n increases.  


We then say the sequence <math>\scriptstyle Z_n</math> converges in distribution to the standard normal distribution.
We then say the sequence <math>\scriptstyle Z_n</math> converges in distribution to the standard normal distribution.
Line 121: Line 121:
===Formal definition===
===Formal definition===


Given a stochastic variable X with a [[cumulative distribution function]] F(x), let <math>X_i</math> be a sequence of stochastic variables,  each with cumulative distribution function <math>F_i (x)</math>, respectively.
Given a random variable X with a [[cumulative distribution function]] F(x), let <math>X_i</math> be a sequence of random variables,  each with cumulative distribution function <math>F_i (x)</math>, respectively.


If <math>\scriptstyle \lim_{i \to \infty} F_i (x) = F(x)</math> for all x where F(x) is continuous,  then the sequence <math>X_i</math> of stochastic variables converges in distribution to the distribution of <math>X</math>.
If <math>\scriptstyle \lim_{i \to \infty} F_i (x) = F(x)</math> for all x where F(x) is continuous,  then the sequence <math>X_i</math> of stochastic variables converges in distribution to the distribution of <math>X</math>.
Line 130: Line 130:


==Convergence in rth order mean==
==Convergence in rth order mean==
This is a rather "technical" mode of convergence. We essentially compute a sequence of real numbers,  one number for each stochastic variable,  and check if this sequence is [[convergence|convergent]] in the ordinary sense.  
This is a rather "technical" mode of convergence. We essentially compute a sequence of real numbers,  one number for each random variable,  and check if this sequence is [[convergence|convergent]] in the ordinary sense.  


===Example===
===Example===
Line 149: Line 149:


==Relations between the different modes of convergence==
==Relations between the different modes of convergence==
*If a stochastic sequence has almost sure convergence,  then it also has convergence in probability.
*If a sequence of random variables has almost sure convergence,  then it also has convergence in probability.
*If a stochastic sequence has convergence in probability,  then it also has convergence in distribution.
*If a sequence of random variables has convergence in probability,  then it also has convergence in distribution.
*If a stochastic sequence has convergence in (r+1)th order mean, then it also has convergence in rth order mean (r>0).
*If a sequence of random variables has convergence in (r+1)th order mean, then it also has convergence in rth order mean (r>0).
*If a stochastic sequence has convergence in rth order mean, then it also has convergence in probability.
*If a sequence of random variables has convergence in rth order mean, then it also has convergence in probability.




Line 165: Line 165:
*[[Probability]]
*[[Probability]]
*[[Probability theory]]
*[[Probability theory]]
*[[Stochastic variable]]
*[[Random variable]]
*[[Stochastic differential equations]]
*[[Stochastic differential equations]]
*[[Stochastic modeling]]
*[[Stochastic modeling]]

Revision as of 14:09, 6 July 2007

Stochastic convergence is a mathematical concept intended to formalize the idea that a sequence of essentially random or unpredictable events sometimes is expected to settle into a pattern.


Various possible modes of stochastic convergence

The pattern may for instance be

  • convergence in the classical sense to a fixed value, perhaps itself coming from a random event.
  • an increasing similarity of outcomes to what a purely deterministic function would produce
  • an increasing preference towards a certain outcome
  • an increasing "aversion" against straying far away from a certain outcome
  • an increasing adherence to one particular probability distribution
  • the series formed by calculating the expected value of the outcome's distance from a particular value may converge to 0
  • the variability of the results may grow smaller and smaller, i.e. the variance converging to 0


Four different varieties of stochastic convergence are noted:

  • Almost sure convergence
  • Convergence in probability
  • Convergence in distribution
  • Convergence in rth order mean



Almost sure convergence

This is the type of stochastic convergence that is most similar to ordinary convergence known from elementary real analysis.

Examples

Basic example 1

Consider an animal of some short-lived species. We note the exact amount of food that this animal consumes day by day. This sequence of numbers will be unpredictable in advance, but we may be quite certain that one day the number will become zero, and will stay zero forever after.

Basic example 2

Consider a man who starts tomorrow to toss seven coins once every morning. Each afternoon, he donates a random amount of money to a certain charity. The first time the result is all tails, however, he will stop permanently.

Let be the day by day amounts the charity receives from him.

We may be almost sure that one day this amount will be zero, and stay zero forever after that.

However, when we consider any finite number of days, there is a nonzero probability the terminating condition will not occur.

Intermediate example

A business owner has two sources of income: His business, and interest from a large bank deposit with fixed interest and no withdrawal or deposits.

The business income varies unpredictably from month to month, while income from interest is predictable and given by a simple function f.

The income for month i can thus be modeled by a random variable , where is the income from the business.

Now assume converges almost surely to 0 (history bears out that all businesses sooner or later fold up).

Then the total monthly income has almost sure convergence to the function f(i).

Formal definition

Let be an infinite sequence of random variables defined over a subset of R.

Then the actual outcomes will be an ordinary sequence of real numbers.

If the probability that this sequence will converge to a given real number a equals 1, then we say the original sequence of stochastic variables has almost sure convergence to a.

In more compact notation:

If for some a, then the sequence has almost sure convergence to a.

Note that we may replace the real number a above by a real-valued function of i, and obtain almost sure convergence to a function rather than a fixed number.

The number a may also be the outcome of a random variable X. In that case the compact notation is often used.

Commonly used notation: , .


Convergence in probability

The basic idea is that the probability of an "freaky" outcome becomes smaller and smaller, while the idea of "non-freaky" may become stricter and stricter.

Examples

Basic example

Assume someone has an infinite supply of envelopes and money, and likes to play the following game: He shows you a number of sealed envelopes. Inside exactly one is a $5 bill, any and all of the others all contain $1. You get to pick exactly one envelope, and keep the content.

Tomorrow he plays the game using 1 envelope, the second day he uses two envelopes, the 3rd day there'll be 3 envelopes, etc.

Then the amount of dollars you earn from the game on a given day will be a random variable that converges in probability to $1, because the probability of guessing the "right" envelope steadily shrinks.

In the long run, then, an outcome different from $1 will become an increasingly "freaky" event.

Formal definition

Let be an infinite sequence of random variables defined over a subset of R.

If there exists a real number a such that for all , then the sequence has convergence in probability to a.


Commonly used notation: .


Convergence in distribution

With this mode of convergence, we increasingly expect to see our next outcome in a sequence of random experiments becoming better and better modeled by a given probability distribution.

Examples

Basic example

The outcome from tossing a non-biased dice follows the uniform discrete distribution.

Assume a new dice factory has just been built.

The first few dices come out quite biased, due to imperfections in the production process. The outcome from tossing any of them will follow a distribution markedly different from the desired uniform discrete distribution.

As the factory is improved, the dices will be less and less loaded, and the outcomes from tossing a newly produced dice will follow the desired distribution more and more closely.

Intermediate example

Let be the result of flipping n unbiased coins, and noting the fraction of heads.

will then follow the uniform discrete probability distribution with expected value and variance , but as n grows larger, will follow a distribution that gradually takes on more and more similarity to the gaussian distribution .

Forming the sequence , we find the random variables becoming distributed more and more like the standard normal distribution as n increases.

We then say the sequence converges in distribution to the standard normal distribution.

(This convergence follows from the famous central limit theorem).

Formal definition

Given a random variable X with a cumulative distribution function F(x), let be a sequence of random variables, each with cumulative distribution function , respectively.

If for all x where F(x) is continuous, then the sequence of stochastic variables converges in distribution to the distribution of .

Commonly used notation: . One can also use the distribution directly, so if f.i. X is normally distributed with mean 0 and variance 1, one could write .


Convergence in rth order mean

This is a rather "technical" mode of convergence. We essentially compute a sequence of real numbers, one number for each random variable, and check if this sequence is convergent in the ordinary sense.

Example

A newly built factory produces cans of beer. The owners want each can to contain exactly a certain amount.

Knowing the details of the current production process, engineers may compute the expected error in a newly produced can.

They are continuously improving the production process, so as time goes by, the expected error in a newly produced can tends to zero.

This example illustrates convergence in first order mean.

Formal definition

If for some real number a, then {} converges in rth order mean to a.

Commonly used notation: .


Relations between the different modes of convergence

  • If a sequence of random variables has almost sure convergence, then it also has convergence in probability.
  • If a sequence of random variables has convergence in probability, then it also has convergence in distribution.
  • If a sequence of random variables has convergence in (r+1)th order mean, then it also has convergence in rth order mean (r>0).
  • If a sequence of random variables has convergence in rth order mean, then it also has convergence in probability.


See also


Related topics


References

External links