Chebyshev's inequality
Sign in to saveAlso known as Bienaymé–Chebyshev inequality
inequality applying to random variables with finite expected values
In the Vinony graph
Vinony's link graph records 117 inbound references to Chebyshev's inequality, and connects out to probability distribution, law of large numbers and measure.
It is catalogued under topics including Probabilistic inequalities and Statistical inequalities.
Vinony links it to 30 Wikipedia language editions.
Wikidata facts
- Instance of
- theorem
- Named after
- Irénée-Jules Bienaymé
Show 4 more facts
- Commons category
- Chebyshev's inequality
- discoverer or inventor
- Pafnuty Chebyshev
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- probability theory
via Wikidata · CC0
~40 min read
Encyclopedic overview
In probability theory, Chebyshev's inequality (also called the Bienaymé–Chebyshev inequality) provides an upper bound on the probability of deviation of a random variable (with finite variance) from its mean. More specifically, the probability that a random variable deviates from its mean by more than
k σ
Excerpted from Wikipedia’s “Chebyshev's inequality” article, available under the CC BY-SA 4.0 licence.