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

Lecture 2: Independence and Conditioning

71 MIN · EN · STATUS: [ STREAMING ]
RATE THIS
MIT · Principles of Discrete Applied Mathematics · LECTURE 2

MIT professor Ankur Moitra continues his course 18.200, Principles of Discrete Applied Mathematics, with a lecture on the foundations of probability. He defines what it means for two events to be independent, then introduces conditioning, working through the law of Total Probability and Bayes' rule with worked examples on the board. The second half of the lecture turns to random variables, covering expectation and proving linearity of expectation, the property that lets you compute the expected value of a sum by adding individual expectations even when the variables are dependent. The seventy-one minute session is blackboard-style, Moitra building each definition from the last and pausing to work through small examples before stating the general theorems, aimed at students who already have the basic axioms of probability and are moving toward applications in discrete mathematics and combinatorics.

At a glance

Lecture facts

Runtime compared with the other 148 Computer Science lectures
Runtime1 h 11 m
Compared with Computer ScienceShorter than 55%
This series

Principles of Discrete Applied Mathematics

Every lecture in order, sized by its length.

  • Earlier lectures
  • This lecture
  • Still to come
Lecture 2 of 191 h 14 m before this · 23 h 23 m in total

More from this course

12 LECTURES
Pigeonhole Principle

Pigeonhole Principle

MIT · 74 MIN
Lecture 3: Inclusion-Exclusion

Lecture 3: Inclusion-Exclusion

MIT · 79 MIN
Lecture 4: Counting

Lecture 4: Counting

MIT · 78 MIN
More Counting and Generating Functions

More Counting and Generating Functions

MIT · 72 MIN
More on Generating Functions

More on Generating Functions

MIT · 80 MIN
Generating Functions for Catalan Numbers

Generating Functions for Catalan Numbers

MIT · 72 MIN
Tail Bounds

Tail Bounds

MIT · 81 MIN
Lecture 9: Chernoff Bounds

Lecture 9: Chernoff Bounds

MIT · 55 MIN
Basic Group Theory

Basic Group Theory

MIT · 75 MIN
Introduction to Linear Programming

Introduction to Linear Programming

MIT · 74 MIN
Duality in Linear Programming

Duality in Linear Programming

MIT · 76 MIN
Zero-Sum Games

Zero-Sum Games

MIT · 74 MIN