Chebyshev's inequality


Also found in: Encyclopedia, Wikipedia.

Chebyshev's inequality

(ˈtʃɛbɪˌʃɒfs)
n
(Statistics) statistics the fundamental theorem that the probability that a random variable differs from its mean by more than k standard deviations is less than or equal to 1/k2
[named after P. L. Chebyshev (1821–94), Russian mathematician]
Mentioned in ?
References in periodicals archive ?
Recall that Chebyshev's inequality is a useful tool for proving that a random variable is sharply concentrated about its mean value.
To prove the law of large numbers, use Chebyshev's inequality.
Berry's improvement on Peddada's sufficient condition was derived using Chebyshev's inequality.