Stochastic ordering

From Wikipedia, the free encyclopedia

Please help improve this article or section by expanding it.
Further information might be found on the talk page or at requests for expansion. (January 2008)

In statistics, a stochastic order quantifies the concept of one random variable being "bigger" than another. These are usually partial orders, so that one random variable $A$ may be neither stochastically greater than, less than nor equal to another random variable $B$ . Many different orders exist, which have different applications.

1 Usual stochastic order
- 1.1 Characterizations
2 Other properties
3 Stochastic dominance
4 Multivariate stochastic order
5 Other stochastic orders
6 References
7 See also

[edit] Usual stochastic order

A real random variable $A$ is less than a random variable $B$ in the "usual stochastic order" if

$P(A>x) \le P(B>x)$ for all $x \in (-\infty,\infty)$ ,

where $P (.)$ denotes the probability of an event. This is sometimes denoted $A \preceq B$ or $A \le_{st} B$ . If additionally $P (A > x) < P (B > x)$ for some $x$ , then $A$ is stochastically strictly less than $B$ , sometimes denoted $A \prec B$ .

[edit] Characterizations

The following rules describe cases when one random variable is stochastically less than or equal to another. Strict version of some of these rules also exist.

$A\preceq B$ if and only if for all non-decreasing functions $u$ , $E[u(A)] \le E[u(B)]$ .
If $u$ is non-decreasing and $A\preceq B$ then $u(A) \preceq u(B)$
If $u:\mathbb{R}^n\mapsto\mathbb{R}$ is an increasing function and $A i$ and $B i$ are independent sets of random variables with $A_i \preceq B_i$ for each $i$ , then $u(A_1,\dots,A_n) \preceq u(B_1,\dots,B_n)$ and in particular $\sum_{i=1}^n A_i \preceq \sum_{i=1}^n B_i$ Moreover, the $i$ th order statistics satisfy $A_{(i)} \preceq B_{(i)}$ .
If two sequences of random variables $A i$ and $B i$ , with $A_i \preceq B_i$ for all $i$ each converge in distribution, then their limits satisfy $A \preceq B$ .
If $A$ , $B$ and $C$ are random variables such that $P(A>u|C=c)\le P(B>u|C=c)$ for all $u$ and $c$ , then $A\preceq B$

[edit] Other properties

If $A\preceq B$ and $E [A] = E [B]$ then $A = B$ in distribution.

[edit] Stochastic dominance

Stochastic dominance^[1] is a stochastic ordering used in decision theory. Several "orders" of stochastic dominance are defined.

Zeroth order stochastic dominance consists of simple inequality: $A \preceq_{(0)} B$ if $A \le B$ for all states of nature.
First order stochastic dominance is equivalent to the usual stochastic order above.
Higher order stochastic dominance is defined in terms of integrals of the distribution function.
Lower order stochastic dominance implies higher order stochastic dominance.

[edit] Multivariate stochastic order

[edit] Other stochastic orders

[edit] Hazard rate order

The hazard rate of a non-negative random variable $X$ with absolutely continuous distribution function $F$ and density function $f$ is defined as

$r(t) = \frac{d}{dt}(-\log(1-F(t))) = \frac{f(t)}{F(t)}$ .

Given two non-negative variables $X$ and $Y$ with absolutely continuous distribution $F$ and $G$ , and with hazard rate functions $r$ and $q$ , respectively, $X$ is said to be smaller than $Y$ in the hazard rate order (denoted as $X \le_{hr}Y$ ) if

$r(t)\ge q(t)$ for all $t\ge 0$ ,

or equivalently if

$\frac{1-F(t)}{1-G(t)}$ is decreasing in

t

[edit] Likelihood ratio order

[edit] Mean residual life order

[edit] Variability orders

If two variables have the same mean, they can still be compared by how "spread out" their distributions are. This is captured to a limited extent by the variance, but more fully by a range of stochastic orders.

[edit] Convex order

Under the convex ordering, $A$ is less than $B$ if and only if for all convex $u$ , $E [u (A)] < E [u (B)]$ .

[edit] References

M. Shaked and J. G. Shanthikumar, Stochastic Orders and their Applications, Associated Press, 1994.
E. L. Lehmann. Ordered families of distributions. The Annals of Mathematical Statistics, 26:399-419, 1955.