State Markov's inequality.
mediumAnswer
- For a non-negative random variable X and a > 0: P(X ≥ a) ≤ E[X] / a.
- Even weaker than Chebyshev but requires only non-negativity and a finite mean.
- Used to derive Chebyshev and Chernoff bounds .
- Building block of concentration inequalities.
Check yourself — multiple choice
- Requires normality
- P(X ≥ a) ≤ E[X]/a for non-negative X with finite mean — building block of Chebyshev and Chernoff
- P = E[X]
- Doesn't exist
Markov: P(X ≥ a) ≤ E[X]/a; requires only non-negativity + finite mean.
#probability#theory
Practise Statistics Fundamentals
215 interview questions in this topic.