Idea: How far can the mean be off
Concentration inequalities bound large deviations from a little knowledge. The more you know, the stronger the bound.
- Only a mean: Markov
- A variance: Chebyshev
- A range and independence: Hoeffding
Formula: Markov
For a variable that is never negative, the mean alone bounds the upper tail.
Quick check: A drawdown from its mean
A drawdown has mean points. What bound does Markov give on the chance it reaches ?
Show the answer
Answer:
, and it can be reached: all mass at and .
Formula: Chebyshev for a sample mean
Markov applied to the squared gap: the variance bounds both tails, falling as 1/n.
Example: How many days to believe it
Daily results have variance . How many days keep the mean within point with failure chance at most ?
- Chebyshev: the failure chance is at most
- Need no more than
- So ; round up if not whole
Formula: Hoeffding
Independent draws in a range of width w: the tail falls exponentially in n.
Idea: Which bound wins
A hit rate: , variance at most , and .
- : Hoeffding , Chebyshev is better
- : Hoeffding , Chebyshev only
- The exponential bound wins deep in the tail, where risk lives
Quick check: Size the sample
Draws lie in a range of width . How many give a Hoeffding exponent of at ?
Show the answer
Answer:
: .
Common mistake: Hoeffding on the wrong data
Fat-tailed daily returns make a guess, and overlapping windows make overstate the information.
Instead Check independence and a true range first; otherwise the bound looks rigorous and guarantees nothing.
Idea: A bound is not a forecast
A bound is a guarantee and often loose: at a normal model gives about , not .
- Testing strategies multiplies the bound by
- An exponential tail absorbs that; a tail mostly cannot
- Say what you know, solve for n, then check the conditions
Courses / Problem-solving toolkit