Algebra Of Random Variables

The algebra of random variables in statistics, provides rules for the symbolic manipulation of random variables, while avoiding delving too deeply into the mathematically sophisticated ideas of probability theory. Its symbolism allows the treatment of sums, products, ratios and general functions of random variables, as well as dealing with operations such as finding the probability distributions and the expectations (or expected values), variances and covariances of such combinations.

In principle, the elementary algebra of random variables is equivalent to that of conventional non-random (or deterministic) variables. However, the changes occurring on the probability distribution of a random variable obtained after performing algebraic operations are not straightforward. Therefore, the behavior of the different operators of the probability distribution, such as expected values, variances, covariances, and moments, may be different from that observed for the random variable using symbolic algebra. It is possible to identify some key rules for each of those operators, resulting in different types of algebra for random variables, apart from the elementary symbolic algebra: Expectation algebra, Variance algebra, Covariance algebra, Moment algebra, etc.

Elementary symbolic algebra of random variables

Considering two random variables $X$ and $Y$, the following algebraic operations are possible:

* Addition: $Z=X+Y=Y+X$
* Subtraction: $Z=X-Y=-Y+X$
* Multiplication: $Z=XY=YX$
* Division: $Z=X / Y=X \cdot (1/Y)=(1/Y) \cdot X$
* Exponentiation: $Z=X^Y=e^$

In all cases, the variable $Z$ resulting from each operation is also a random variable. All commutative and associative properties of conventional algebraic operations are also valid for random variables. If any of the random variables is replaced by a deterministic variable or by a constant value, all the previous properties remain valid.

Expectation algebra for random variables

The expected value $E$ of the random variable $Z$ resulting from an algebraic operation between two random variables can be calculated using the following set of rules:

* Addition: E E +YE E E E /math>
* Subtraction: E E -YE E -E E /math>
* Multiplication: E E YE X/math>. Particularly, if $X$and $Y$are independent from each other, then: E YE \cdot E E \cdot E /math>.
* Division: E E /YE \cdot (1/Y)E 1/Y) \cdot X/math>. Particularly, if $X$and $Y$are independent from each other, then: E /YE \cdot E /YE /Y\cdot E /math>.
* Exponentiation: E E ^YE ^/math>

If any of the random variables is replaced by a deterministic variable or by a constant value ($k$), the previous properties remain valid considering that P = k= 1 and, therefore, E k.

If $Z$ is defined as a general non-linear algebraic function $f$ of a random variable $X$, then:

E E (X)\neq f(E

Some examples of this property include:

* E ^2\neq E 2
* E /X\neq 1/E /math>
* E ^X\neq e^
* E ln(X)\neq \ln(E

The exact value of the expectation of the non-linear function will depend on the particular probability distribution of the random variable $X$.

Variance algebra for random variables

The variance $\mathrm$ of the random variable $Z$ resulting from an algebraic operation between random variables can be calculated using the following set of rules:

* Addition: \mathrm \mathrm +Y\mathrm 2\mathrm ,Y\mathrm /math>. Particularly, if $X$and $Y$are independent from each other, then: \mathrm +Y\mathrm \mathrm /math>.
* Subtraction: \mathrm \mathrm -Y\mathrm 2\mathrm ,Y\mathrm /math>. Particularly, if $X$and $Y$are independent from each other, then: \mathrm -Y\mathrm \mathrm /math>. That is, for independent random variables the variance is the same for additions and subtractions: \mathrm +Y\mathrm -Y\mathrm -X\mathrm X-Y/math>
* Multiplication: \mathrm \mathrm Y\mathrm X/math>. Particularly, if $X$and $Y$are independent from each other, then: \mathrm YE ^2cdot E ^2(E cdot E ^2 =\mathrm \cdot \mathrm \mathrm \cdot (E ^2+\mathrm \cdot (E ^2.
* Division: \mathrm \mathrm /Y\mathrm \cdot (1/Y)\mathrm 1/Y) \cdot X/math>. Particularly, if $X$and $Y$are independent from each other, then: \mathrm /YE ^2cdot E /Y^2(E cdot E /Y^2 =\mathrm \cdot \mathrm /Y\mathrm \cdot (E /Y^2+\mathrm /Y\cdot (E ^2.
* Exponentiation: \mathrm \mathrm ^Y\mathrm ^/math>

where \mathrm ,Y\mathrm ,X/math> represents the covariance operator between random variables $X$ and $Y$.

The variance of a random variable can also be expressed directly in terms of the covariance or in terms of the expected value:

\mathrm = \mathrm(X,X) = E ^2- E 2

If any of the random variables is replaced by a deterministic variable or by a constant value ($k$), the previous properties remain valid considering that P = k= 1 and E k, \mathrm 0 and \mathrm ,k0. Special cases are the addition and multiplication of a random variable with a deterministic variable or a constant, where:

* \mathrm +Y\mathrm /math>
* \mathrm Yk^2 \mathrm /math>

If $Z$ is defined as a general non-linear algebraic function $f$ of a random variable $X$, then:

\mathrm \mathrm (X)\neq f(\mathrm

The exact value of the variance of the non-linear function will depend on the particular probability distribution of the random variable $X$.

Covariance algebra for random variables

The covariance ($\mathrm$) between the random variable $Z$ resulting from an algebraic operation and the random variable $X$ can be calculated using the following set of rules:

* Addition: \mathrm ,X\mathrm +Y,X\mathrm \mathrm ,Y/math>. If $X$ and $Y$ are independent from each other, then: \mathrm +Y,X\mathrm /math>.
* Subtraction: \mathrm ,X\mathrm -Y,X\mathrm \mathrm ,Y/math>. If $X$ and $Y$ are independent from each other, then: \mathrm -Y,X\mathrm /math>.
* Multiplication: \mathrm ,X\mathrm Y,XE ^2YE Y /math>. If $X$ and $Y$ are independent from each other, then: \mathrm Y,X\mathrm \cdot E /math>.
*Division (covariance with respect to the numerator): \mathrm ,X\mathrm /Y,XE ^2/YE /Y /math>. If $X$ and $Y$ are independent from each other, then: \mathrm /Y,X\mathrm \cdot E /Y/math>.
*Division (covariance with respect to the denominator): \mathrm ,X\mathrm /X,XE E /X /math>. If $X$ and $Y$ are independent from each other, then: \mathrm /X,XE \cdot (1-E \cdot E /X.
*Exponentiation (covariance with respect to the base): \mathrm ,X\mathrm ^Y,XE ^E ^Y /math>.
*Exponentiation (covariance with respect to the power): \mathrm ,X\mathrm ^X,XE Y^XE ^X /math>.

The covariance of a random variable can also be expressed directly in terms of the expected value:

\mathrm(X,Y) = E Y- E /math>

If any of the random variables is replaced by a deterministic variable or by a constant value ( $k$), the previous properties remain valid considering that E k, \mathrm 0 and \mathrm ,k0.

If $Z$ is defined as a general non-linear algebraic function $f$of a random variable $X$, then:

\mathrm ,X\mathrm (X),XE f(X)E (X) /math>

The exact value of the variance of the non-linear function will depend on the particular probability distribution of the random variable $X$.

Approximations by Taylor series expansions of moments

If the moments of a certain random variable $X$are known (or can be determined by integration if the probability density function is known), then it is possible to approximate the expected value of any general non-linear function $f(X)$as a Taylor series expansion of the moments, as follows:

$f(X)= \displaystyle \sum_^\infty \displaystyle \frac\biggl(\biggr)_(X-\mu)^n$, where \mu=E /math>is the mean value of $X$.

E (X)E\biggl(\textstyle \sum_^\infty \displaystyle \biggl(\biggr)_(X-\mu)^n\biggr)=\displaystyle \sum_^\infty \displaystyle \biggl(\biggr)_E X-\mu)^n\textstyle \sum_^\infty \displaystyle \frac\biggl(\biggr)_\mu_n(X), where \mu_n(X)=E X-\mu)^n/math>is the ''n''-th moment of $X$ about its mean. Note that by their definition, $\mu_0(X)=1$ and $\mu_1(X)=0$. The first order term always vanishes but was kept to obtain a closed form expression.

Then,

E (X)approx \textstyle \sum_^ \displaystyle \biggl(\biggr)_\mu_n(X) , where the Taylor expansion is truncated after the $n_$-th moment.

Particularly for functions of normal random variables, it is possible to obtain a Taylor expansion in terms of the standard normal distribution:

$f(X)= \textstyle \sum_^\infty \displaystyle \biggl(\biggr)_\mu_n(Z)$, where $X\sim N(\mu,\sigma ^2)$is a normal random variable, and $Z\sim N(0,1)$is the standard normal distribution. Thus,

E (X)approx \textstyle \sum_^ \displaystyle \biggl(\biggr)_\mu_n(Z) , where the moments of the standard normal distribution are given by:

$\mu_n(Z)= \begin \prod_^(2i-1), & \textn\text \\ 0, & \textn\text \end$

Similarly for normal random variables, it is also possible to approximate the variance of the non-linear function as a Taylor series expansion as:

Var (X)approx \textstyle \sum_^ \displaystyle \biggl(\biggl(\biggr)_\biggr)^2Var ^n\textstyle \sum_^ \displaystyle \textstyle \sum_ \displaystyle \biggl(\biggr)_\biggl(\biggr)_Cov ^n,Z^m/math>, where

Var ^n \begin \prod_^(2i-1) -\prod_^(2i-1)^2, & \textn\text \\ \prod_^(2i-1), & \textn\text \end, and

Cov ^n,Z^m \begin \prod_^(2i-1) -\prod_^(2i-1)\prod_^(2j-1), & \textn\textm \text \\ \prod_^(2i-1), & \textn\textm\text \\ 0, & \text \end

Algebra of complex random variables

In the algebraic axiomatization of probability theory, the primary concept is not that of probability of an event, but rather that of a random variable. Probability distributions are determined by assigning an expectation to each random variable. The measurable space and the probability measure arise from the random variables and expectations by means of well-known representation theorems of analysis. One of the important features of the algebraic approach is that apparently infinite-dimensional probability distributions are not harder to formalize than finite-dimensional ones.

Random variables are assumed to have the following properties:
# complex constants are possible realizations of a random variable;
# the sum of two random variables is a random variable;
# the product of two random variables is a random variable;
# addition and multiplication of random variables are both commutative; and
# there is a notion of conjugation of random variables, satisfying and for all random variables and coinciding with complex conjugation if is a constant.

This means that random variables form complex commutative *-algebras. If then the random variable is called "real".

An expectation on an algebra of random variables is a normalized, positive linear functional. What this means is that
# where is a constant;
# for all random variables ;
# for all random variables and ; and
# if is a constant.

One may generalize this setup, allowing the algebra to be noncommutative. This leads to other areas of noncommutative probability such as quantum probability, random matrix theory, and free probability.

See also

* Relationships among probability distributions
*Ratio distribution
**Cauchy distribution
**Slash distribution
* Inverse distribution
* Product distribution
* Mellin transform
* Sum of normally distributed random variables
* List of convolutions of probability distributions – the probability measure of the sum of independent random variables is the convolution of their probability measures.
* Law of total expectation
* Law of total variance
* Law of total covariance
* Law of total cumulance
* Taylor expansions for the moments of functions of random variables
*Delta method

References

Further reading

*
*
*

{{DEFAULTSORT:Algebra Of Random Variables