Exercise: Chebyshev versus Markov

2 points possible (graded)
Let X be a random variable with zero mean and finite variance. The Markov inequality applied to [X] yields

P(IXI>=a)<=E[IXI]/a
whereas the Chebyshev inequality yields
P(IXI>=a)<=E[IX²I]/a²

a) Is it true that the Chebyshev inequality is stronger (i.e., the upper bound is smaller) than the Markov inequality, when is very large?

Select an option
unanswered
b) Is it true that the Chebyshev inequality is always stronger (i.e., the upper bound is smaller) than the Markov inequality?

1 answer

a) Yes
b) No
Similar Questions
  1. Exercise: Steady-state calculation0.0/4.0 points (graded) Consider again the Markov chain with the following transition
    1. answers icon 1 answer
  2. Exercise: Path calculation0.0/3.0 points (graded) Consider a Markov chain with the following transition probability graph: This
    1. answers icon 1 answer
  3. Exercise: Periodic states2/4 points (graded) Consider a Markov chain with the following transition probability graph: This
    1. answers icon 1 answer
  4. Exercise: Polling4 points possible (graded) We saw that if we want to have a probability of at least 95% that the poll results
    1. answers icon 0 answers
more similar questions