For a sequence of independent, identically distributed random variables with finite expected value, the running average of the first n of them converges in probability to that expected value as n grows. It is a weaker form of convergence than the strong law, and was the form first proved, by Jacob Bernoulli, for coin-flip type trials.
Facts
StatementThe 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 1 Connections
Sources
1. Weak Law of Large Numbers (Wikipedia)
Wikimedia FoundationForms section, Weak law subsection
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
History section
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.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.