<< Chapter < Page Chapter >> Page >

Note . In some applications the counting random variable may take on the idealized value . For example, in a game that is played until some specified result occurs, this may never happen, so that no finite value can be assigned to N . In such a case, it is necessary to decide what value X is to be assigned. For N independent of the Y n (hence of the X n ), we rarely need to consider this possibility.

Independent selection from an iid incremental sequence

We assume throughout , unless specifically stated otherwise, that:

  1. X 0 = Y 0 = 0
  2. { Y k : 1 k } is iid
  3. { N , Y k : 0 k } is an independent class

We utilize repeatedly two important propositions:

  1. E [ h ( D ) | N = n ] = E [ h ( X n ) ] , n 0 .
  2. M D ( s ) = g N [ M Y ( s ) ] . If the Y n are nonnegative integer valued, then so is D and g D ( s ) = g N [ g Y ( s ) ]

DERIVATION

We utilize properties of generating functions, moment generating functions, and conditional expectation.

  1. E [ I { n } ( N ) h ( D ) ] = E [ h ( D ) | N = n ] P ( N = n ) by definition of conditional expectation, given an event. Now, I { n } ( N ) h ( D ) = I { n } ( N ) h ( X n ) and E [ I { n } ( N ) h ( X n ) ] = P ( N = n ) E [ h ( X n ) ] . Hence E [ h ( D ) | N = n ] P ( N = n ) = P ( N = n ) E [ h ( X n ) ] . Division by P ( N = n ) gives the desired result.
  2. By the law of total probability (CE1b), M D ( s ) = E [ e s D ] = E { E [ e s D | N ] } . By proposition 1 and the product rule for moment generating functions,
    E [ e s D | N = n ] = E [ e s X n ] = k = 1 n E [ e s Y k ] = M Y n ( s )
    Hence
    M D ( s ) = n = 0 M Y n ( s ) P ( N = n ) = g N [ M Y ( s ) ]
    A parallel argument holds for g D in the integer-valued case.

Remark . The result on M D and g D may be developed without use of conditional expectation.

M D ( s ) = E [ e s D ] = k = 0 E [ I { N = n } e s X n ] = k = 0 P ( N = n ) E [ e s X n ]
= k = 0 P ( N = n ) M Y n ( s ) = g N [ M Y ( s ) ]

A service shop

Suppose the number N of jobs brought to a service shop in a day is Poisson (8). One fourth of these are items under warranty for which no charge is made. Others fall inone of two categories. One half of the arriving jobs are charged for one hour of shop time; the remaining one fourth are charged for two hours of shop time. Thus, theindividual shop hour charges Y k have the common distribution

Y = [ 0 1 2 ] with probabilities P Y = [ 1 / 4 1 / 2 1 / 4 ]

Make the basic assumptions of our model. Determine P ( D 4 ) .

SOLUTION

g N ( s ) = e 8 ( s - 1 ) g Y ( s ) = 1 4 ( 1 + 2 s + s 2 )

According to the formula developed above,

g D ( s ) = g N [ g Y ( s ) ] = exp ( ( 8 / 4 ) ( 1 + 2 s + s 2 ) - 8 ) = e 4 s e 2 s 2 e - 6

Expand the exponentials in power series about the origin, multiply out to get enough terms. The result of straightforward but somewhat tedious calculations is

g D ( s ) = e - 6 ( 1 + 4 s + 10 s 2 + 56 3 s 3 + 86 3 s 4 + )

Taking the coefficients of the generating function, we get

P ( D 4 ) e - 6 ( 1 + 4 + 10 + 56 3 + 86 3 ) = e - 6 187 3 0 . 1545
Got questions? Get instant answers now!

A result on bernoulli trials

Suppose the counting random variable N binomial ( n , p ) and Y i = I E i , with P ( E i ) = p 0 . Then

g N = ( q + p s ) n and g Y ( s ) = q 0 + p 0 s

By the basic result on random selection, we have

g D ( s ) = g N [ g Y ( s ) ] = [ q + p ( q 0 + p 0 s ) ] n = [ ( 1 - p p 0 ) + p p 0 s ] n

so that D binomial ( n , p p 0 ) .

Got questions? Get instant answers now!

In the next section we establish useful m-procedures for determining the generating function g D and the moment generating function M D for the compound demand for simple random variables, hence for determining the complete distribution. Obviously, these will not workfor all problems. It may helpful, if not entirely sufficient, in such cases to be able to determine the mean value E [ D ] and variance Var [ D ] . To this end, we establish the following expressions for the mean and variance.

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