Markov's inequality

Ever wondered how math can predict unlikely events?

Imagine you're playing a game where you roll a die. You're curious about the chances of rolling a number greater than 6, even though a die only has numbers 1 through 6.

Chebyshev's inequality helps us understand that even though it's impossible to roll a 7 on a standard die, there's still a tiny chance that something unusual happens, like rolling a 6 repeatedly.

Example

Let's say you've rolled a 6 ten times in a row. Chebyshev's inequality would show that this is highly unlikely, but not impossible.

Remember this

Chebyshev's inequality tells us that extremely unlikely events can still occur, even if they're not guaranteed.

Text adapted from Wikipedia, licensed under CC BY-SA 4.0.

Related concepts

Hoeffding's inequality

Hoeffding's inequality bounds tail probability for sums of bounded random variables

Chebyshev's inequality says: P(|X-μ| ≥ kσ) ≤ 1/k²

Ever wonder how likely it is to deviate from the average?

Hidden Markov model

Ever wondered how you can predict outcomes without seeing all the details?

Rényi entropy

How do we measure the unpredictability of an event?

Exponential distribution

Why do we sometimes need to predict rare events?

Chebyshev's inequality

Chebyshev's inequality limits the probability of deviation from the mean

Swipe through more Machine Learning concepts

Open Pocket Polymath