Expectation
Expected Value
Let be a random variable with a probability distribution The mean or expected value of is
if is @discrete, and
if is continuous.
The expected value is the "average value" we expect the random variable to take in the long run.
Note that in the discrete case, the expected value is the dot product of the vector of values and corresponding vector of values.
Referenced by (5 direct, 21 transitive)
Direct references:
Transitive (depth 1):
- Cross-Entropy
- Gibbs' Inequality
- Chain rule for joint entropy
- joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- KL Divergence
- note-33
- note-8
- proof-of-joint-entropy-is-less-than-or-equal-to-entropy-of-parts
- proof-of-theorem-18
- proof-of-theorem-29
- remark-14
- theorem-12
- theorem-15
- theorem-18
- Weak Asymptotic Equipartition Property
- theorem-29-intuition
- Noiseless channel transmitting discrete symbols
- Strong Asymptotic Equipartition Property (Shannon--McMillan--Breiman)
Transitive (depth 2):
Variance
Let be a random variable with probability distribution and mean The variance of is
if is @discrete, and
if is continuous.
Referenced by (11 direct, 8 transitive)
Direct references:
The positive square root of the variance, is called the standard deviation of
Referenced by (5 direct, 2 transitive)
Direct references:
Transitive (depth 1):
Variance and standard deviation tell us about how spread out the values of are around its mean.
Let be a random variable with finite expectation , and let be a convex function. Then
If is concave, the inequality reverses:
In either case, equality holds if and only if is @affine on the support of , or is almost surely constant.
We will proceed by induction. Assume is discrete and takes on values with probabilities
Base step, for : Assume takes on two distinct values, and with probabilities Then we want to show that
The last line is just the definition of a convex function, so it's obviously true.
Inductive step: Assume that (a) holds for any points. Take points with weights summing to Let
Assuming let Then, so the form an -point distribution. Now, we'll rewrite to bundle the first terms separately from the last term:
where Now, because (b) is a two-point convex combination of and From our base case,
Now, from our inductive hypothesis we have that
Tying it all together we have
TODO: show the equality case only holds when the support is affine.