Sign inSign in

Markov's inequality

Markov's inequality bounds the probability that a non-negative random variable is greater than or equal to a positive constant by the ratio of its expected value to that constant.
as Tom Leighton defines itMITThe wording closest to all 7 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

5

Each in their own terms, from the easiest level.

  • Joe Blitzstein

    Harvard University · Undergraduate

    Markov's inequality bounds the probability that a nonnegative random variable is greater than or equal to a positive constant by its expected value divided by that constant.
  • Gilbert Strang

    MIT · Undergraduate

    Markov's inequality provides an upper bound for the probability that a non-negative random variable is greater than or equal to some positive constant.
    • 10:02Definitions and Inequalities
  • Ankur Moitra

    MIT · Undergraduate

    A bound on the probability that a non-negative random variable exceeds a certain value, given by the ratio of its expectation to that value.
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    An inequality that provides an upper bound on the probability that a non-negative random variable exceeds a certain value based only on its mean.
    • 4:16Approximate counting
    • 9:07Markov and Chebyshev Inequalities
    • 1:12:08Bonami's Lemma and the KKL Theorem

Lectures that assume it

5

Connections

21

The lectures that define it or assume it, and the concepts next to it.

5 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.