LEARN

Single courses on a specific subject, taught by MIT instructors

A series of courses for in-depth learning across a range of topics

Learning Materials

Free learning and teaching materials, including videos, podcasts, lecture notes, and more

BROWSE

DISCOVER LEARNING RESOURCES

With Certificate

Video details loaded

HomeMIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024Markov, Chebyshev, and Chernoff

MIT 18.226 Probabilistic Methods in Combinatorics, Fall 2024

Video 8 of 10

Previous: Crossing Number Inequality Next: Bounded Differences Inequality (aka Azuma-Hoeffding Inequality)

Markov, Chebyshev, and Chernoff

16:30

Up Next

Bounded Differences Inequality (aka Azuma-Hoeffding Inequality)

Three basic and important inequalities in probabilistic analysis.