Chebyshev's lemma, weak law of large numbers, central limit theorem for i.i.d. variables, standard errors - Online Test

30:00
1. Chebyshev's lemma provides a bound on the probability that a random variable deviates from its expected value. What is the form of this inequality?
2. In Chebyshev's lemma, what does 'k' represent in the inequality P(|X - μ| ≥ kσ) ≤ 1/k²?
3. What is the primary implication of Chebyshev's lemma regarding the concentration of probability around the mean?
4. Chebyshev's lemma is particularly useful when the distribution of the random variable is:
5. Consider a random variable X with mean μ and standard deviation σ. According to Chebyshev's lemma, what is the maximum probability that X falls outside the interval (μ - 2σ, μ + 2σ)?
6. The Weak Law of Large Numbers (WLLN) states that under certain conditions, the sample mean converges to the population mean. In what sense does this convergence occur?
7. What are the typical conditions required for the Weak Law of Large Numbers to hold for a sequence of independent and identically distributed (i.i.d.) random variables?
8. Mathematically, the Weak Law of Large Numbers states that for a sequence of i.i.d. random variables X₁, X₂, ..., Xn with E[Xᵢ] = μ and Var(Xᵢ) = σ², the sample mean X̄n converges in probability to μ. This is expressed as:
9. The Weak Law of Large Numbers is a fundamental result in probability theory because it justifies the use of sample averages to estimate population parameters. What does it imply about large samples?
10. A common proof of the Weak Law of Large Numbers utilizes Chebyshev's inequality applied to the sample mean. What property of the sample mean is essential for this proof?

Test Results

0/0