18.200 Principles of Discrete Applied Mathematics
18.200 Principles of Discrete Applied Mathematics (Spring 2024, MIT OCW). Instructors: Prof. Ankur Moitra, Prof. Peter Shor, and Susan Ruff. This course will teach you illustrative topics in discrete applied mathematics, including counting, generating functions, probability, linear optimization, algebraic structures, basic number theory, information theory, and coding theory. It is a CI-M (Communication Intensive in the Major) course and thus includes a writing component. (from ocw.mit.edu)
| Lecture 08 - Tail Bounds |
In this lecture we cover tail bounds; these bound the probability that a random variable is far away from the mean. We give Markov's bound and Chebyshev's bound. We then use Chebyshev's bound to prove the weak law of large numbers.
Go to the Course Home or watch other lectures: