Random Variable Article Index for
Random
Website Links For
Random
 

Information About

Random Variable





Examples

A random variable can be used to describe the process of rolling a fair Die and the possible outcomes { 1, 2, 3, 4, 5, 6 }. The most obvious representation is to take this set as the Sample Space , the Probability Measure to be Uniform Measure , and the function to be the Identity Function .

For a coin toss, a suitable space of possible outcomes is Ω = { H, T } (for heads and tails). An example random variable on this space is
:X(\omega) = \begin{cases}0,& \omega = exttt{H},\1,& \omega = exttt{T}.\end{cases}


REAL-VALUED RANDOM VARIABLES


Typically, the measurable space is the measurable space over the real numbers. In this case, let (\Omega, \mathcal{F}, P) be a Probability Space . Then, the function X: \Omega ightarrow \mathbb{R} is a real-valued random variable if
:\{ \omega : X(\omega) \le r \} \in \mathcal{F} \qquad orall r \in \mathbb{R}


Distribution functions of random variables

Associating a cumulative distribution function (CDF) with a random variable is a generalization of assigning a value to a variable. If the cdf is a (right continuous) Heaviside Step Function then the variable takes on the value at the jump with probability 1. In general, the cdf specifies the probability that the variable takes on particular values.

If a random variable X: \Omega o \mathbb{R} defined on the probability space (\Omega, A, P) is given, we can ask questions like "How likely is it that the value of X is bigger than 2?". This is the same as the probability of the event \{ s \in\Omega : X(s) > 2 \} which is often written as P(X > 2) for short.

Recording all these probabilities of output ranges of a real-valued random variable ''X'' yields the Probability Distribution of ''X''. The probability distribution "forgets" about the particular probability space used to define ''X'' and only records the probabilities of various values of ''X''. Such a probability distribution can always be captured by its Cumulative Distribution Function

:F_X(x) = \operatorname{P}(X \le x)

and sometimes also using a Probability Density Function . In Measure-theoretic terms, we use the random variable ''X'' to "push-forward" the measure ''P'' on Ω to a measure d''F'' on R.
The underlying probability space Ω is a technical device used to guarantee the existence of random variables, and sometimes to construct them. In practice, one often disposes of the space Ω altogether and just puts a measure on R that assigns measure 1 to the whole real line, i.e., one works with probability distributions instead of random variables.


Moments


The probability distribution of a random variable is often characterised by a small number of parameters, which also have a practical interpretation. For example, it is often enough to know what its "average value" is. This is captured by the mathematical concept of Expected Value of a random variable, denoted E In general, E[''f''(''X'') is not equal to ''f''(E[''X'']). Once the "average value" is known, one could then ask how far from this average value the values of ''X'' typically are, a question that is answered by the Variance and Standard Deviation of a random variable.

Mathematically, this is known as the (generalised) Problem Of Moments : for a given class of random variables ''X'', find a collection {''fi''} of functions such that the expectation values E {Link without Title} fully characterize the distribution of the random variable ''X''.


FUNCTIONS OF RANDOM VARIABLES


If we have a random variable ''X'' on Ω and a of ''Y'' is

:F_Y(y) = \operatorname{P}(f(X) \le y).


Example 1


Let ''X'' be a real-valued, Continuous Random Variable and let ''Y'' = ''X''2. Then,

:F_Y(y) = \operatorname{P}(X^2 \le y).

If ''y'' < 0, then P(''X''2 ≤ ''y'') = 0, so

:F_Y(y) = 0\qquad\hbox{if}\quad y < 0.

If ''y'' ≥ 0, then



where \scriptstyle heta > 0 is a fixed parameter. Consider the random variable \scriptstyle Y = \mathrm{log}(1 + e^{-X}). Then,

: F_{Y}(y) = P(Y \leq y) = P(\mathrm{log}(1 + e^{-X}) \leq y) = P(X > -\mathrm{log}(e^{y} - 1)).\,

The last expression can be calculated in terms of the cumulative distribution of X, so

: F_{Y}(y) = 1 - F_{X}(-\mathrm{log}(e^{y} - 1)) \,
::: = 1 - rac{1}{(1 + e^{\mathrm{log}(e^{y} - 1)})^{ heta}}
::: = 1 - rac{1}{(1 + e^{y} - 1)^{ heta}}
::: = 1 - e^{-y heta}.\,


EQUIVALENCE OF RANDOM VARIABLES


There are several different senses in which random variables can be considered to be equivalent. Two random variables can be equal, equal almost surely, equal in mean, or equal in distribution.

In increasing order of strength, the precise definition of these notions of equivalence is given below.


Equality in distribution


Two random variables ''X'' and ''Y'' are ''equal in distribution'' if
they have the same distribution functions:
:\operatorname{P}(X \le x) = \operatorname{P}(Y \le x)\quad\hbox{for all}\quad x.

Two random variables having equal Moment Generating Function s have the same distribution. This provides, for example, a useful method of checking equality of certain functions of Iidrv's .

To be equal in distribution, random variables need not be defined on the same probability space.
The notion of equivalence in distribution is associated to the following notion of distance between probability distributions,

  :<math>\operatorname{E}(X-Y^p) 0</math>
  :<math>d P(X, Y) \operatorname{E}(X-Y^p)</math>
  :<math>d \infty(X,Y) \sup_\omegaX(\omega)-Y(\omega),</math>