Seyed Masoud Hosseini · Overview · Study log · Weekly summaries · Ideas · Search · Transcript · RSS feed

Probability · Lecture 22 of 76 · 17:37

Joint Probability Mass Function (PMF) Drill 1

Joint Probability Mass Function (PMF) Drill 1 on YouTube

Study guide

What this lecture covers

This recitation problem practices reading a joint PMF given as a scatter of equally likely points in the plane. It builds on earlier material on joint PMFs, conditioning and expectation, showing how to compute conditional expectations and variances quickly using a "center of mass" shortcut instead of grinding through the full definitions each time.

By the end, you'll be able to find conditional expectation and variance from a small joint PMF, and derive the PMF of a new random variable built from two others, such as their minimum or their product.

Key ideas

  • Center of mass shortcut: when outcomes are equally likely, a conditional expectation is just the average (midpoint) of the values that remain possible.
  • Conditioning restricts the sample space: fixing x to a specific value keeps only the points on that vertical line, and they stay equally likely relative to each other.
  • Variance formula: Var(X|Y=y) = E[X^2|Y=y] - (E[X|Y=y])^2, computed the same way as unconditional variance but within the reduced conditional universe.
  • Derived random variables from geometry: comparing points against a line (like y = x) tells you which of two variables is the minimum at each point, letting you read off the PMF of min(X,Y) directly.
  • Conditioning on an event: an event like X^2 >= Y again restricts the points to a subset (those below a curve), which are then treated as equally likely among themselves.
  • Sanity checks matter: after building a PMF table, its probabilities should sum to 1.

Before you watch

  • Know the definitions of joint PMF, conditional PMF, expectation and variance.
  • Be comfortable computing expectation as a weighted average over discrete outcomes.
  • This drill assumes familiarity with conditioning on random variables from an earlier lecture in the course.

Check your understanding

  1. Why does conditioning on X=x preserve the relative probabilities among the remaining points?
  2. How would you find the PMF of max(X,Y) using the same geometric approach used for min(X,Y)?
  3. Why is the conditional variance of X given Y=0 equal to zero in this problem?
  4. What's the difference between computing E[XY] unconditionally versus conditioned on the event A?

Vocabulary

scatter (of points) (noun)
A spread of separate points across a graph, without a continuous line.
The joint PMF is given as a scatter of eight equally likely points.
center of mass (noun)
The balance point of a set of values or points.
The center of mass shortcut quickly finds a conditional expectation.
conditional variance (noun)
The variance of a random variable computed only among outcomes matching a condition.
The conditional variance shrinks to zero when only one point remains possible.
derived random variable (noun)
A new random variable created by combining or transforming existing ones.
The minimum of X and Y is a derived random variable.
sanity check (phrase)
A quick check to make sure a result is reasonable before trusting it.
Checking that the probabilities sum to 1 is a useful sanity check.
equally likely points (noun)
A set of outcomes where each one has exactly the same probability.
The joint PMF is given as eight equally likely points.
geometric approach (noun)
A method of solving a problem by reasoning about shapes or positions.
The same geometric approach finds the PMF of the maximum too.
vertical line (noun)
A straight line running up and down on a graph, often used to fix one coordinate.
Fixing x keeps only the points on that vertical line.
restrict (a set) (verb)
To limit consideration to a smaller subset of a larger set.
Conditioning restricts the sample space to points below the curve.
curve (noun)
A line on a graph that is not straight, often representing a boundary.
The event X squared at least Y restricts points to below a curve.
minimum (noun)
The smallest value among a group of numbers.
The PMF of the minimum of X and Y is found geometrically.
maximum (noun)
The largest value among a group of numbers.
The same method could find the PMF of the maximum instead.
shortcut method (noun)
A quicker way of reaching an answer than the full formal definition.
The center of mass shortcut avoids grinding through full definitions.
practice (a drill) (verb)
To work through exercises to build skill in a topic.
This recitation problem practices reading a joint PMF.
table (of values) (noun)
A grid listing values for each possible pair of outcomes.
After building a PMF table, check that it sums to 1.
point (coordinate pair) (noun)
A location described by a pair of values, such as x and y.
Each of the eight points represents one possible outcome.
grind through (phrasal verb)
To work slowly and laboriously through a long calculation.
The shortcut avoids grinding through the full definitions each time.
quickly (find) (adverb)
Rapidly, without much delay.
You can quickly find the conditional expectation using the shortcut.
small joint PMF (noun)
A joint probability table with only a few possible outcomes.
The drill uses a small joint PMF with only eight points.
builds on (phrasal verb)
To use earlier material as the foundation for something new.
This recitation problem builds on earlier material on joint PMFs.

Chapters

From the YouTube description

MIT 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013
View the complete course: http://ocw.mit.edu/6-041SCF13
Instructor: Katie Szeto

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

← Flipping a Coin a Random Number of Times · The Coupon Collector Problem →