lecture notes 3

7/21/2019 Lecture Notes 3

http://slidepdf.com/reader/full/lecture-notes-3-56d94fe582372 1/53

Chapter 4: Probability Distributions

4.1 Random Variables

A random variable is a function X that assigns a numerical value x to each possible

outcome in the sample space

An event can be associated with a single value of the random variable, or it can be

associated with a range of values of the random variable.

The probability of an event can then be described as:

( ) or ( ≤ ≤ )

There could also be other topology for the random variable to describe the event.If , 1 , 2 , ⋯ , are all the possible values of random variable associated with

the sample space, then

( )

=

1



probabilities

0.03

0.06

0.07

0.02

0.01

0.010.09

0.16

0.01…

e.g. Each (composite) outcome consists of 3 ratings

(M,P,C). Let , and be preferred ratings. Let

X be the function that assigns to each outcome the

number of preferred ratings each outcome

possesses.Since each outcome has a probability, we

can compute the probability of getting each

value x = 0,1,2,3 of the function X

x

3

2

2

2

1

12

1

1…

x | P( X = x )

3 | 0.03

2 | 0.29

1 | 0.50

0 | 0.18



Random variables X can be classified by the number of values x they can assume.

The two common types are

discrete random variables with a finite or countably infinite number of valuescontinuous random variables having a continuum of values for x

1. A value of a random variable may correspond to several random events.

2. An event may correspond to a range of values (or ranges of values) of a

random variable.

3. But a given value (in its legal range) of a random variable corresponds to a

random event.

4. Different random values of the random variable correspond to mutually

exclusive random events.

5. Each value of a random variable has a corresponding probability.

6. All possible values of a random variable correspond to the entire samplespace.

7. The summation of probabilities corresponding to all values of a random

variable must equal to unity.



A fundamental problem is to find the probability of occurrence for each possible value x

of the random variable X .

() ucms ssignd vu

This is the problem of identifying the probability distribution for a random variable.

The probability distribution of a discrete random variable X can be listed as a table of thepossible values x together with the probability P( X = x ) for each

e.g. | ( )

| ( )

| ( )

…

It is standard notation to refer to the values P( X = x ) of the probability distribution by f ( x ) f ( x ) ≡ P( X = x )

The probability distribution always satisfies the conditions

≥ 0 and 1



e.g. − for x = 1,2,3,4

e.g.

for x = 0,1,2,3,4

Since the probability distribution for a discrete random variable is a tabular list, it can

also be represented as a histogram, the probability histogram.

For a discrete random variable, the height for the bin value x is f ( x ), the width of the

bin is meaningless. For a discrete random variable, the probability histogram is

commonly drawn either with touching bins (left) or in Pareto style (right - also referredto as a bar chart).

f ( x ) for number preferred ratings



Of course one can also compute the cumulative distribution function (or cumulative

probability function)

≤ for all ∞ ≤ ≤ ∞

and plot it in the ways learned in chapter 2 (with consideration that the x-axis is not

continuous but discrete).

We now start to discuss the probability distributions for many

discrete random variables that occur in nature

F ( x ) for number preferred ratings



4.2 Binomial Distribution

Bernoulli distribution:

In probability theory and statistics, the Bernoulli distribution, named after Swiss scientist

Jacob Bernoulli, is a discrete probability distribution, which takes value 1 with successprobability and value 0 with failure probability 1 . So if X is a random variable

with this distribution, we have:

1 ; 0 1 .

Mean and variance of a random variable :(1) Mean (mathematical expectation, expectation, average, etc):

( )

(2) Variance:

( )

is called the standard deviation.

For random variable with Bernoulli distribution, we have

1 + + +



Binomial Distribution:

We can refer to the ordered sequence of length n as a series of n repeated trials, where

each trial produces a result that is either “success” or “failure”. We are interested in therandom variable that reports the number x successes in n trials.

Each trial is a Bernoulli trial which satisfies

a) there are only two outcomes for each trial

b) the probability of success is the same for each trial

c) the outcomes for different trials are independent

We are talking about the events in the sample space S where

= s _ _ _ _ …. _; = _ s _ _ _ …. _; = _ _ s _ _ …. _; … ; = _ _ _ _ _ …. s;

where by b) P( ) = P( ) = … = P( )and by c) P( ∩ ) = P( ) · P( ) for all distinct pairs i , j



e.g. police roadblock checking for drivers who are wearing seatbelts

condition a): two outcomes: “y” or “n” conditions b) &c): if the events to contain all cars stopped, then b) and c) will be

satisfied

If however, event is broken into two (mutually exclusive sub-events),

< which is all events s _ _ _ … _ and driver 1 is less than 21

and > which is all events s _ _ _ … _ and driver 1 is 21 or olderit is entirely likely that P( <) ≠ P( >), and we would not be dealing with Bernoulli

trials.

If the someone caught not wearing a seatbelt began to warn oncoming cars approaching

the roadblock, then P(

∩ ) ≠ P(

) · P(

) for all i , j pairs and we would also not be

dealing with Bernoulli trials.

Note that in our definition of Bernoulli trials the number of trials n is fixed in advance



All Bernoulli trials of length n have the same probability distribution!!!!

(a consequence of the assumptions behind the definition of Bernoulli trials)

This probability distribution is called the Binomial probability distribution for n.

(it is called this because each trial has a binomial outcome “s” or “f” and the sequencesgenerated (the composite outcomes) are binomial sequences.)



Probability Distribution

x 0 1 2 3

f ( x ) 1/8 3/8 3/8 1/8

30 ½ 1 ½ 3

1 ½ 1 ½ 32 ½ 1 ½ 3

3 ½ 1 ½

e.g. Binomial probability distribution for n = 3.

Sample space has 23 = 8 outcomes

sss ssf sff fff

sfs fsffss ffs

RV values 3 2 1 0

P(sss) = 1/8 = ½ · ½ · ½; P(ssf) = 1/8 = ½ · ½ · (1−½); P(fsf) = 1/8 = (1−½) · ½ · (1−½);

etc.



From this example, we see that the binomial probability distribution, which governs

Bernoulli trials of length n is:

() ≡ ; , 1 − (BPD)

where p is the (common) probability of success in any trial, and x = 0, 1, 2, …., n

Note: 1. The term on the RHS of (BPD) is the x ’th term of the binomial expansion of

+ ( 1 )

i.e. + ( 1 )

( 1 )−=

which also proves that

( 1 )−

= 1 1

2. (BPD) is a 2-parameter family of distribution functions characterized by choice

of n and p.



e.g. In 60% of all solar-heat installations, the utility bill is reduced by at least 1/3.

What is the probability that the utility bill will be reduced by at least 1/3 in

a) 4 of 5 installations?

b) at least 4 of 5 installation?

a) “s” = “at least 1/3” (i.e. 1/3 or greater) “f” = “less than 1/3”

P(Ai) = p = 0.6

Assume c) of Bernoulli trial assumptions holds.

Then f (4) = b(4; 5, 0.6) =54 0.6 0.4

b) We want f (4) + f (5) = b(4; 5, 0.6) + b(5; 5, 0.6) =5

4 0.6 0.4 +

5

5 0.6 0.4



Examples of binomial distribution



Cumulative binomial probability distribution

; , ≡ ; ,

= ()

is the probability of x or fewer successes in n Bernoulli trials, were p is the probability of

success on each trial.

From (CBPD) we see

; , ; , ( ; , )

Values of ; , are tabulated for various n and p values in Table 1 of Appendix B



Cumulative binomial distribution

cumulative probability



e.g. probability is 0.05 for flange failure

under a given load L. What is the probability

that, among 16 columns,

a) at most 2 will failb) at least 4 will fail

a) 2; 16, 0.05 0; 16, 0.05 + 1; 16, 0.05 + (2; 16, 0.05)

b) 1.0 − 3; 16, 0.05



e.g. Claim: probability of repair for a hard drive within 12 months is 0.10

Preliminary data show 5 of 20 hard drives required repair in first 12 months of

manufacture

Does initial production run support the claim?

“s” = repair within 12 months. p = 0.10. Assume Bernoulli trials.

1.0 − B(4; 20, 0.10) = 0.0432 is the probability of seeing 5 or more hard drives requiring

repair in 12 months.

This says that in only 4% of all year-long periods (i.e. in roughly 1 year out of 25) should

one see 5 or more hard drives needing repair. The fact that we saw this happen in the

very first year makes us suspicious of the manufacturers claim (but does NOT prove

that manufacturers claim is wrong !!!!!!!)



Shape of binomial probability histograms

e.g. b( x ; 5, p)

positively skewed symmetric negatively skewed

b( x ; n, 0.5) will always be symmetric:

b(x; n, p) will always be positively skewed for p < 0.5 (Tail on positive side)

will always be negatively skewed for p > 0.5 (Tail on negative side)

(;,0.5)(;,0.5)



4.3 Hypergeometric probability distribution

In Bernoulli trials, one can get “s” with probability p and “f” with probability 1− p in every

trial (i.e. Bernoulli trials can be thought of as “sample with replacement”)

Consider a variation of the problem, in which there are total of only a outcomes availablethat are successes (have RV values = “s”) and N − a outcomes that are failures. (e.g. there

are N radios, a of them are defective and N − a of them work.)

We want to run n trials, (e.g. in each trial we pick a radio), but outcomes are sampled

without replacement (that is, once a radio is picked, it is no longer available to be picked

again).As we run each trial, we assume that whatever outcomes are left, whether having RV value

“s” or “f”, have the same chance of being selected in the next trial (i.e. we are assuming

classical probability – where the chance of being picking a particular value of a RV is in

proportion to the number of outcomes that have that RV value).

Thus, for x ≤ a, the probability of getting x successes in n trials if there will be a successesin N trials is

the number of n-arrangements (permutations) having x successes and n − x failures

the number n arrangements (permutations) of N things



That is _ _ _ _ _ _ _ _ _ _ _ _ _ _ . . . _

trial 1 2 3 4 5 . . . n

pick x of the trials: ways

pick x of the a outcomes and arrange them in

all possible ways in those x trials: ways

pick n−x of the N─a outcomes and arrange them

in all possible ways in the remaining n−x trials: −− ways

total possible n outcomes

Therefore

()



i.e.

!

! !!

! !

!

! !

!

! ! !

! !!

! !

,

This defines the hypergeometric probability distribution

ℎ ; , ,

, 0, 1,2, … , ; ≤



e.g. PC has 20 identical car chargers, 5 are defective. PC will randomly ship 10. What is

the probability that 2 of those shipped will be defective?

ℎ 2; 10,5,20

5

2

15

82010

5!

3!2!

15!

7!8!20!10!10! 5!15!10!10!3!2!7!8!20! 5!3!2! 15!20! 10!7! 10!8!

5 42

120 19 18 17 16

10 9 8 10 9 5 42

1020

918

816

10 19

917 5 4

212

12

12

10 19

917

52 5 19 917 0.348

e.g. redo using 100 car chargers and 25 defective

ℎ 2; 10,25,100

252

758

10010 0.292

e.g. approximate this using the binomial distribution

b 2; 10, ≈ 25/100 102 0.25 0.75 0.282



The hypergeometric distribution ℎ ; , , approaches the binomial distribution

(;, ) in the limit → ∞

i.e. the binomial distribution can be used to approximate the hypergeometricdistribution when ≤



4.4 Mean and Variance of a Probability Distribution

Consider the values , , ⋯ ,

As discussed in Chapter 2, the sample mean is

= ∙ 1

=

We can view each term in the RHS as ∙() where is the probability

associated with each value (each value appears once in the list, and each is equally likely)

Let X be a discrete random variable having values , , ⋯ , , with probabilities f ().The mean value of the RV , aka. the mean value of the probability distribution, is

μ ∙ ( )



e.g. Mean value for the probability distribution of the number of heads obtained in 3

flips of a coin.

There are 23 = 8 outcomes. The RV “number of heads in 3 flips” has 4 possible values, 0

1, 2, and 3 heads having probabilities f (0) = 1/8; f (1) = 3/8; f (2) = 3/8; f (3) = 1/8.

Therefore the mean value is

μ 0 ∙ 18 + 1 ∙ 3

8 + 2 ∙ 38 + 3 ∙ 1

8 32

The mean value for the Binomial distribution

∙ ; , ∙ ( 1 )−

=

=

∙ ! ! ! ( 1 )−

= 1 !

! ! − (1 )−

=

1 ! ! 1(1)! − (1 )−

=

Let y = x ─ 1 and m = n ─ 1

! ! ! (1 )−

= [ 1 ] 1

The mean value f or the binomial distribution ; , is



e.g. Since the RV “number of heads in three tosses” is a Bernoulli trial RV with p = 0.5, its

mean value must be n p = 3 ·½ = 3/2 as shown on the previous slide.

The mean value of the hypergeometric distribution (;,,) is given by

∙

(This is “easy” to remember. The formula is similar to the binomial distribution if one

“recognizes” as the hypergeometric probability in the limit of large N.)

e.g. PC has 20 identical car charges, 5 are defective. PC will randomly ship 10. On

average (over many trials of shipping 10), how many defective car chargers will be

included in the order.

We want the mean of ℎ(;10,5,20). The mean value is μ = 10 · 5/20 = 2.5



h i f h bi i l di ib i ( )



The variance for the binomial distribution (;,)

∙ ∙ ∙ (1 )

e.g. The standard deviation for throwing heads in 3 flips of a coin is

3 ∙ 12 ∙ ( 1 12) 34 32 0.866

The variance for the hypergeometric distribution is

e.g. The standard deviation for the number of defective car chargers in shipments of 10 is

10 520 1 520 2 0 1 02 0 1 7576 0.99

→1 as N →∞



The moments of a probability distribution

The k’th moment about the origin (usually just called the k’th moment) of a probability

distribution is defined as

′ ∙()

Note: the mean of a probability distribution is the 1’st moment (about the origin)

The k’th moment about the mean of a probability distribution is defined as

( )∙()

Notes:

the 1’st moment about the mean, 0

the 2’nd moment about the mean is the variance

the 3’rd moment about the mean / is the skewness (describes the symmetry)

the 4’th moment about the mean / is the kurtosis (describes the “peakedness”)



Note:

∙()

( 2+) ()

2 +

′

2

+

Therefore we have the result

′

Since computation of ′ and does not involve squaring differences within the sum,

they can be more straightforward to compute.

e.g. Consider the R.V. which is the number of points obtained on a single roll of a die.

The R.V. has values 1,2,3,4,5,6. What is the variance of the probability distribution behind

this RV?

The probability distribution is f ( x ) = 1/6 for each x.

Therefore the mean is

1 ∙ 16 + 2 ∙ 1

6 + 3 ∙ 16 + 4 ∙ 1

6 + 5 ∙ 16 + 6 ∙ 1

6 6 ∙ 72 ∙ 6 7

2

The second moment about the origin is

′ 1 ∙ 16 + 2 ∙ 1

6 + 3 ∙ 16 + 4 ∙ 1

6 + 5 ∙ 16 + 6 ∙ 1

6 916

Therefore



4.5 Chebyshev’s Theorem

Theorem 4.1

If a probability distribution has mean μ and standard deviation σ ,

then the probability of getting a value that deviates from μ by at least k σ is a most

i.e. the probability P( x ) for getting a result x such that | x ─μ| ≥ k σ satisfies ≤

Chebyshev’s theorem quantifies the statement that the probability of getting a result x

decreases as x moves further away from μ

Theorem 4.1 can be stated as

( | | ≥ ) ≤ 1

Note: k can be any positive number (it does not have to be an integer).

Corollary 4.1 If a probability distribution has mean μ and standard deviation σ ,

then the probability of getting a value that deviates from μ by at most k σ is at least 1─

≤ ≥ 1 1

h b f h d l ’ h d



e.g. The number of customers who visit a car dealer’s showroom on a Saturday morning is

an RV with mean 18 and standard deviation 2.5.

With what probability can we assert there will be more than 8 but fewer than 28

customers.

This problem sets k σ = 10, making k = 4. Thus

18 ≤ 4 · 2.5 ≥ 1 14 15

16

Chebyshev’s theorem holds for all probability distributions, but it works better for some

than for others (gives a “sharper” estimate).

4 6 P i di ib i



4.6 Poisson distribution

Consider the binomial distribution

; , ( 1 )−

Write as λ / where λ is a constant. In the limit → ∞, the → 0 and the

binomial distribution becomes the Poisson probability distribution

; λ λ

−

! for 0, 1, 2, 3, …

As derived, the Poisson distribution describes the probability distribution for an infinite (in

practice very large) number of Bernoulli trials when the probability of success in each trial

is vanishingly small (in practice – very small).



As the Poisson distribution describes probabilities for a sample space in which each

outcome is countably infinite in length, we have to technically modify the third Axiom

(property) that probabilities must obey to include such sample spaces. The third axiom

stated that the probability function is an additive set function. The appropriate

modification is

Axiom 3’ If , , , ⋯ is a countably infinite sequence of mutually exclusive events in S,

then

U ∪ ∪ ⋯ + + + ⋯

Note that the Poisson distribution satisfies

(; λ) 1

Proof:

λ −

!

= − λ

! −

= 1

Taylors series

expansion of

The cumulative Poisson distribution ; λ (; λ) = is tabluated for select

values of x and λ in Appendix B (Table 2)

e g 5% of bound books have defective bindings What is the probability that 2 out of 100



e.g. 5% of bound books have defective bindings. What is the probability that 2 out of 100

books will have defective bindings using (a) the binomial distribution, (b) the Poisson

distribution as an approximation

(a) b(2;100,0.05) =100

2 0.05 0.95 0.081

(b) λ 0 . 0 5 ∙ 1 0 0 5 . f 2; 5 ! 0.084

e.g. There are 3,840 generators. The probability is 1/1,200 that any one will fail in a year.

What is the probability of finding 0, 1, 2, 3, 4, … failures in any given year

λ 3840 /1200 3.2. We want the probabilities f(0; 3.2), f(1; 3.2), f(2; 3.2) etc.

Using the property ; λ ; λ 1; λ we can compute these probabilities

from Table 2 Appendix B

x 0 1 2 3 4 5 6 7 8

; 3.2 0.041 0.130 0.209 0.223 0.178 0.114 0.060 0.028 0.011

Th l f th P i b bilit di t ib ti i



The mean value for the Poisson probability distribution is

The variance for the Poisson probability distribution is

i.e. the standard deviation for the Poisson distribution is

Proof for mean: λ −

!

=λ− λ −

(1)!

=

Let 1

λ − λ

!

= λ − λ

The average λ is usually approximated by running many long (but finite) trials.

e.g. An average of 1.3 gamma rays per millisec is recorded coming from a radioactive

substance. Assuming the RV “number of gamma rays per millisec” has a probability

distribution that is Poisson (aka, is a Poisson process), what is the probability of seeing 1

or more gamma rays in the next millisec

λ = 1.3. Want ≥ 1 1.0 0 1.0 ..! 1 . 0 −. 0.727



4.7 Poisson Processes

Consider a random process (a physical process controlled, wholly or in part, by a chance

mechanism) in time.

To find the probability of the process generating x success over a time interval T , divide T into n equal interval ∆ / . (n is large, ∆ is small)

Assume the following hold:

1. The probability of success during ∆ is ∆

2. The probability of more than one success during ∆ is negligible

3. The probability of success during each time interval

∆ does not depend on what

happened in a prior interval.

These assumptions describe Bernoulli trials, with / ∆ and p = ∆ and the

probability of x successes in n intervals is (; ∆ , ∆).

As → ∞, p →0 (as ∆ →0) and the probability of x successes is governed by the Poisson

probability distribution with

λ

Since λ is the mean (average) number of successes over time T , we see that is the

mean number of successes per unit time.

e.g. A bank receives, on average, 6 bad checks per day. What are the probabilities it will



e.g. A bank receives, on average, 6 bad checks per day. What are the probabilities it will

receive

(a) 4 bad checks on a given day

(b) 10 bad checks over a 2 day period

(a) 6 . λ 6 ∙ 1 Therefore (4; 6)

! 0.134

(b) 6 . λ 6 ∙ 2 1 2

Therefore 10; 12

! 10; 12 9; 12 0.134

e.g. a process generates 0.2 imperfections per minute. Find probabilities of

(a) 1 imperfection in 3 minutes

(b) at least 2 imperfections in 5 minutes

(c) at most 1 imperfection in 15 minutes

(a)

λ 0 . 2 ∙ 3 0 . 6. Want

1; 0.6 1; 0.6 (0; 0.6)

(b) λ 0 . 2 ∙ 5 1 . 0. Want 1.0 1; 1.0

(c) λ 0 . 2 ∙ 1 5 3 . 0. Want 1; 3.0

4.8 Geometric and Negative Binomial Distributions



4.8 Geometric and Negative Binomial Distributions

Consider the sample space of outcomes for countably infinite Bernoulli trials

(i.e. the three Bernoulli assumptions hold)

In particular “s” occurs with probability p and “f” with probability 1- p

We want to know the probability that the first success occurs on the x ’th trial.

Divide the sample space into the following events

s _ _ _ _ _ _ _ _ … f _ _ _ _ _ _ _ _ … ∪

f s _ _ _ _ _ _ _ … f f _ _ _ _ _ _ _ … ∪

f f s _ _ _ _ _ _ …

f f f _ _ _ _ _ _ …

∪

f f f s _ _ _ _ _ … f f f f _ _ _ _ _ … ∪ etc

()

() 1

( 3 ) =

1 −

2

() 1

() 1

( 5 ) =

1 −

4

…



Since the sum of the probabilities of all outcomes must =1, from the diagram we see that

+ + + + ⋯ + 1 + 1 + 1 + ⋯

( 1 )−

= 1

Let the sample space consist of outcomes each of which consists of infinitely countable

Bernoulli trials. Let p be the probability of success in each Bernoulli trial. Then the

geometric probability distribution

; (1 )−, 1, 2, 3, 4, … describes the probability that the first success occurs on the x ’th trial.

e.g. A measuring device has a 5% probability of showing excessive drift during a

measurement. What is the probability that the first time the device exhibits successive drift

occurs on the sixth measurement?

p = 0.05. We want 6; 0.05 0.05(0.95)0.039

Assume you are dealing with Bernoulli trials governed by probability p and you would like



Assume you are dealing with Bernoulli trials governed by probability p and you would like

to know how many trials x you need to make in order to observe r successes. (Clearly

≤ )

To have exactly r successes in x trials, the r’ th success has to occur on trial x, and the

previous 1 successes have to occur in the previous 1 trials.

Therefore the probability that the r ’th success occurs on the x’ th trial must be

f () = (probability of 1 successes in 1 trials) x (probability of “s” on trial x )

= 1; 1, ∙

f () 1 1 −( 1 )−∙ 1 1 ( 1 )−

This is the negative binomial probability distribution

1 1 1 − for , + 1, + 2, …

As , the negative binomial probability distribution can also be written

1 1 −

It can be shown that 1

1− explaining the name “negative” binomial

distribution

R



Recap:

Sample space: outcomes are Bernoulli trials of fixed length n. Probability of “s” is p.

Probability of getting x outcomes in the n trials is given by the binomial distribution

; , , 0,1, 2, 3, … ,

If n is large and p is small, ; , ≈ ; λ where λ and ; λ is the Poisson

distribution

Sample space: outcomes are Bernoulli trials of countably infinite length. Probability of “s” is p.Probability of getting the first success on the x ’th trial is given by the geometric

distribution

; , 1, 2, 3, 4, … .

Probability of getting exactly r successes in x trials is given by 1; 1, ∙ , , + 1, + 2, …

Recap:



Recap:

Sample space: Time recordings of a random process occurring over a continuous time interval

T . The random process produces only “s” or “f”.

Let

denote the average number of “s” produced per unit time. Further assume

1. probability of “s” during small time interval ∆ is α∆

2. probability of more than one ‘s” in ∆ is negligible

3. probability of “s” in a later ∆ is independent of what occurs earlier

Then: Probability of x successes during time interval T is given by the Poisson distribution

; λ where λ

4 9 The Multinomial Distribution



4.9 The Multinomial Distribution

Sample space: sequences of trials of length n

We assume:

1) Each trial has k possible distinct outcomes, type 1, type 2, type 3, …., type k

2) Outcome type i occurs with probability for each trail, where 1=

3) The outcomes for different trials are independent.

(i.e. we assume “multinomial Bernoulli” trials.

In the n trials, we want to know the probability (, , , … , ) that there are

outcomes of type 1

outcomes of type 2

…

outcomes of type k

where =

For fixed values of there are



For fixed values of , , , … , , there are

⋯ ⋯ −

!! ! ! ⋯ !

outcomes that have these k values.

(AMS 301 students will recognize this as (;, , , … , ), the number of ways to

arrange n objects, when there are of type 1, of type 2, … , and of type k )

Each outcome has probability ⋯ . Summing the probabilities for theses

outcomes we have

, , , … , !! ! ! ⋯ ! ⋯

This is the multinomial probability distribution with the conditions that each ≥ 0 and that

=

e g 1 30% of light bulbs will survive less that 40 hours of continuous use



e.g. 1. 30% of light bulbs will survive less that 40 hours of continuous use

2. 50% will survive from 40 to 80 hours of continuous use

3. 20% will survive longer than 80 hours of continuous use

What is the probability that, among 8 light bulbs, 2 will be of type 1, 5 of type 2 and 1 of

type 3?

We want 2,5,1 !! ! ! (0.3)(0.5)(0.2)0.0945

4.10 Generating discrete random variables that obey different probability distributions



Observation: It is relatively simple to generate the random values 0, 1, 2, …, 9 with equal-

likelihood (i.e. each with probability 1/10)

draw the numbers (with replacement) from a hat

flip a balanced, 10-sided diceIt is also relatively straightforward to write a computer program that generates the integers 0,

1, 2, …, 9 with equal-likelihood.

Consequently, it is possible to generate

all 2-digit numbers (outcomes) 00 to 99 with equal-likelihood (1/100)

all 3-digit numbers (outcomes) 000 to 999 with equal-likelihood (1/1000)

etc.

outcomes

Consider the RV “number of heads in 3 tosses of the dice”



Consider the RV number of heads in 3 tosses of the dice

The probability distribution for this RV is

x 0 1 2 3

f ( x ) 1/8=0.125 3/8=0.375 3/8=0.375 1/8=0.125

F ( x ) 0.125 0.500 0.875 1.000

(0)

(1)

(2)

0 1 2 3

i.e. all the outcomes 0 – 124 are assigned the RV 0



all the outcomes 125 – 499 are assigned the RV 1



Thus RV 0 occurs with probability 1/8RV 1 occurs with probability 3/8

RV 2 occurs with probability 3/8

RV 3 occurs with probability 1/8

Thus the sequence of outcomes generated randomly (with equal-likelihood)

197, 365, 157, 520, 946, 951, 948, 568, 586, 089

are interpreted as the random values (number of heads)

1, 1, 1, 2, 3, 3, 3, 2, 2, 0

Table 7 in Appendix B presents a long list of the integers 0, …, 9 generated with equal -

likelihood. One can use the table to randomly generate lists of 1-digit, 2-digit, 3-digit,

etc. outcomes (by taking non-overlapping combinations and starting in different places)

e.g. RV = number cars arriving at a toll booth per minute



g g p

x 0 1 2 3 4 5 6 7 8 9

f ( x ) 0.082 0.205 0.256 0.214 0.134 0.067 0.028 0.010 0.003 0.001

F ( x ) 0.082 0.287 0.543 0.757 0.891 0.958 0.986 0.996 0.999 1.000

(0)

(1)

(2)

0 1 2 3

(3)

(4)

4 …

Classical probability versus frequentist probability



Recall: classical probability counts outcomes and assumes all outcomes occur with equal

likelihood. Frequentist probability measures the frequency of occurrence of outcomes

from past “experiments”.

So what do two dice really do when thrown at the same time?Classic probability:

distinct (i.e. different colored) dice: There are 36 distinct outcomes, each

appears with equal likelihood, therefore the (unordered) outcome 1,2 has probability 2/36

identical dice: There are 21 distinct outcomes, each appears with equal

likelihood, therefore the (unordered) outcome 1,2 has probability 1/21

Frequentist probability:

distinct dice: The (unordered) outcome 1,2 has measured probability 2/36 in

agreement with classic probability

identical dice: The (unordered) outcome 1,2 has measured probability 2/36 (!!)

in disagreement with classic probability

For identical dice, the classic view of probability for throwing two identical dice assumes

all 21 outcomes occur with equal probability. This is not what occurs in practice. in

practice, each of the (unordered) outcomes i, j where i ≠ j occurs more frequently than the

outcomes i, i.

“Why” is the frequentist approach correct. Clearly the frequency of getting unordered



y q pp y q y g g

outcomes cannot depend on the color of dice being thrown (i.e. the color of the dice cannot

affect frequency of occurrence). Thus two identical dice must generate outcomes with the

same frequency as two differently-colored dice.

Note: That is not to say that the classic probability view is completely wrong.The classic view correctly counts the number of different outcomes in each case (

identical and different dice). However it computes probability incorrectly for the identical

case.

The frequentist view concentrates on assigning probabilities to each outcome. In

the frequentist view, the number of outcomes for two identical dice is still 21, but the

probabilities assigned to i,i and i,j outcomes are different.

lecture notes 3

Documents