strong law of large numbers

In probability theory, the law of large numbers is a mathematical law that states that the average of the results obtained from a large number of independent random samples converges to the true value, if it exists. More formally, the law of large numbers states that given a sample of independent and identically distributed values, the sample mean converges to the true mean.

The law of large numbers is important because it guarantees stable long-term results for the averages of some random events. For example, while a casino may lose money in a single spin of the roulette wheel, its earnings will tend towards a predictable percentage over a large number of spins. Any winning streak by a player will eventually be overcome by the parameters of the game. Importantly, the law applies (as the name indicates) only when a ''large number'' of observations are considered. There is no principle that a small number of observations will coincide with the expected value or that a streak of one value will immediately be "balanced" by the others (see the gambler's fallacy).

The law of large numbers only applies to the ''average'' of the results obtained from repeated trials and claims that this average converges to the expected value; it does not claim that the ''sum'' of ''n'' results gets close to the expected value times ''n'' as ''n'' increases.

Throughout its history, many mathematicians have refined this law. Today, the law of large numbers is used in many fields including statistics, probability theory, economics, and insurance.

Examples

For example, a single roll of a six-sided dice produces one of the numbers 1, 2, 3, 4, 5, or 6, each with equal probability. Therefore, the expected value of the roll is:

$\frac = 3.5$

According to the law of large numbers, if a large number of six-sided dice are rolled, the average of their values (sometimes called the sample mean) will approach 3.5, with the precision increasing as more dice are rolled.

It follows from the law of large numbers that the empirical probability of success in a series of Bernoulli trials will converge to the theoretical probability. For a Bernoulli random variable, the expected value is the theoretical probability of success, and the average of ''n'' such variables (assuming they are independent and identically distributed (i.i.d.)) is precisely the relative frequency.

For example, a fair coin toss is a Bernoulli trial. When a fair coin is flipped once, the theoretical probability that the outcome will be heads is equal to . Therefore, according to the law of large numbers, the proportion of heads in a "large" number of coin flips "should be" roughly . In particular, the proportion of heads after ''n'' flips will almost surely converge to as ''n'' approaches infinity.

Although the proportion of heads (and tails) approaches , almost surely the absolute difference in the number of heads and tails will become large as the number of flips becomes large. That is, the probability that the absolute difference is a small number approaches zero as the number of flips becomes large. Also, almost surely the ratio of the absolute difference to the number of flips will approach zero. Intuitively, the expected difference grows, but at a slower rate than the number of flips.

Another good example of the law of large numbers is the Monte Carlo method. These methods are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. The larger the number of repetitions, the better the approximation tends to be. The reason that this method is important is mainly that, sometimes, it is difficult or impossible to use other approaches.

Limitation

The average of the results obtained from a large number of trials may fail to converge in some cases. For instance, the average of ''n'' results taken from the Cauchy distribution or some Pareto distributions (α<1) will not converge as ''n'' becomes larger; the reason is heavy tails. The Cauchy distribution and the Pareto distribution represent two cases: the Cauchy distribution does not have an expectation, whereas the expectation of the Pareto distribution (''α''<1) is infinite. One way to generate the Cauchy-distributed example is where the random numbers equal the tangent of an angle uniformly distributed between −90° and +90°. The median is zero, but the expected value does not exist, and indeed the average of ''n'' such variables have the same distribution as one such variable. It does not converge in probability toward zero (or any other value) as ''n'' goes to infinity.

If the trials embed a selection bias, typical in human economic/rational behaviour, the law of large numbers does not help in solving the bias, even if the number of trials is increased the selection bias remains.

History

The Italian mathematician Gerolamo Cardano (1501–1576) stated without proof that the accuracies of empirical statistics tend to improve with the number of trials. This was then formalized as a law of large numbers. A special form of the law of large numbers (for a binary random variable) was first proved by Jacob Bernoulli. It took him over 20 years to develop a sufficiently rigorous mathematical proof which was published in his (''The Art of Conjecturing'') in 1713. He named this his "golden theorem" but it became generally known as "Bernoulli's theorem". This should not be confused with Bernoulli's principle, named after Jacob Bernoulli's nephew Daniel Bernoulli. In 1837, S. D. Poisson further described it under the name ("the law of large numbers"). Thereafter, it was known under both names, but the "law of large numbers" is most frequently used.

After Bernoulli and Poisson published their efforts, other mathematicians also contributed to refinement of the law, including Chebyshev, Markov, Borel, Cantelli, Kolmogorov and Khinchin. Markov showed that the law can apply to a random variable that does not have a finite variance under some other weaker assumption, and Khinchin showed in 1929 that if the series consists of independent identically distributed random variables, it suffices that the expected value exists for the weak law of large numbers to be true. These further studies have given rise to two prominent forms of the law of large numbers. One is called the "weak" law and the other the "strong" law, in reference to two different modes of convergence of the cumulative sample means to the expected value; in particular, as explained below, the strong form implies the weak.

Forms

There are two different versions of the law of large numbers that are described below. They are called the'' strong law of large numbers'' and the ''weak law of large numbers''. Stated for the case where ''X''₁, ''X''₂, ... is an infinite sequence of independent and identically distributed (i.i.d.) Lebesgue integrable random variables with expected value E(''X''₁) = E(''X''₂) = ... = ''μ'', both versions of the law state that the sample average

$\overline_n=\frac1n(X_1+\cdots+X_n)$

converges to the expected value:

(Lebesgue integrability of ''X_j'' means that the expected value E(''X_j'') exists according to Lebesgue integration and is finite. It does ''not'' mean that the associated probability measure is absolutely continuous with respect to Lebesgue measure.)

Introductory probability texts often additionally assume identical finite variance $\operatorname (X_i) = \sigma^2$ (for all $i$) and no correlation between random variables. In that case, the variance of the average of ''n'' random variables is

$\operatorname(\overline_n) = \operatorname(\tfrac1n(X_1+\cdots+X_n)) = \frac \operatorname(X_1+\cdots+X_n) = \frac = \frac.$

which can be used to shorten and simplify the proofs. This assumption of finite variance is ''not necessary''. Large or infinite variance will make the convergence slower, but the law of large numbers holds anyway.

Mutual independence of the random variables can be replaced by pairwise independence or exchangeability in both versions of the law.

The difference between the strong and the weak version is concerned with the mode of convergence being asserted. For interpretation of these modes, see Convergence of random variables.

Weak law

The weak law of large numbers (also called Khinchin's law) states that given a collection of independent and identically distributed (iid) samples from a random variable with finite mean, the sample mean converges in probability to the expected value

That is, for any positive number ''ε'',

$\lim_\Pr\!\left(\,, \overline_n-\mu, < \varepsilon\,\right) = 1.$

Interpreting this result, the weak law states that for any nonzero margin specified (''ε''), no matter how small, with a sufficiently large sample there will be a very high probability that the average of the observations will be close to the expected value; that is, within the margin.

As mentioned earlier, the weak law applies in the case of i.i.d. random variables, but it also applies in some other cases. For example, the variance may be different for each random variable in the series, keeping the expected value constant. If the variances are bounded, then the law applies, as shown by Chebyshev as early as 1867. (If the expected values change during the series, then we can simply apply the law to the average deviation from the respective expected values. The law then states that this converges in probability to zero.) In fact, Chebyshev's proof works so long as the variance of the average of the first ''n'' values goes to zero as ''n'' goes to infinity. As an example, assume that each random variable in the series follows a Gaussian distribution (normal distribution) with mean zero, but with variance equal to $2n/\log(n+1)$, which is not bounded. At each stage, the average will be normally distributed (as the average of a set of normally distributed variables). The variance of the sum is equal to the sum of the variances, which is asymptotic to $n^2 / \log n$. The variance of the average is therefore asymptotic to $1 / \log n$ and goes to zero.

There are also examples of the weak law applying even though the expected value does not exist.

Strong law

The strong law of large numbers (also called Kolmogorov's law) states that the sample average converges almost surely to the expected value

That is,

$\Pr\!\left( \lim_\overline_n = \mu \right) = 1.$

What this means is that, as the number of trials ''n'' goes to infinity, the probability that the average of the observations converges to the expected value, is equal to one. The modern proof of the strong law is more complex than that of the weak law, and relies on passing to an appropriate sub-sequence.

The strong law of large numbers can itself be seen as a special case of the pointwise ergodic theorem. This view justifies the intuitive interpretation of the expected value (for Lebesgue integration only) of a random variable when sampled repeatedly as the "long-term average".

Law 3 is called the strong law because random variables which converge strongly (almost surely) are guaranteed to converge weakly (in probability). However the weak law is known to hold in certain conditions where the strong law does not hold and then the convergence is only weak (in probability). See Differences between the weak law and the strong law.

The strong law applies to independent identically distributed random variables having an expected value (like the weak law). This was proved by Kolmogorov in 1930. It can also apply in other cases. Kolmogorov also showed, in 1933, that if the variables are independent and identically distributed, then for the average to converge almost surely on ''something'' (this can be considered another statement of the strong law), it is necessary that they have an expected value (and then of course the average will converge almost surely on that).

If the summands are independent but not identically distributed, then

provided that each ''X''_''k'' has a finite second moment and

\sum_^ \frac \operatorname _k< \infty.

This statement is known as ''Kolmogorov's strong law'', see e.g. .

Differences between the weak law and the strong law

The ''weak law'' states that for a specified large ''n'', the average $\overline_n$ is likely to be near ''μ''. Thus, it leaves open the possibility that $, \overline_n -\mu, > \varepsilon$ happens an infinite number of times, although at infrequent intervals. (Not necessarily $, \overline_n -\mu, \neq 0$ for all ''n'').

The ''strong law'' shows that this almost surely will not occur. It does not imply that with probability 1, we have that for any the inequality $, \overline_n -\mu, < \varepsilon$ holds for all large enough ''n'', since the convergence is not necessarily uniform on the set where it holds.

The strong law does not hold in the following cases, but the weak law does.

Uniform laws of large numbers

There are extensions of the law of large numbers to collections of estimators, where the convergence is uniform over the collection; thus the name ''uniform law of large numbers''.

Suppose ''f''(''x'',''θ'') is some function defined for ''θ'' ∈ Θ, and continuous in ''θ''. Then for any fixed ''θ'', the sequence will be a sequence of independent and identically distributed random variables, such that the sample mean of this sequence converges in probability to E 'f''(''X'',''θ'') This is the ''pointwise'' (in ''θ'') convergence.

A particular example of a uniform law of large numbers states the conditions under which the convergence happens ''uniformly'' in ''θ''. If

# ''Θ'' is compact,
# ''f''(''x'',''θ'') is continuous at each ''θ'' ∈ Θ for almost all ''x''s, and measurable function of ''x'' at each ''θ''.
# there exists a dominating function ''d''(''x'') such that E 'd''(''X'')< ∞, and $\left\, f(x,\theta) \right\, \leq d(x) \quad\text\ \theta\in\Theta.$

Then E 'f''(''X'',''θ'')is continuous in ''θ'', and

\sup_ \left\, \frac 1 n \sum_^n f(X_i,\theta) - \operatorname (X,\theta)\right\, \overset \ 0.

This result is useful to derive consistency of a large class of estimators (see Extremum estimator).

Borel's law of large numbers

Borel's law of large numbers, named after Émile Borel, states that if an experiment is repeated a large number of times, independently under identical conditions, then the proportion of times that any specified event is expected to occur approximately equals the probability of the event's occurrence on any particular trial; the larger the number of repetitions, the better the approximation tends to be. More precisely, if ''E'' denotes the event in question, ''p'' its probability of occurrence, and ''N_n''(''E'') the number of times ''E'' occurs in the first ''n'' trials, then with probability one,
$\frac\to p\textn\to\infty.$

This theorem makes rigorous the intuitive notion of probability as the expected long-run relative frequency of an event's occurrence. It is a special case of any of several more general laws of large numbers in probability theory.

Chebyshev's inequality. Let ''X'' be a random variable with finite expected value ''μ'' and finite non-zero variance ''σ''². Then for any real number ,

$\Pr(, X-\mu, \geq k\sigma) \leq \frac.$

Proof of the weak law

Given ''X''₁, ''X''₂, ... an infinite sequence of i.i.d. random variables with finite expected value $E(X_1)=E(X_2)=\cdots=\mu<\infty$, we are interested in the convergence of the sample average

$\overline_n=\tfrac1n(X_1+\cdots+X_n).$

The weak law of large numbers states:

Proof using Chebyshev's inequality assuming finite variance

This proof uses the assumption of finite variance $\operatorname (X_i)=\sigma^2$ (for all $i$). The independence of the random variables implies no correlation between them, and we have that

$\operatorname(\overline_n) = \operatorname(\tfrac1n(X_1+\cdots+X_n)) = \frac \operatorname(X_1+\cdots+X_n) = \frac = \frac.$

The common mean μ of the sequence is the mean of the sample average:

$E(\overline_n) = \mu.$

Using Chebyshev's inequality on $\overline_n$ results in

$\operatorname( \left, \overline_n-\mu \ \geq \varepsilon) \leq \frac.$

This may be used to obtain the following:

$\operatorname( \left, \overline_n-\mu \ < \varepsilon) = 1 - \operatorname( \left, \overline_n-\mu \ \geq \varepsilon) \geq 1 - \frac.$

As ''n'' approaches infinity, the expression approaches 1. And by definition of convergence in probability, we have obtained

Proof using convergence of characteristic functions

By Taylor's theorem for complex functions, the characteristic function of any random variable, ''X'', with finite mean μ, can be written as

$\varphi_X(t) = 1 + it\mu + o(t), \quad t \rightarrow 0.$

All ''X''₁, ''X''₂, ... have the same characteristic function, so we will simply denote this ''φ''_''X''.

Among the basic properties of characteristic functions there are

$\varphi_(t)= \varphi_X(\tfrac t n) \quad \text \quad \varphi_(t) = \varphi_X(t) \varphi_Y(t) \quad$ if ''X'' and ''Y'' are independent.

These rules can be used to calculate the characteristic function of $\overline_n$ in terms of ''φ''_''X'':

\varphi_(t)= \left varphi_X\left(\right)\rightn = \left + i\mu + o\left(\right)\rightn \, \rightarrow \, e^, \quad \text \quad n \to \infty.

The limit ''e''^''itμ'' is the characteristic function of the constant random variable μ, and hence by the Lévy continuity theorem, $\overline_n$ converges in distribution to μ:

$\overline_n \, \overset \, \mu \qquad\text\qquad n \to \infty.$

μ is a constant, which implies that convergence in distribution to μ and convergence in probability to μ are equivalent (see Convergence of random variables.) Therefore,

This shows that the sample mean converges in probability to the derivative of the characteristic function at the origin, as long as the latter exists.

Proof of the strong law

We give a relatively simple proof of the strong law under the assumptions that the $X_i$ are iid, _i=: \mu < \infty , $\operatorname (X_i)=\sigma^2 < \infty$, and _i^4=: \tau < \infty .

Let us first note that without loss of generality we can assume that $\mu = 0$ by centering. In this case, the strong law says that

$\Pr\!\left( \lim_\overline_n = 0 \right) = 1,$
or
$\Pr\left(\omega: \lim_\fracn = 0 \right) = 1.$
It is equivalent to show that
$\Pr\left(\omega: \lim_\fracn \neq 0 \right) = 0,$
Note that
$\lim_\fracn \neq 0 \iff \exists\epsilon>0, \left, \fracn\ \ge \epsilon\ \mbox,$
and thus to prove the strong law we need to show that for every $\epsilon > 0$, we have
$\Pr\left(\omega: , S_n(\omega), \ge n\epsilon \mbox \right) = 0.$
Define the events $A_n = \$, and if we can show that
$\sum_^\infty \Pr(A_n) <\infty,$
then the Borel-Cantelli Lemma implies the result. So let us estimate $\Pr(A_n)$.

We compute

_n^4= \left left(\sum_^n X_i\right)^4\right= \left sum_ X_iX_jX_kX_l\right

We first claim that every term of the form $X_i^3X_j, X_i^2X_jX_k, X_iX_jX_kX_l$ where all subscripts are distinct, must have zero expectation. This is because _i^3X_j= _i^3X_j] by independence, and the last term is zero—and similarly for the other terms. Therefore the only terms in the sum with nonzero expectation are _i^4/math> and _i^2X_j^2/math>. Since the $X_i$ are identically distributed, all of these are the same, and moreover _i^2X_j^2( _i^2^2.

There are $n$ terms of the form _i^4/math> and $3 n (n-1)$ terms of the form ( _i^2^2, and so

_n^4= n \tau + 3n(n-1)\sigma^4.

Note that the right-hand side is a quadratic polynomial in $n$, and as such there exists a $C>0$ such that _n^4\le Cn^2 for $n$ sufficiently large. By Markov,

\Pr(, S_n, \ge n \epsilon) \le \frac1 _n^4\le \frac,

for $n$ sufficiently large, and therefore this series is summable. Since this holds for any $\epsilon > 0$, we have established the strong law of large numbers. The proof can be strengthened immensely by dropping all finiteness assumptions on the second and fourth moments. It can also be extended for example to discuss partial sums of distributions without any finite moments. Such proofs use more intricate arguments to prove the same Borel-Cantelli predicate, a strategy attributed to Kolmogorov to conceptually bring the limit inside the probability parentheses. For a proof without the added assumption of a finite fourth moment, see Section 22 of

Consequences

The law of large numbers provides an expectation of an unknown distribution from a realization of the sequence, but also any feature of the probability distribution. By applying Borel's law of large numbers, one could easily obtain the probability mass function. For each event in the objective probability mass function, one could approximate the probability of the event's occurrence with the proportion of times that any specified event occurs. The larger the number of repetitions, the better the approximation. As for the continuous case: $C=(a-h,a+h]$, for small positive h. Thus, for large n:

$\frac\thickapprox p = P(X\in C) = \int_^ f(x) \, dx \thickapprox 2hf(a)$

With this method, one can cover the whole x-axis with a grid (with grid size 2h) and obtain a bar graph which is called a histogram.

Applications

One application of the law of large numbers is an important method of approximation known as the Monte Carlo method, which uses a random sampling of numbers to approximate numerical results. The algorithm to compute an integral of f(x) on an interval ,bis as follows:

# Simulate uniform random variables X₁, X₂, ..., X_n which can be done using a software, and use a random number table that gives U₁, U₂, ..., U_n independent and identically distributed (i.i.d.) random variables on ,1 Then let X_i = a+(b - a)U_i for i= 1, 2, ..., n. Then X₁, X₂, ..., X_n are independent and identically distributed uniform random variables on , b
# Evaluate f(X₁), f(X₂), ..., f(X_n)
# Take the average of f(X₁), f(X₂), ..., f(X_n) by computing $(b-a)\tfrac$ and then by the strong law of large numbers, this converges to $(b-a)E(f(X_1))$ = $(b-a)\int_^ f(x)\tfrac$ =$\int_^ f(x)$

We can find the integral of $f(x) = cos^2(x)\sqrt$ on 1,2 Using traditional methods to compute this integral is very difficult, so the Monte Carlo method can be used here. Using the above algorithm, we get

$\int_^ f(x)$ = 0.905 when n=25

and

$\int_^ f(x)$ = 1.028 when n=250

We observe that as n increases, the numerical value also increases. When we get the actual results for the integral we get

$\int_^ f(x)$ = 1.000194

When the LLN was used, the approximation of the integral was closer to its true value, and thus more accurate.

Another example is the integration of f(x) = $\frac$ on ,1 Using the Monte Carlo method and the LLN, we can see that as the number of samples increases, the numerical value gets closer to 0.4180233.

See also

* Asymptotic equipartition property
* Central limit theorem
* Infinite monkey theorem
* Keynes' Treatise on Probability
* Law of averages
* Law of the iterated logarithm
* Law of truly large numbers
* Lindy effect
* Regression toward the mean
* Sortition
* Strong law of small numbers

Notes

References

*
*
*
*
*
*
*
*

External links

*
*
*

Animations for the Law of Large Numbers
by Yihui Xie using the R packag
animation

Apple CEO Tim Cook said something that would make statisticians cringe
"We don't believe in such laws as laws of large numbers. This is sort of, uh, old dogma, I think, that was cooked up by somebody . said Tim Cook and while: "However, the law of large numbers has nothing to do with large companies, large revenues, or large growth rates. The law of large numbers is a fundamental concept in probability theory and statistics, tying together theoretical probabilities that we can calculate to the actual outcomes of experiments that we empirically perform.'' explained Business Insider''
{{Authority control

Theorems in probability theory
Mathematical proofs
Asymptotic theory (statistics)
Theorems in statistics
Large numbers