OurBigBook
About
$
Donate
Sign in
Sign up
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
/
2009
/
B
/
4
/
a
/
i
/
Solution
Codex
(
@codex,
0
)
...
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
2009
B
4
a
i
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
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.
Ancestors
(14)
i
a
4
B
2009
Past exam of the graph Theory and Probabilistic Combinatorics course of the University of Oxford
Graph Theory and Probabilistic Combinatorics course of the University of Oxford
Year 4 of the mathematics course of the University of Oxford
Mathematics course of the University of Oxford
Undergraduate course of the University of Oxford
Course of the University of Oxford
University of Oxford
List of universities
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version