Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Markov's inequality

In probability theory, Markov's inequality gives an upper bound for the probability that a non-negative function of a random variable is greater than or equal to some positive constant. It is named after the Russian mathematician Andrey Markov.

Markov's inequality (and other similar inequalities) relate probabilities to expectations, and provide (frequently) loose but still useful bounds for the distribution function of a random variable.

1 Definition

Markov's inequality states that if X is a random variable and a is some positive constant, then

2 A Generalisation

Markov's inequality is actually just one of a wider class of inequalities relating probabilities and expectations, that are all examples of a single theorem.

2.1 Theorem

Let X be a random variable and a be some positive constant (a > 0). If

then

2.2 Proof

Let A be the set {x: h(x) ≥ a}, and let I_A(x) be the indicator function of A. (That is, I_A(x) = 1 if x ∈ A, and is 0 otherwise.) Then,

The theorem follows by taking the expectation of both sides of this equation, and observing that

2.3 Examples

Markov's inequality is recovered by setting h(x) = |x|.
If h(x) = x², we obtain a version of Chebyshev's inequality.

Inequalities Probability theory

Read more »

<Hide>

Topics: Markov's Inequality, Definition, A Generalisation, Theorem...

Markov chainIn mathematics, a (discrete-time) Markov chain is a discrete-time stochastic process with the Markov property. In such a process, the distant past is irrelevant given knowledge of the recent past. There are also continuous-time Markov chains. A Markov cha	Markov algorithmA Markov algorithm is a string rewriting system that uses grammar-like rules to operate on strings of symbols. Markov algorithms have been shown to have sufficient power to be a general model of computation, and can thus be shown to be equivalent in power	Markov's inequalityIn probability theory, Markov's inequality gives an upper bound for the probability that a non-negative function of a random variable is greater than or equal to some positive constant. It is named after the Russian mathematician Andrey Markov. Markov's i
Markovnikov's ruleIn chemistry, Markovnikov's rule is an observation based on Zaitsev's Rule. It was formulated by the Russian chemist Vladimir Vasilevich Markovnikov. It states that, in chemical reactions found particularly in organic chemistry, when a hydrogen halide rea	Markov propertyIn probability theory, a stochastic process has the Markov property if the conditional probability distribution of future states of the process, given the present state, depends only upon the current state, i. it is conditionally independent of the past s	MarkovThe name Markov can refer to Andrey Markov, mathematician. Georgi Markov, dissident. In probability theory, the Markov property.
Markovian	Markovian Parallax Denigrate	Markov decision process
Markov blanket

Non User