LECTURES A GRATIS GLOBAL SERVICE
⌕ SEARCH GRATIS GLOBAL ↗
LECTURES
Lecture 20: Independence
SOURCE: YOUTUBE · NO TRACKING UNTIL YOU PRESS PLAY · TROUBLE PLAYING? WATCH AT THE SOURCE ↗

Lecture 20: Independence

82 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Mathematics for Computer Science · LECTURE 20

Erik Demaine teaches probability theory in this MIT lecture from 6.1200J Mathematics for Computer Science, covering three forms of independence that recur throughout discrete math and computer science: mutual independence, pairwise independence, and conditional independence. The lecture works through definitions and examples showing how events can be pairwise independent without being mutually independent, a distinction that trips up many students, and how conditioning on new information changes independence relationships. As with the rest of the course, the session builds on earlier material on probability spaces and random variables, developing the formal tools needed for later topics like expectation and concentration bounds. Demaine works through the material on a whiteboard at a measured pace typical of MIT's OpenCourseWare lectures, favoring worked examples over abstract statement alone. Runtime runs 82 minutes, consistent with a full lecture session rather than a clipped excerpt.

At a glance

Lecture facts

Runtime compared with the other 507 Mathematics lectures
Runtime1 h 22 m
Compared with MathematicsLonger than 87%
This series

Mathematics for Computer Science

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 18 of 2222 h 28 m before this · 29 h 3 m in total

More from this course

12 LECTURES
Predicates, Sets, and Proofs

Predicates, Sets, and Proofs

MIT · 79 MIN
Contradiction and Induction

Contradiction and Induction

MIT · 80 MIN
State Machines

State Machines

MIT · 81 MIN
Lecture 5: Sums

Lecture 5: Sums

MIT · 82 MIN
Lecture 6: Asymptotics

Lecture 6: Asymptotics

MIT · 78 MIN
Divisibility

Divisibility

MIT · 79 MIN
Modular Arithmetic

Modular Arithmetic

MIT · 80 MIN
Lecture 10: Cryptography

Lecture 10: Cryptography

MIT · 81 MIN
Graphs and Coloring

Graphs and Coloring

MIT · 81 MIN
Lecture 12: Matching

Lecture 12: Matching

MIT · 82 MIN
Lecture 13: Connectivity and Trees

Lecture 13: Connectivity and Trees

MIT · 82 MIN
Digraphs and DAGs

Digraphs and DAGs

MIT · 79 MIN