Markov and Chebyshev inequalities

(30 minutes to learn)


Markov's inequality and Chebyshev's inequality are tools for bounding the probability of a random variable taking on extreme values. While the bounds are weak, they apply under very general conditions. One use of Chebyshev's inequality is to prove the weak law of large numbers.


This concept has the prerequisites:

Core resources (read/watch one of the following)


See also