Chebyshev's inequality

(redirected from Chebyshev inequality)
Also found in: Encyclopedia.
Related to Chebyshev inequality: variance, Markov inequality

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]
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
Mentioned in ?
References in periodicals archive ?
By virtue of Chebyshev inequality, we can easily obtain that the solution (x(t), y(t), z(t)) of system (4) is stochastically ultimately bounded.
Confidence bounds can also be established through use of the Chebyshev inequality [5], although these bounds tend to be too large for practical use [6].
Hence, by Chebyshev inequality, we have for [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].