Save this video free

Stats 102C - Lecture 12 - Basic Multivariate Sampling

Miles Chen · 49:34 · Watch on YouTube

Stats 102C - Lecture 12 - Basic Multivariate Sampling Watch on YouTube →

Overview

Miles Chen develops basic multivariate sampling by showing how to sample dependent discrete pairs, generate independent standard normals with the Box-Muller transform, and convert those normals into a correlated bivariate normal. The lecture also demonstrates how shuffling one column preserves marginal frequencies but destroys the original joint dependence, and derives the covariance of linear combinations of independent normals.

Key takeaways

Chapters

0:00 From Monte Carlo Estimation to Multivariate Samples
3:30 Sampling a Discrete Joint PMF with One Uniform Draw
5:45 Implementing Categorical Sampling in R and Python
9:33 Why Shuffling Y Preserves Marginals but Breaks Dependence
13:28 Box-Muller Derivation: From Independent Normals to Polar Coordinates
23:00 Box-Muller Sampling Formula and Normal-Point Geometry
34:30 Rescaling Standard Normals and Constructing Correlated Pairs
42:00 Simulating a Correlated Bivariate Normal in Python
46:45 Linear Combinations: Variance and Covariance of Normal Variables

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:02 All right. Happy Monday, 8:00 a.m. Thanks for for being here and enjoying me for lecture 12, multivariate sampling. Okay, so um so far we've kind of the story of the course so far is um we started off with some Bayesian ideas and the the reason why I started off with Bayesian ideas is because I wanted to show that um doing posterior inference uh is is hard and um and it often requires doing an integral or you can take the money Carlo approach and by um generating a random sample

0:53 uh you can estimate, you know, quantities. And so we did a little bit of money Carlo estimation and things like that where we used random samples to um to estimate those quantities. And then we talked about, well, how do we get those random samples? And uh and the short of it is a lot of this stuff is already built into your computer with the random number generator. But we talked a little bit about how some of these random number generators work. And we did inverse CDF and rejection sampling and things like that. And those were all ways for us to get univariate random samples. And uh and today now we want to say we want to draw um multivariate samples where one draw will consist of

1:42 more than one value, okay? And uh and when we do that, we don't necessarily want X and Y to be independent, okay? If If X and Y are independent, it would be simple. We just generate X and And independently we generate Y and then we would have no problem. But a lot of times we want to show that there's some kind of covariance between them. And so um this it gets uh we're going to start off with

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Miles Chen.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.