ConceptMathematics
Random variable
A function from the sample space to the real numbers.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
8Each in their own terms, from the easiest level.
Joe Blitzstein
A function that assigns a numerical value to each outcome in a sample space.Pieter Abbeel
A random variable represents an event whose outcome is unknown.Brian Yu
A variable in probability theory that has a domain of possible values it can take on.Robert Shiller
A quantity whose value is uncertain in advance and is determined by an experiment or event.Peter Kempthorne, Jake Xia & Vasily Strela
A mapping from a sample space to non-negative real numbers, categorized into discrete and continuous types.Ankur Moitra
A function defined on the sample space that assigns to each outcome a real value.Ryan O'Donnell
A real number assigned to each outcome of a probability distribution.
Lectures that assume it
90The first 12 are shown.
- Large Deviations
- Law of Large Numbers and Central Limit Theorem (Statistics 110, Lecture 29)
- Expectation II
- Random Walks
- Computational Indistinguishability
- Expectation Values of Operators (MIT 8.04 Quantum Physics I)
- Expectation I
- Approximate counting
- Portfolio Theory II
- Statistical Estimation
- Central Limit Theorem
- Auctions
Connections
110The lectures that define it or assume it, and the concepts next to it.
Concepts10
Lectures100
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Gambler's Ruin and Random Variables
- Random Variables and Their Distributions
- Probability
- Quantum Probability
- Random Variables
Show 94 moreShow fewer
- Search with Other Agents: Expectimax, Utilities
- Technology and Invention in Finance
- Probability Theory
- Independence and Conditioning
- Large Deviations
- Law of Large Numbers and Central Limit Theorem (Statistics 110, Lecture 29)
- Expectation II
- Random Walks
- Computational Indistinguishability
- Expectation Values of Operators (MIT 8.04 Quantum Physics I)
- Expectation I
- Approximate counting
- Portfolio Theory II
- Statistical Estimation
- Central Limit Theorem
- Auctions
- Order Statistics and Conditional Expectation
- Conditional Expectation Given a Random Variable (Statistics 110, Lecture 27)
- RL Theory
- The Switching Lemma: PRST Version
- Stochastic Processes I
- Randomization: Universal & Perfect Hashing
- Expectation Continued
- The Poisson Distribution
- Normal Distribution
- Multinomial and Cauchy
- Bayes' Nets: Sampling
- Linear-size ℓ₁ Sparsifiers
- Majority, LTFs, and the CLT
- Inclusion-Exclusion
- Markov Chains
- Exploration and Exploitation
- Expectation, Indicator Random Variables, Linearity
- Discrete vs. Continuous, the Uniform
- Moment Generating Functions
- Decision Networks and Value of Perfect Information (VPI)
- Integer Lower Bounds
- Level-1 Inequality and the 2/π Theorem
- The Hypercontractivity Theorem
- Surrogate Modeling and Bayesian Optimization (Part 2)
- Conditional Expectation Continued: Two Envelope Paradox and Coin Flips (Statistics 110, Lecture 26)
- Inequalities
- Chi-Square, Student-t, and Multivariate Normal Distributions
- Hardness Amplification
- Bargaining with Incomplete Information
- Randomization: Skip Lists
- Location, Scale, and LOTUS
- Transformations and Convolutions
- Progress on Zeta and L-Functions Motivated by the Riemann Hypothesis
- Invariance Theorems
- Sound Localization, Pitch, Timbre, and Loudness / Psychophysical Methods
- Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
- Mechanism Design & Game-Theoretic Incentives for Collaborative Learning
- Risk and Financial Crises
- Covariance and Correlation
- Time Series Analysis III
- Gaussian Random Variables
- Markov and Chebyshev Inequalities
- Random Processes and Quasirandomness for Decomposition Problems
- Generative Models: Conditional Models
- Chernoff Bounds
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Localization and Cutting-Plane Methods
- Beta Distribution
- k-wise Independent Generators
- Mutual Information
- Inverse Reinforcement Learning, Part 4
- Hardness vs. Randomness I
- Hardness vs. Randomness II
- Quantum Information Theory
- Definitions and Inequalities
- Machine Learning: Naive Bayes
- Tail Bounds
- Saddle Points Continued, Maxmin Principle
- Joint, Conditional, and Marginal Distributions
- Stochastic dynamics
- Particle Filtering
- Factor Modeling
- Stochastic Processes II
- Chernoff, Hoeffding, etc. bounds
- What Really Causes Recessions?
- Representation Learning: Theory
- Generative Models: Basics
- Fractals in Science, Engineering and Finance (Roughness and Beauty)
- A Look Ahead
- Beyond Worst-Case Analysis
- Public Finance (Part 2)
- Regression Analysis
- Time Series Analysis I
- MGFs Continued
- Analysis of Boolean Functions: Applications in Social Choice
- Day 3 (I) - End-of- study analyses_ Prof. Shrikant I Bangdiwala
- Sequential Optimization of Dynamically Augmented Conditional Value-at-Risk
- Day 2 (IV) - Study efficacy outcomes_ Prof. Shrikant I Bangdiwala