Sign inSign in

Union bound

A probability rule stating that the probability of the union of multiple events is at most the sum of their individual probabilities.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 11 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.

Probability axioms4Probability theory3Basic probability2Event2Probability2Probability of events2

Opens up

Concepts that name this one as a prerequisite.

Lecturers

6

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 1:03:36Period-Finding (Simon's Algorithm over Z_N)
    • 1:11:05Probabilistic Complexity Classes
    • 51:19Introduction to Arthur-Merlin classes, MA and AM
  • Yaser Abu-Mostafa

    Caltech · Undergraduate

    A rule stating that the probability of a union of events is less than or equal to the sum of the probabilities of the individual events.
    • 51:46Is Learning Feasible?
    • 3:13The Linear Model I
    • 10:51Training Versus Testing
  • Tom Leighton

    MIT · Undergraduate

    The probability of a union of events is upper bounded by the sum of the probabilities of the individual events.
  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    The probability of the union of multiple events is at most the sum of the individual probabilities of those events.
    • 53:57BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Srini Devadas

    MIT · Undergraduate

    A rule stating that the probability that at least one of a countable set of events occurs is at most the sum of the probabilities of the individual events.
    • 49:51Randomization: Skip Lists
  • Ankur Moitra

    MIT · Undergraduate

    The probability of a union of events is at most the sum of the probabilities of the individual events.
    • 50:27Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem

Lectures that assume it

3

Connections

23

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

Concepts9

Show 3 more

Lectures14

Show 8 more

6 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.