Download Discrete Random Variables

University Of Rizal system
Morong, Rizal
Random Variables
A random variable, usually written X, is a variable whose possible values are
numerical outcomes of a random phenomenon. There are two types of random
variables, discrete and continuous.
Discrete Random Variables
A discrete random variable is one which may take on only a countable number
of distinct values such as 0,1,2,3,4,........ Discrete random variables are usually
(but not necessarily) counts. If a random variable can take only a finite number of
distinct values, then it must be discrete. Examples of discrete random variables
include the number of children in a family, the Friday night attendance at a
cinema, the number of patients in a doctor's surgery, the number of defective
light bulbs in a box of ten.
The probability distribution of a discrete random variable is a list of
probabilities associated with each of its possible values. It is also sometimes
called the probability function or the probability mass function.
(Definitions taken from Valerie J. Easton and John H. McColl's Statistics
Glossary v1.1)
Suppose a random variable X may take k
different values, with the probability that X = xi
defined to be P(X = xi) = pi. The probabilities pi
must satisfy the following:
1: 0 < pi < 1 for each i
2: p1 + p2 + ... + pk = 1.
Example
Suppose a variable X can take the values 1, 2, 3, or 4.
The probabilities associated with each outcome are described by the following
table:
Outcome
1
2
3
4
Probability
0.1
0.3
0.4
0.2
The probability that X is equal to 2 or 3 is the sum of the two probabilities: P(X =
2 or X = 3) = P(X = 2) + P(X = 3) = 0.3 + 0.4 = 0.7. Similarly, the probability that X
is greater than 1 is equal to 1 - P(X = 1) = 1 - 0.1 = 0.9, by the complement rule.
This distribution may also be described by the probability histogram shown to
the right:
All random variables (discrete and continuous) have a cumulative distribution
function. It is a function giving the probability
that the random variable X is less than or equal
to x, for every value x. For a discrete random
variable, the cumulative distribution function is
found by summing up the probabilities.
(Definition taken from Valerie J. Easton and
John H. McColl's Statistics Glossary v1.1)
Example
The cumulative distribution function for the above probability distribution is
calculated as follows:
The probability that X is less than or equal to 1 is 0.1,
the probability that X is less than or equal to 2 is 0.1+0.3 = 0.4,
the probability that X is less than or equal to 3 is 0.1+0.3+0.4 = 0.8, and
the probability that X is less than or equal to 4 is 0.1+0.3+0.4+0.2 = 1.
The probability histogram for the cumulative distribution of this random variable is
shown to the right:
Continuous Random Variables
A continuous random variable is one which takes an infinite number of
possible values. Continuous random variables are usually measurements.
Examples include height, weight, the amount of sugar in an orange, the time
required to run a mile.
(Definition taken from Valerie J. Easton and John H. McColl's Statistics Glossary
v1.1)
A continuous random variable is not defined at specific values. Instead, it is
defined over an interval of values, and is represented by the area under a curve
(in advanced mathematics, this is known as an integral). The probability of
observing any single value is equal to 0, since the number of values which may
be assumed by the random variable is infinite.
Suppose a random variable X may take all values over an interval of real
numbers. Then the probability that X is in the set of outcomes A, P(A), is defined
to be the area above A and under a curve. The curve, which represents a
function p(x), must satisfy the following:
1: The curve has no negative values (p(x) > 0 for all x)
2: The total area under the curve is equal to 1.
A curve meeting these requirements is known as a density curve.
The Uniform Distribution
A random number generator acting over an interval of numbers (a,b) has a
continuous distribution. Since any interval of numbers of equal width has an
equal probability of being observed, the curve describing the distribution is a
rectangle, with constant height across the interval and 0 height elsewhere. Since
the area under the curve must be equal to 1, the length of the interval determines
the height of the curve.
The following graphs plot the density curves for random number generators over
the intervals (4,5) (top left), (2,6) (top right), (5,5.5) (lower left), and (3,5) (lower
right). The distributions corresponding to these curves are known as uniform
distributions.
Consider the uniform random variable X defined on the interval (2,6). Since the
interval has width = 4, the curve has height = 0.25 over the interval and 0
elsewhere. The probability that X is less than or equal to 5 is the area between 2
and 5, or (5-2)*0.25 = 0.75. The probability that X is greater than 3 but less than
4 is the area between 3 and 4, (4-3)*0.25 = 0.25. To find that probability that X is
less than 3 or greater than 5, add the two probabilities:
P(X < 3 and X > 5) = P(X < 3) + P(X > 5) = (3-2)*0.25 + (6-5)*0.25 = 0.25 + 0.25
= 0.5.
The uniform distribution is often used to simulate data. Suppose you would like to
simulate data for 10 rolls of a regular 6-sided die. Using the MINITAB "RAND"
command with the "UNIF" subcommand generates 10 numbers in the interval
(0,6):
MTB > RAND 10 c2;
SUBC> unif 0 6.
Assign the discrete random variable X to the values 1, 2, 3, 4, 5, or 6 as follows:
if 0<X<1, X=1
if 1<X<2, X=2
if 2<X<3, X=3
if 3<X<4, X=4
if 4<X<5, X=5
if X>5, X=6.
Use the generated MINITAB data to assign X to a value for each roll of the die:
Uniform Data
X Value
4.53786
5
5.77474
6
3.69518
4
1.03929
2
4.23835
5
0.37096
1
0.75272
1
5.56563
6
0.89045
1
3.18086
4
Another type of continuous density curve is the normal distribution. The area
under the curve is not easy to calculate for a normal random variable X with
mean
and standard deviation
. However, tables (and computer functions)
are available for the standard random variable Z, which is computed from X by
subtracting
and dividing by
. All of the rules of probability apply to the
normal distribution.
In mathematics, random variables are used in the study of probability. They
were developed to assist in the analysis of games of chance, stochastic events,
and the results of scientific experiments by capturing only the mathematical
properties necessary to answer probabilistic questions. Further formalizations
have firmly grounded the entity in the theoretical domains of mathematics by
making use of measure theory.
The language and structure of random variables can be grasped at various levels
of mathematical fluency. Beyond an introductory level, set theory and calculus
are fundamental. The concept of a random variable is closely linked to the term
"random variate": a random variate is a particular outcome of a random variable.
There are two types of random variables: discrete and continuous. A discrete
random variable maps events to values of a countable set (e.g., the integers),
with each value in the range having probability greater than or equal to zero. A
continuous random variable maps events to values of an uncountable set (e.g.,
the real numbers). Usually in a continuous random variable the probability of any
specific value is zero, although the probability of an infinite set of values (such as
an interval of non-zero length) may be positive. However, sometimes a
continuous random variable can be "mixed", having part of its probability spread
out over an interval like a typical continuous variable, and part of it concentrated
on particular values, like a discrete variable. This categorisation into types is
directly equivalent to the categorisation of probability distributions.
A random variable has an associated probability distribution and frequently also a
probability density function. Probability density functions are commonly used for
continuous variables.
Intuitive description
A random variable can be thought of as an unknown value that may change
every time it is inspected. Thus, a random variable can be thought of as a
function mapping the sample space of a random process to the real numbers. A
few examples will highlight this.] Examples
For a coin toss, the possible events are heads or tails. The number of heads
appearing in one fair coin toss can be described using the following random
variable:
and if the coin is equally likely to land on either side then it has a probability mass
function given by:
A random variable can also be used to describe the process of rolling a fair dice
and the possible outcomes. The most obvious representation is to take the set
{1, 2, 3, 4, 5, 6} as the sample space, defining the random variable X as the
number rolled. In this case ,
An example of a continuous random variable would be one based on a spinner
that can choose a real number from the interval [0, 2π), with all values being
"equally likely". In this case, X = the number spun. Any real number has
probability zero of being selected. But a positive probability can be assigned to
any range of values. For example, the probability of choosing a number in [0, π]
is ½. Instead of speaking of a probability mass function, we say that the
probability density of X is 1/2π. The probability of a subset of [0, 2π) can be
calculated by multiplying the measure of the set by 1/2π. In general, the
probability of a set for a given continuous random variable can be calculated by
integrating the density over the given set.
An example of a random variable of mixed type would be based on an
experiment where a coin is flipped and the spinner is spun only if the result of the
coin toss is heads. If the result is tails, X = −1; otherwise X = the value of the
spinner as in the preceding example. There is a probability of ½ that this random
variable will have the value −1. Other ranges of values would have half the
probability of the last example.
Formal definition
Let
be a probability space and
be a measurable space, called
the observation space. Then a random variable X is formally defined as a
measurable function
. An interpretation of this is that the preimages
of the "well-behaved" subsets of Y (the elements of Σ) are events (elements of
), and hence are assigned a probability by P.
An alternative statement of this is that a random variable is a (total) function
whose domain is the sample space, usually mapping events to real numbers.
Real-valued random variables
Typically, the measurable space is the measurable space over the real numbers.
In this case, let
be a probability space. Then, the function
is a real-valued random variable if
This definition is a special case of the above because
generates the Borel sigma-algebra on the real
numbers, and it is enough to check measurability on a generating set.
(Here we are using the fact that
.)
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
defined on the probability space
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
often written as
which is
for short, and easily obtained since
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
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 dF 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[X], and
also called the first moment. 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[fi(X)] fully characterise the distribution of the random
variable X.
Functions of random variables
If we have a random variable
, then
on
and a Borel measurable function
will also be a random variable on
, since the
composition of measurable functions is also measurable. (However, this is not
true if f is Lebesgue measurable.) The same procedure that allowed one to go
from a probability space
distribution of
to
can be used to obtain the
. The cumulative distribution function of
is
If function f is invertible, i.e. f − 1 exists, then the previous relation can be
extended to obtain
and, again with the same hypotheses of invertibility of f, we can find the relation
between the probability density functions by differentiating both sides with
respect to y, in order to obtain
.
If there is no invertibility but each y admits at most a countable number of roots
(i.e. a finite number of xi such that y = f(xi)) then the previous relation between
the probability density functions can be generalized with
where xi = fi-1(y).
Example 1
Let X be a real-valued, continuous random variable and let Y = X2.
If y < 0, then P(X2 ≤ y) = 0, so
If y ≥ 0, then
so
Example 2
Suppose
where
is a random variable with a cumulative distribution
is a fixed parameter. Consider the random variable
Then,
The last expression can be calculated in terms of the cumulative distribution of X,
so
.
Two random variables X and Y are equal in p-th mean if the pth moment
of |X − Y| is zero, that is,
As in the previous case, there is a related distance between the random
variables, namely
This is equivalent to the following:
Two random variables X and Y are equal almost surely if, and only if, the
probability that they are different is zero:
For all practical purposes in probability theory, this notion of equivalence is as
strong as actual equality. It is associated to the following distance:
where 'sup' in this case represents the essential supremum in the sense of
measure theory.
Finally, the two random variables X and Y are equal if they are equal as
functions on their probability space, that is,
Much of mathematical statistics consists in proving convergence results
for certain sequences of random variables; see for instance the law of large
numbers and the central limit theorem.
There are various senses in which a sequence (Xn) of random variables can
converge to a random variable X. These are explained in the article on
convergence of random variables.
Summary:
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.
Two random variables X and Y are equal in distribution if they have the
same distribution functions:
Two random variables having equal moment generating functions have the same
distribution. This provides, for example, a useful method of checking equality of
certain functions of i.i.d. random variables.
which is the basis of the Kolmogorov–Smirnov test
Konstantin G. Constantino
II-D1