Chebyshev's Inequality and the Weak Law of Large Numbers for iid TwoVectors
Chebyshev's Inequality and the Weak Law of Large Numbers for iid TwoVectors
Chebyshev's inequality states that if ,,...,are independent, identically distributed random variables (an iid sample) with common mean and common standard deviation and is the average of these random variables, then An immediate consequence is the weak law of large numbers, which states that as . These results are usually stated for realvalued random variables but also hold for random vectors, provided you interpret all absolute values as Euclidean distances and the variance as =Eμ. The blue dots in the image are the means of 100 different iid samples from a bivariate normal distribution with mean and standard deviation specified by the locators on the left—is the square of the magnitude of this standard deviation. The orange dot is the common mean, , and the circle shown is centered at with radius . The fraction of blue dots outside the circle will usually be smaller than the theoretical upper bound given in Chebyshev's inequality—in many instances this bound is very crude.
X
1
X
2
X
n
μ
σ
X
P(Xμ>ϵ)≤.
2
σ
n
2
ϵ
P(Xμ>ϵ)0
n→∞
2
σ
X
i
2

2
σ
μ
μ
ϵ