Random Variables and Probability Distributions
Random Variables
A random variable is a function that maps from a sample space to a state space. Often, but not always, the state space is a set of real numbers. For sample space , we have and for , we have where is a value of the random variable and an element of the state space .
In other words, a random variable is a function whose domain is a sample space and whose @codomain is a state space (called an alphabet when the state space is @discrete).
Referenced by (62 direct, 74 transitive)
Direct references:
- Discrete Entropy
- Self-Information
- Entropy
- remark-14
- theorem-16
- Joint Entropy
- Conditional Entropy
- Mutual Information
- Conditional Mutual Information
- Nonnegativity of Mutual Information
- Uniform distribution maximizes entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-fanos-inequality
- corollary-88
- Some Continuous Probability Distributions
- Uniform Distribution
- Normal Distribution
- Standard Normal Distribution
- Normal Approximation to the Binomial
- A/B Test
- Binomial Distribution
- Poisson Distribution
- Poisson Approximation to the Binomial
- Negative Binomial Distribution
- Expected Value
- Variance
- Jensen's Inequality
- Joint Probability Distribution
- theorem-7
- Convolution
- Sum of Independent Poisson Random Variables
- Sum of Independent Normal Random Variables
- Covariance
- Limit Theorems
- Markov's Inequality
- markov-inequality-fish
- Chebyshev's Inequality
- chebyshevs-inequality-note
- proof-of-chebyshevs-inequality
- chebyshev-fish
- Pairwise Independence
- Mutual Independence
- Identically Distributed
- Independent and Identically Distributed
- Law of Large Numbers
- law-of-large-numbers-note
- proof-of-law-of-large-numbers
- Moment Generating Function
- Moment Generating Function of a Sum
- Continuity Theorem for Moment Generating Functions
- Central Limit Theorem
- Markov Chain
- Conditional Independence Given Intermediate Step
- Reversibility of Markov Chains
- Function of middle variable forms Markov Chain
- Probability Basics
- Random Variables and Probability Distributions
- State Space
- Discrete Random Variable
- Absolutely Continuous Random Variable
- Probability Distribution
- Cumulative Distribution Function
Transitive (depth 1):
- Probability Density Function
- Hypergeometric Distribution
- note-25
- proof-of-chain-rule-for-mutual-information
- Geometric Distribution
- Probability of Error
- Conditioning Reduces Entropy
- Cross-Entropy
- doubly-stochastic-maps-increase-entropy-intuition
- Entropy Rate
- fanos-inequality-remark
- Gibbs' Inequality
- Chain rule for joint entropy
- KL Divergence
- lemma-93
- Noiseless channel transmitting discrete symbols
- note-8
- proof-of-concavity-of-entropy
- proof-of-doubly-stochastic-maps-increase-entropy
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-uniform-distribution-maximizes-entropy
- theorem-12
- Weak Asymptotic Equipartition Property
- Interpretation
- markovs-inequality-note
- proof-of-markovs-inequality
- proof-of-weak-asymptotic-equipartition-property
- proof-of-processing-cannot-increase-information
- proof-of-corollary-95
- proof-of-gibbs-inequality
- proof-of-lemma-93
- proof-of-log-sum-inequality
- proof-of-conditioning-reduces-entropy
- Conditional Relative Entropy
- Conditionally Independent
- proof-of-concavity-and-convexity-of-mutual-information
- Ergodic
- note-19
- proof-of-characterization-of-sufficiency
- proof-of-data-processing-inequality
- Stationary Distribution of an Ergodic Chain
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- Sufficient Statistic
- Concavity and Convexity of Mutual Information
- proof-of-nonnegativity-of-mutual-information
- Characterization of Sufficiency
- Conditional Probability Distribution
- Convexity of Relative Entropy
- Product Distribution
- proof-of-convexity-of-relative-entropy
- proof-of-nonnegativity-of-relative-entropy
- note-15
- remark-8
- note-3
- concavity-of-entropy-intuition
- Confidence Interval for a Mean, Known Variance
- Confidence Interval for a Mean, Unknown Variance
- Standard Deviation
- variance-interpretation
Transitive (depth 2):
- proof-of-joint-is-marginal-times-conditional
- proof-of-chain-rule-for-relative-entropy
- proof-of-nonnegativity-of-conditional-relative-entropy
- Nonnegativity of Conditional Mutual Information
- proof-of-conditional-independence-given-intermediate-step
- proof-of-nonnegativity-of-conditional-mutual-information
- Model Training
- proof-of-chain-rule-for-entropy
- proof-of-mutual-information-and-entropy
- convexity-of-relative-entropy-intuition
- remark-32
- Multiplication Rule for Distributions
- proof-of-corollary-77
- characterization-of-sufficiency-example
- Minimal Sufficient Statistic
Random variables don't have to map to all reals; for example, Bernoulli random variables map to either 0 or 1.
The set of values a random variable can take is called its state space.
Referenced by (4 direct, 127 transitive)
Direct references:
Transitive (depth 1):
- Independent and Identically Distributed
- Conditional Relative Entropy
- convexity-of-relative-entropy-intuition
- Mutual Information
- proof-of-chain-rule-for-relative-entropy
- proof-of-concavity-and-convexity-of-mutual-information
- proof-of-doubly-stochastic-maps-increase-entropy
- proof-of-nonnegativity-of-conditional-relative-entropy
- remark-32
- A/B Test
- Absolutely Continuous Random Variable
- Binomial Distribution
- Central Limit Theorem
- chebyshev-fish
- Chebyshev's Inequality
- chebyshevs-inequality-note
- Conditional Entropy
- Conditional Independence Given Intermediate Step
- Conditional Mutual Information
- Convolution
- corollary-88
- Covariance
- Cumulative Distribution Function
- Discrete Random Variable
- Entropy
- Expected Value
- Function of middle variable forms Markov Chain
- Jensen's Inequality
- Joint Entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- Joint Probability Distribution
- Law of Large Numbers
- law-of-large-numbers-note
- Markov Chain
- markov-inequality-fish
- Markov's Inequality
- Continuity Theorem for Moment Generating Functions
- Moment Generating Function of a Sum
- Moment Generating Function
- Mutual Independence
- Negative Binomial Distribution
- Nonnegativity of Mutual Information
- Normal Approximation to the Binomial
- Normal Distribution
- Pairwise Independence
- Poisson Approximation to the Binomial
- Poisson Distribution
- Probability Distribution
- proof-of-chebyshevs-inequality
- proof-of-fanos-inequality
- proof-of-law-of-large-numbers
- remark-14
- Reversibility of Markov Chains
- Self-Information
- Standard Normal Distribution
- Sum of Independent Normal Random Variables
- Sum of Independent Poisson Random Variables
- theorem-16
- theorem-7
- Uniform Distribution
- Uniform distribution maximizes entropy
- Variance
Transitive (depth 2):
- Probability Density Function
- Hypergeometric Distribution
- note-25
- proof-of-chain-rule-for-mutual-information
- Geometric Distribution
- Probability of Error
- Conditioning Reduces Entropy
- Cross-Entropy
- doubly-stochastic-maps-increase-entropy-intuition
- Entropy Rate
- fanos-inequality-remark
- Gibbs' Inequality
- Chain rule for joint entropy
- lemma-93
- Noiseless channel transmitting discrete symbols
- note-8
- proof-of-concavity-of-entropy
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-uniform-distribution-maximizes-entropy
- theorem-12
- Weak Asymptotic Equipartition Property
- Interpretation
- markovs-inequality-note
- proof-of-markovs-inequality
- proof-of-weak-asymptotic-equipartition-property
- proof-of-processing-cannot-increase-information
- proof-of-corollary-95
- proof-of-gibbs-inequality
- proof-of-lemma-93
- proof-of-log-sum-inequality
- proof-of-conditioning-reduces-entropy
- Conditionally Independent
- Ergodic
- note-19
- proof-of-characterization-of-sufficiency
- proof-of-data-processing-inequality
- Stationary Distribution of an Ergodic Chain
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- Sufficient Statistic
- Concavity and Convexity of Mutual Information
- proof-of-nonnegativity-of-mutual-information
- Characterization of Sufficiency
- Conditional Probability Distribution
- Convexity of Relative Entropy
- Product Distribution
- proof-of-convexity-of-relative-entropy
- proof-of-nonnegativity-of-relative-entropy
- note-15
- remark-8
- concavity-of-entropy-intuition
- Confidence Interval for a Mean, Known Variance
- Confidence Interval for a Mean, Unknown Variance
- Standard Deviation
- variance-interpretation
Transitive (depth 3):
- proof-of-joint-is-marginal-times-conditional
- Nonnegativity of Conditional Mutual Information
- proof-of-conditional-independence-given-intermediate-step
- proof-of-nonnegativity-of-conditional-mutual-information
- Model Training
- proof-of-chain-rule-for-entropy
- proof-of-mutual-information-and-entropy
- Multiplication Rule for Distributions
- proof-of-corollary-77
- characterization-of-sufficiency-example
- Minimal Sufficient Statistic
While the state space is the @codomain of a random variable, the actual values that are mapped to by the random variable are the @image of the random variable. Furthermore, we often only care about the places were is non-zero.
Returning to sample spaces briefly:
If a sample space contains a finite number of possibilities, or an unending sequence with as many elements as there are whole numbers (countably infinite), it is called a discrete sample space.
If a sample space contains an infinite number of possibilities equal to the number of points on a line segment, it is called a continuous sample space.
Referenced by (1 direct)
Direct references:
A random variable is called a discrete random variable if there exists a countable set such that
In this case its state space is often called an alphabet.
Referenced by (6 direct, 94 transitive)
Direct references:
Transitive (depth 1):
- Independent and Identically Distributed
- Mutual Independence
- Pairwise Independence
- Uniform Distribution
- Negative Binomial Distribution
- Binomial Distribution
- Characterization of Sufficiency
- Conditional Probability Distribution
- Conditional Relative Entropy
- Convexity of Relative Entropy
- Convolution
- Expected Value
- Hypergeometric Distribution
- Poisson Approximation to the Binomial
- Poisson Distribution
- Product Distribution
- proof-of-convexity-of-relative-entropy
- proof-of-nonnegativity-of-relative-entropy
- Sufficient Statistic
- Variance
Transitive (depth 2):
- Normal Approximation to the Binomial
- proof-of-concavity-and-convexity-of-mutual-information
- proof-of-joint-is-marginal-times-conditional
- proof-of-chain-rule-for-relative-entropy
- proof-of-nonnegativity-of-conditional-relative-entropy
- proof-of-concavity-of-entropy
- Cross-Entropy
- Entropy
- Entropy Rate
- Jensen's Inequality
- markov-inequality-fish
- Interpretation
- markovs-inequality-note
- proof-of-markovs-inequality
- proof-of-weak-asymptotic-equipartition-property
- Law of Large Numbers
- lemma-93
- Weak Asymptotic Equipartition Property
- theorem-12
- theorem-7
- Sum of Independent Poisson Random Variables
- Multiplication Rule for Distributions
- Mutual Information
- characterization-of-sufficiency-example
- Minimal Sufficient Statistic
- proof-of-characterization-of-sufficiency
- A/B Test
- chebyshev-fish
- chebyshevs-inequality-note
- Confidence Interval for a Mean, Known Variance
- Confidence Interval for a Mean, Unknown Variance
- Normal Distribution
- proof-of-chebyshevs-inequality
- proof-of-law-of-large-numbers
- Standard Deviation
- Standard Normal Distribution
- Sum of Independent Normal Random Variables
- variance-interpretation
Transitive (depth 3):
- Gibbs' Inequality
- KL Divergence
- Model Training
- Conditional Mutual Information
- Conditioning Reduces Entropy
- doubly-stochastic-maps-increase-entropy-intuition
- fanos-inequality-remark
- Chain rule for joint entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- Noiseless channel transmitting discrete symbols
- note-25
- note-8
- proof-of-doubly-stochastic-maps-increase-entropy
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-uniform-distribution-maximizes-entropy
- remark-14
- theorem-16
- Uniform distribution maximizes entropy
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- proof-of-corollary-95
- proof-of-gibbs-inequality
- proof-of-lemma-93
- proof-of-log-sum-inequality
- Concavity and Convexity of Mutual Information
- proof-of-nonnegativity-of-mutual-information
- Central Limit Theorem
- Chebyshev's Inequality
Transitive (depth 4):
- proof-of-chain-rule-for-mutual-information
- proof-of-fanos-inequality
- proof-of-nonnegativity-of-conditional-mutual-information
- proof-of-chain-rule-for-entropy
- proof-of-conditioning-reduces-entropy
- proof-of-mutual-information-and-entropy
- convexity-of-relative-entropy-intuition
- remark-32
- concavity-of-entropy-intuition
For a real valued random variable
we call a continuous random variable if there exists a function
such that for every measurable set
where is the probability density function of
TODO: this definition excludes some continuous distributions like the Cantor distribution and in general isn't quite there yet in terms of measure theory. I need to revisit this when I've learned a bit more of measure theory.
Referenced by (2 direct, 1 transitive)
Transitive (depth 1):
Discrete random variables tend to represent counted data, while continuous random variables tend to represent measured data.
Probability Distributions
Discrete Probability Distributions
A discrete random variable takes each of its values with a certain probability. The function that gives the probability of each value of a random variable occurring is called the probability function, probability mass function, or probability distribution. More formally, the set of ordered pairs is a probability distribution of the discrete random variable if, for each possible outcome :
Referenced by (19 direct, 79 transitive)
Direct references:
- Conditional Relative Entropy
- proof-of-nonnegativity-of-relative-entropy
- Convexity of Relative Entropy
- proof-of-convexity-of-relative-entropy
- Characterization of Sufficiency
- Some Continuous Probability Distributions
- Binomial Distribution
- Hypergeometric Distribution
- Poisson Distribution
- Poisson Approximation to the Binomial
- Geometric Distribution
- Expected Value
- Variance
- Conditional Probability Distribution
- Product Distribution
- Convolution
- Identically Distributed
- Cumulative Distribution Function
- Sufficient Statistic
Transitive (depth 1):
- Normal Approximation to the Binomial
- proof-of-concavity-and-convexity-of-mutual-information
- proof-of-joint-is-marginal-times-conditional
- proof-of-chain-rule-for-relative-entropy
- proof-of-nonnegativity-of-conditional-relative-entropy
- proof-of-concavity-of-entropy
- Independent and Identically Distributed
- Mutual Independence
- Pairwise Independence
- Uniform Distribution
- Cross-Entropy
- Entropy
- Entropy Rate
- Jensen's Inequality
- markov-inequality-fish
- Interpretation
- markovs-inequality-note
- proof-of-markovs-inequality
- proof-of-weak-asymptotic-equipartition-property
- Negative Binomial Distribution
- Sum of Independent Poisson Random Variables
- Multiplication Rule for Distributions
- Mutual Information
- theorem-7
- characterization-of-sufficiency-example
- Minimal Sufficient Statistic
- proof-of-characterization-of-sufficiency
- A/B Test
- chebyshev-fish
- chebyshevs-inequality-note
- Confidence Interval for a Mean, Known Variance
- Confidence Interval for a Mean, Unknown Variance
- Normal Distribution
- proof-of-chebyshevs-inequality
- proof-of-law-of-large-numbers
- Standard Deviation
- Standard Normal Distribution
- Sum of Independent Normal Random Variables
- variance-interpretation
Transitive (depth 2):
- Gibbs' Inequality
- KL Divergence
- Model Training
- Conditional Mutual Information
- Conditioning Reduces Entropy
- doubly-stochastic-maps-increase-entropy-intuition
- fanos-inequality-remark
- Chain rule for joint entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- lemma-93
- Noiseless channel transmitting discrete symbols
- note-25
- note-8
- proof-of-doubly-stochastic-maps-increase-entropy
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-uniform-distribution-maximizes-entropy
- remark-14
- theorem-12
- theorem-16
- Uniform distribution maximizes entropy
- Weak Asymptotic Equipartition Property
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
- Law of Large Numbers
- proof-of-corollary-95
- proof-of-gibbs-inequality
- proof-of-lemma-93
- proof-of-log-sum-inequality
- Concavity and Convexity of Mutual Information
- proof-of-nonnegativity-of-mutual-information
- Central Limit Theorem
- Chebyshev's Inequality
Transitive (depth 3):
- proof-of-chain-rule-for-mutual-information
- proof-of-fanos-inequality
- proof-of-nonnegativity-of-conditional-mutual-information
- proof-of-chain-rule-for-entropy
- proof-of-conditioning-reduces-entropy
- proof-of-mutual-information-and-entropy
- convexity-of-relative-entropy-intuition
- remark-32
- concavity-of-entropy-intuition
Sometimes we want to know the probability that a random variable will be less than or equal to some real number If we let for all real , we define to be the cumulative distribution function of the random variable More formally, the cumulative distribution function of a discrete random variable with a probability distribution is:
Referenced by (6 direct, 6 transitive)
Direct references:
Continuous Probability Distributions
A continuous random variable has a probability of of exactly assuming any particular value. That's because, in any interval of real numbers, there are infinitely many points, and so the denominator for the proportion is infinite. For example, there are infinitely many points between and , and again, infinitely many points between and and so on, regardless of the level of precision.
So, instead of focusing on probabilities of particular values, we focus on probabilities of values falling in various intervals. For example, instead of asking what the probability that someone weighs pounds is, we can ask what is the probability that they weigh between and pounds.
The function is a probability density function (pdf) for the continuous random variable , defined on the reals, if
- for all
Referenced by (2 direct)
Direct references:
In other words, if we integrate from to we will get the probability of taking on a value between and .
From here, the cumulative distribution function of a continuous random variable with density function is attained by simply integrating from to :