The Poisson Distribution

Similar documents
BHW #13 1/ Cooper. ENGR 323 Probabilistic Analysis Beautiful Homework # 13

( ) = p and P( i = b) = q.

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

6.3 Testing Series With Positive Terms

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

Discrete probability distributions

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Topic 9: Sampling Distributions of Estimators

Census. Mean. µ = x 1 + x x n n

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

Topic 9: Sampling Distributions of Estimators

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

independence of the random sample measurements, we have U = Z i ~ χ 2 (n) with σ / n 1. Now let W = σ 2. We then have σ 2 (x i µ + µ x ) 2 i =1 ( )

Ma 530 Introduction to Power Series

Lecture 2: Monte Carlo Simulation

CHAPTER 10 INFINITE SEQUENCES AND SERIES

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Economics 250 Assignment 1 Suggested Answers. 1. We have the following data set on the lengths (in minutes) of a sample of long-distance phone calls

Module 1 Fundamentals in statistics

Application to Random Graphs

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

Statisticians use the word population to refer the total number of (potential) observations under consideration

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

Exercise 4.3 Use the Continuity Theorem to prove the Cramér-Wold Theorem, Theorem. (1) φ a X(1).

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Median and IQR The median is the value which divides the ordered data values in half.

BIOS 4110: Introduction to Biostatistics. Breheny. Lab #9

Topic 9: Sampling Distributions of Estimators

Chapter 2 The Monte Carlo Method

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

Closed book and notes. No calculators. 60 minutes, but essentially unlimited time.

Generalized Semi- Markov Processes (GSMP)

7.1 Convergence of sequences of random variables

Math 10A final exam, December 16, 2016

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

Linear Regression Demystified

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Axioms of Measure Theory

Statistics 511 Additional Materials

April 18, 2017 CONFIDENCE INTERVALS AND HYPOTHESIS TESTING, UNDERGRADUATE MATH 526 STYLE

Introducing Sample Proportions

Data Description. Measure of Central Tendency. Data Description. Chapter x i

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

KLMED8004 Medical statistics. Part I, autumn Estimation. We have previously learned: Population and sample. New questions

1 Inferential Methods for Correlation and Regression Analysis

Lecture 4 The Simple Random Walk

STAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6)

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

Introduction to Probability and Statistics Twelfth Edition

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes.

CHAPTER 2. Mean This is the usual arithmetic mean or average and is equal to the sum of the measurements divided by number of measurements.

PRACTICE PROBLEMS FOR THE FINAL

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

MATH 10550, EXAM 3 SOLUTIONS

Lesson 10: Limits and Continuity

Lecture 5: Parametric Hypothesis Testing: Comparing Means. GENOME 560, Spring 2016 Doug Fowler, GS

MATH/STAT 352: Lecture 15

Discrete Random Variables and Probability Distributions. Random Variables. Discrete Models

Analysis of Experimental Measurements

(7 One- and Two-Sample Estimation Problem )

multiplies all measures of center and the standard deviation and range by k, while the variance is multiplied by k 2.

ANALYSIS OF EXPERIMENTAL ERRORS

6. Uniform distribution mod 1

Number of fatalities X Sunday 4 Monday 6 Tuesday 2 Wednesday 0 Thursday 3 Friday 5 Saturday 8 Total 28. Day

Stat 139 Homework 7 Solutions, Fall 2015

The Boolean Ring of Intervals

How to Maximize a Function without Really Trying

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

MA131 - Analysis 1. Workbook 9 Series III


Areas and Distances. We can easily find areas of certain geometric figures using well-known formulas:

Stat 421-SP2012 Interval Estimation Section

Random Variables, Sampling and Estimation

Element sampling: Part 2

Quick Review of Probability

Quick Review of Probability

CS / MCS 401 Homework 3 grader solutions

7.1 Convergence of sequences of random variables

1 Approximating Integrals using Taylor Polynomials

Math 525: Lecture 5. January 18, 2018

M06/5/MATHL/HP2/ENG/TZ0/XX MATHEMATICS HIGHER LEVEL PAPER 2. Thursday 4 May 2006 (morning) 2 hours INSTRUCTIONS TO CANDIDATES

Introducing Sample Proportions

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

SNAP Centre Workshop. Basic Algebraic Manipulation

TEACHER CERTIFICATION STUDY GUIDE

AAEC/ECON 5126 FINAL EXAM: SOLUTIONS

Output Analysis and Run-Length Control

Chapter 8: Estimating with Confidence

Kinetics of Complex Reactions

Computing Confidence Intervals for Sample Data

Lecture 19: Convergence

Linear Programming and the Simplex Method

Binomial Distribution

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Transcription:

MATH 382 The Poisso Distributio Dr. Neal, WKU Oe of the importat distributios i probabilistic modelig is the Poisso Process X t that couts the umber of occurreces over a period of t uits of time. This process is based upo a Poisso distributio X ~ Poi( λ) that couts the umber of occurreces durig a fixed period of time, where λ > 0 is the average umber of occurreces per uit time. Geeral Assumptios Whe ca we assume that measuremets follow a Poisso distributio? Basically, the followig geeral coditios must be reasoably satisfied: (i) The average umber of occurreces λ per uit time should be costat ad should remai proportioal to the legth of all time itervals of legth t so that λ t is the average umber of occurreces through t uits of time. (ii) Occurreces should happe idepedetly. (iii) Durig ay small icremet of time, there are a large umber of potetial sample poits that may give rise to a occurrece, but the probability of a actual occurrece from ay of these poits is very small. Uder these coditios, the we ca approximate the probability of exactly k occurreces by i uit time by P(X = k ) e λ for, 1, 2, 3,... ad probability of exactly k occurreces i time t is give by P(X t = k ) = k e λ t for, 1, 2, 3,... Usig the fact that rage of X t equals 1: x k = e x, we ca verify the sum of the probabilities over the (λ t ) k e λ t = e λ t k = e λ t e λ t = 1. There is o closed-form formula for the cumulative probability P(X k) or for computig probabilities such as P( j X k). I each case, the idividual probabilities must be summed, or we must use a calculator/computer commad: k k λ i e P(X k) = P( X = i ) = λ ad P( j X k) = i = 0 i = 0 i! k λ i e λ. i! i = j

Techically, the pdf formula for X arises from the limit of the b(, p) pdf as the umber of attempts icreases to, while the probability of occurrece p decreases to 0, but while the average umber of occurreces λ = p remais costat: P( X = k ) = lim P(b(, p) = k) = lim p 0 p=λ = lim! λ ( k )! lim lim e λ k p 0 p=λ p k k (1 p) k k ( 1)... ( k +1) k 1... k + 1 ( 1 1... 1) 1 e λ. k lim k lim Mea, Variace, ad Stadard Deviatio For X ~ Poi( λ ), it is specified i advace that the average value is λ. But we shall verify this result usig the defiitio of expected value ad also show that its stadard deviatio is λ. To do so, we shall work with the geeral process X t ~ Poi( λ t ) ad simply let t = 1 to get the result for X ~ Poi( λ). The derivatio is as follows: E[ X t ] = k P( X t = k ) = k k e λ t = k k e λ t k Rage X t = e λ t k = e λ t k +1 (re - idex ) (k 1)! = e λ t = λ t. k = e λ t (λ t )e λ t (first term cacels ) To fid the variace of X t, we first fid the average square of A t by

2 E[ X t ] = k 2 k e λ t = k 2 k e λ t (first term cacels ) = k (λ t )k e λ t = (k + 1) k +1 e λ t (re - idex ) (k 1)! = k k e λ t + (λ t ) (λ t ) k e λ t = E[ X t ] + (λ t ) P( X t = k ) = (λ t ) + (λ t )(1) =(λ t ) 2 + λ t. Dr. Neal, WKU So Var( X t ) = E[ X t 2 ] (E[ Xt ]) 2 = (λ t ) 2 + λ t (λ t ) 2 = λ t, ad its stadard deviatio is σ ( X t ) = σ X = λ. λ t. Lettig t = 1 uit of time, we have E[ X ] = λ for X ~ Poi(λ ) with Mode The mode of X t ~ Poi( λ t ) is the most likely umber of occurreces i time t. This value is always give by the largest iteger k such that k λ t, deoted by k = λ t. However, whe λ t is actually a iteger, the the Poi( λ t ) will be bi-modal. I this case, this value of k = λ t ad the previous iteger k 1 will be the two modes. To derive this expressio for the mode, we let a k = P( X t = k ) = (λ t )k e λ t. We the wish to fid the largest iteger k such that a k 1 a k. (We the have a k > a k +1 > a k+2 >...> a makig k have the highest probability value a k.) We ow cosider the ratio a k / a k 1. To have a k 1 a k, we must have 1 a k / a k 1, which holds if ad oly if 1 a k a k 1 = k e λ t k 1 e λ t (k 1)! = λ t k. This result holds if ad oly if k λ t. Note that we have a k 1 = a k if ad oly if k = λ t, which ca hold if ad oly if λ t is a iteger. Example. Durig eveig hours, a website averages 2.4 ew hits every 30 secods. Let X cout the umber of ew hits i oe miute durig eveig hours. Let X t cout the umber of ew hits i t miutes durig eveig hours.

(a) Explai why the coditios of a Poisso distributio are satisfied. (b) For a give miute, compute the probability of there beig (i) exactly 5 ew hits (ii) at least 4 ew hits (iii) from 3 to 5 ew hits (c) What is the most likely umber of ew hits durig a give miute? (d) What is the probability of o ew hits i t miutes time? (e) Derive the maximum amout of time durig which the probability of o ew hits is at least 0.90. Solutio. (a) We may assume that hits to the website geerally occur idepedetly of each other from differet people all over cyberspace who have o coectio to each other. Durig ay istat of time, there are umerous people olie who may potetially visit the page, but the actual probability of doig so is very small. The average umber of hits is kow ad is assumed to stay costat durig eveig hours. Now we ca say that, o average, there are λ = 2 2.4 = 4.8 hits every miute. Thus, X ~ Poi(4.8) ad X t ~ Poi (4.8t ) so that durig a give miute P(X = k ) = 4.8k e 4.8 for, 1, 2, 3,..., ad P(X t = k ) = (4.8t )k e 4.8t durig t miutes time. (b) Usig the pdf of X, we obtai (i) P(X = 5) = 4.85 e 4.8 5! 0.17474768, (ii) P( X 4) = 1 P(0 X 3) = 1 e 4.8 4.8 0 0! + 4.81 1! = 1 e 4.8 1 + 4.8 + 4.82 2 0.70577 + 4.82 2! + 4.83 6 + 4.83 3! ad (iii) P( 3 X 5) = e 4.8 4.8 3 3! + 4.84 4! + 4.85 5! 0.508467. (c) The most likely umber of ew hits durig a give miute is k = 4.8 = 4 hits. (d) The probability of o ew hits i t miutes time is P(X t = 0) = e 4.8t. (e) We simply solve for t is the iequality P(X t = 0) 0.90. Usig the result form (d), we have e 4.8t 0.90 which gives 4.8 t l(0. 90) ad the t l(0.90) 0.02185 4.8 miutes, or about 1.317 secods.

Calculator Commads Poisso probability values ca be computed with the built-i poissopdf( ad poissocdf( TI commads from the DISTR meu: P( X = k ) = poissopdf(λ,k) P( X k) = poissocdf(λ,k) P( j X k ) = P( X k) P( X j 1) = poissocdf(λ,k) poissocdf(λ,j 1) P( X k) = 1 P( X k 1) = 1 poissocdf(λ,k 1) For X ~ Poi(4.8), we have (i) P(X = 5) = poissopdf(4.8,5) 0.17474768 (ii) P( X 4) = 1 P(X 3) = 1 poissocdf(4.8,3) 0.70577 (iii) P( 3 X 5) = poissocdf(4.8,5) poissocdf(4.8,2) 0.508467 Mathematica Commads We also ca use Mathematica commads to compute Poisso probability values: X=PoissoDistributio[4.8]; PDF[X,5] CDF[X,4] Mea[X] StadardDeviatio[X] Exercise Traffic egieers ofte use a Poisso distributio to model the flow of cars i light traffic. For 15 miute itervals i the late morig hours, a average of 2.5 cars pass through a particular stop sig without makig a complete stop. Let X cout the umber of such cars durig ay give hour i the late morig. (a) What is the distributio of X? (b) Durig a give hour, what is the most likely umber of cars to pass through without makig a complete stop? (c) For a give hour, compute the probability that (i) from 8 to 12 cars pass through without makig a complete stop (ii) at least 8 cars pass through without makig a complete stop (d) Derive the miimum amout of time t durig which the probability of at least oe car passig through without makig a complete stop is at least 0.95.