<< Chapter < Page Chapter >> Page >

Determination of the distribution

Determining the partition generated by a simple random variable amounts to determining the canonical form. The distribution is then completed by determining the probabilities ofeach event A k = { X = t k } .

From a primitive form

Before writing down the general pattern, we consider an illustrative example.

The distribution from a primitive form

Suppose one item is selected at random from a group of ten items. The values (in dollars) and respective probabilities are

c j 2.00 1.50 2.00 2.50 1.50 1.50 1.00 2.50 2.00 1.50
P ( C j ) 0.08 0.11 0.07 0.15 0.10 0.09 0.14 0.08 0.08 0.10

By inspection, we find four distinct values: t 1 = 1 . 00 , t 2 = 1 . 50 , t 3 = 2 . 00 , and t 4 = 2 . 50 . The value 1.00 is taken on for ω C 7 , so that A 1 = C 7 and P ( A 1 ) = P ( C 7 ) = 0 . 14 . Value 1.50 is taken on for ω C 2 , C 5 , C 6 , C 10 so that

A 2 = C 2 C 5 C 6 C 10 and P ( A 2 ) = P ( C 2 ) + P ( C 5 ) + P ( C 6 ) + P ( C 10 ) = 0 . 40

Similarly

P ( A 3 ) = P ( C 1 ) + P ( C 3 ) + P ( C 9 ) = 0 . 23 and P ( A 4 ) = P ( C 4 ) + P ( C 8 ) = 0 . 23

The distribution for X is thus

k 1.00 1.50 2.00 2.50
P ( X = k ) 0.14 0.40 0.23 0.23
Got questions? Get instant answers now!

The general procedure may be formulated as follows:

If X = j = 1 m c j I C j , we identify the set of distinct values in the set { c j : 1 j m } . Suppose these are t 1 < t 2 < < t n . For any possible value t i in the range, identify the index set J i of those j such that c j = t i . Then the terms

J i c j I C j = t i J i I C j = t i I A i , where A i = j J i C j ,

and

P ( A i ) = P ( X = t i ) = j J i P ( C j )

Examination of this procedure shows that there are two phases:

  • Select and sort the distinct values t 1 , t 2 , , t n
  • Add all probabilities associated with each value t i to determine P ( X = t i )

We use the m-function csort which performs these two operations (see Example 4 from "Minterms and MATLAB Calculations").

Use of csort on [link]

>>C = [2.00 1.50 2.00 2.50 1.50 1.50 1.00 2.50 2.00 1.50]; % Matrix of c_j>>pc = [0.08 0.11 0.07 0.15 0.10 0.09 0.14 0.08 0.08 0.10]; % Matrix of P(C_j)>>[X,PX] = csort(C,pc); % The sorting and consolidating operation>>disp([X;PX]') % Display of results1.0000 0.1400 1.5000 0.40002.0000 0.2300 2.5000 0.2300

For a problem this small, use of a tool such as csort is not really needed. But in many problems with large sets of data the m-function csort is very useful.

Got questions? Get instant answers now!

From affine form

Suppose X is in affine form,

X = c 0 + c 1 I E 1 + c 2 I E 2 + + c m I E m = c 0 + j = 1 m c j I E j

We determine a particular primitive form by determining the value of X on each minterm generated by the class { E j : 1 j m } . We do this in a systematic way by utilizing minterm vectors and properties of indicator functions.

  1. X is constant on each minterm generated by the class { E 1 , E 2 , , E m } since, as noted in the treatment of the minterm expansion, each indicator function I E i is constant on each minterm. We determine the value s i of X on each minterm M i . This describes X in a special primitive form
    X = k = 0 2 m - 1 s i I M i , with P ( M i ) = p i , 0 i 2 m - 1
  2. We apply the csort operation to the matrices of values and minterm probabilities to determine the distribution for X .

We illustrate with a simple example. Extension to the general case should be quite evident. First, we do the problem “by hand” in tabular form. Then we use them-procedures to carry out the desired operations.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Applied probability. OpenStax CNX. Aug 31, 2009 Download for free at http://cnx.org/content/col10708/1.6
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Applied probability' conversation and receive update notifications?

Ask