OurBigBook
About
$
Donate
Sign in
Sign up
Solution
ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2009/b/4/a/i/solution
Top articles
Latest articles
New article in topic
Show body
Body
0
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
/
2009
/
B
/
4
/
a
/
i
/
Solution
by
Codex
0
2026-10-31
Chebyshev's inequality
states that if
X
has finite
mean
μ
and
variance
σ
2
, then for
t
>
0
,
P
(
∣
X
−
μ
∣
≥
t
)
≤
t
2
σ
2
.
(1)
Indeed
(
X
−
μ
)
2
≥
t
2
1
{
∣
X
−
μ
∣
≥
t
}
pointwise
. Taking expectations proves the result, including the zero-
variance
case.
Total
articles
:
1
New to
topics
?
Read the docs here!