# e.g. arrival of a customer to a service station or breakdown of a component in some system.

 To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video
Save this PDF as:

Size: px
Start display at page:

Download "e.g. arrival of a customer to a service station or breakdown of a component in some system."

## Transcription

1 Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be the number of event occurrences in [0, t], N(t) is a nondecreasing, integer valued, continuous-time random process. Suppose [0, t] is divided into n subintervals of width t t n.

2 Two assumptions: 1. The probability of more than one event occurences in a subinterval is negligible compared to the probability of observing one or zero events. That is, outcome in each subinterval is a Bernoulli trial. 2. Whether or not an event occurs in a subinterval is independent of the outcomes in other intervals. That is, these Bernoulli trials are independent. These two assumptions together imply that the counting process N(t) can be approximated by the binomial counting process that counts the number of successes in the n Bernoulli trials.

3 If the probability of an event occurrence in each subinterval is p, then the expected number of event occurrences in [0, t] is np. Since events occur at the rate λ events per second, then λt np. Let n, p 0 while λt np remains fixed, the binomial distribution approaches a Poisson distribution with parameter λt. p[n(t) k] (λt)k e λt, k 0,1,. k! The Poisson process N(t) inherits properties of independent and stationary increments from the underlying binomial process. Hence, the pmf for the number of event occurrences in any interval of length t is given by the above formula.

4 1. Independent increments for non-overlapping intervals [t 1, t 2 ] and [t 3, t 4 ] are non-overlapping time intervals N[t 2 ] N[t 1 ] increment over the interval [t 1, t 2 ] N[t 4 ] N[t 3 ] increment over the interval [t 3, t 4 ]. If N(t) is a Poisson process, then N[t 2 ] N[t 1 ] and N[t 4 ] N[t 3 ] are independent.

5 2. Stationary increments property Increments in intervals of the same length have the same distribution regardless of when the interval begins. P[N(t 2 ) N(t 1 ) k] P[N(t 2 t 1 ) N(0) k] For t 1 < t 2, the joint pmf is P[N(t 2 t 1 ) k] (N(0) 0) e λ(t 2 t 1 ) [λ(t 2 t 1 )] k, k! k 0,1,. P[N(t 1 ) i, N(t 2 ) j] P[N(t 1 ) i]p[n(t 2 ) N(t 1 ) j i] P[N(t 1 ) i]p[n(t 2 t 1 ) j i] (λt 1) i e λt 1[λ(t 2 t 1 )] j i e λ(t 2 t 1 ). i! (j i)!

6 Use of the independent increments property leads to C N (t 1, t 2 ) E[(N(t 1 ) λt 1 )(N(t 2 ) λt 2 )], assuming t 1 t 2 E[(N(t 1 ) λt 1 ){N(t 2 ) N(t 1 ) λ(t 2 t 1 ) + N(t 1 ) λt 1 }] E[(N(t 1 ) λt 1 ){N(t 2 ) N(t 1 ) λ(t 2 t 1 )}] + E[(N(t 1 ) λt 1 ) 2 ] E[N(t 1 ) λt 1 ]E[N(t 2 ) N(t 1 ) λ(t 2 t 1 )] + VAR[N(t 1 )] VAR[N(t 1 )] λt 1 λmin(t 1, t 2 ).

7 Example Inquiries arrive at the rate 15 inquiries per minute as a Poisson process. Find the probability that in a 1-minute period, 3 inquiries arrive during the first 10 seconds and 2 inquiries arrive during the last 15 seconds. Solution The arrival rate in seconds is λ The probability of interest 4 is P[N(10) 3, N(60) N(45) 2] P[N(10) 3]P[N(60) N(45) 2] (independent increments) P[N(10) 3]P[N(60 45) 2] (stationary increments) ( 10 4 ) 3 e 10/4 3! ( ) e 15/4 2!.

8 Consider the time T between event occurrences in a Poisson process. The probability that the inter-event time T exceeds t seconds is equivalent to no event occurring in t seconds (that is, no event in n Bernoulli trials) P[T > t] P[no event in t seconds] ( (1 p) n 1 λt ) n e λt, as n. n The random variable T is an exponential random variable with parameter λ. Since the times between event occurrences in the underlying binomial process are independent geometric random variables, the sequence of interevent times in a Poisson process is composed of independent random variables. The interevent times in a Poisson process form an iid sequence of exponential random variables with mean 1/λ.

9 Example Show that the inter-event times in a Poisson process with rate λ are independent and identically distributed exponential random variables with parameter λ. Solution Let Z 1, Z 2, be the random variables representing the length of inter-event times. First, note that {Z 1 > t} happens if and only if no event occurs in [0, t] and thus P[Z 1 > t] P[X(t) 0] e λt. Since P[X(t) k] (λt)k e λt, so F Z1 (t) 1 e λt. Hence, Z 1 is an exponential k! random variable with parameter λ. Note that {Z 2 > t Z 1 τ} {No event occur in [τ, τ + t]} {X(τ + t) X(τ) 0}.

10 Let f 1 (t) be the pdf of Z 1. By the rule of total probabilities, we have P[Z 2 > t] P[Z 2 > t Z 1 τ]f 1 (τ) dτ 0 P[X(τ + t) X(τ) 0]f 1(τ) dτ 0 P[X(t) 0]f 1(τ) dτ by stationary increments 0 e λt f 1(τ) dτ e λt. 0 Therefore, Z 2 is also an exponential random variable with parameter λ and it is independent of Z 1. Repeating the same argument, we conclude that Z 1, Z 2, are iid exponential random variables with parameter λ.

11 Occurrence of nth event Write t j as the random time corresponding to the occurence of the j th event, j 1,2,. Let T j denote the iid exponential interarrival times, then T j t j t j 1, t 0 0. S n time at which the nth event occurs in a Poisson process T 1 + T T n. Example With λ 1/4 inquiries per second, find the mean and variance of the time until the arrival of the 10th inquiry. E[S 10 ] 10E[T] 10 λ 40 sec VAR[S 10 ] 10VAR[T] 10 λ sec2.

12 Example Messages arrive at a computer from two telephone lines according to independent Poisson processes of rates λ 1 and λ 2, respectively. (a) Find the probability that a message arrives first on line 1. (b) Find the pdf for the time until a message arrives on either line. (c) Find the pmf for N(t), the total number of messages that arrive in an interval of length t.

13 Solution (a) Let X 1 and X 2 be the number of messages from line 1 and line 2 in time t, respectively. Probability that a message arrives first on line 1 P[X 1 1 X 1 + X 2 1] P[X 1 1, X 2 0] P[X 1 + X 2 1]. Since X 1 and X 2 are independent Poisson processes, their sum X 1 + X 2 is a Poisson process with rate λ 1 + λ 2. Further, since X 1 and X 2 are independent, P[X 1 1, X 2 0] P[X 1 1]P[X 2 0] so P[X 1 1 X 1 + X 2 1] P[X 1 1]P[X 2 0] P[X 1 + X 2 1] e λ 1t (λ 1 t)e λ 2t (λ 2 t) 0 e (λ 1+λ 2 )t(λ 1 +λ 2 )t λ 1 λ 1 + λ 2.

14 (b) Let T i be the time until the first message arrives in line i, i 1,2; T 1 and T 2 are independent exponential random variables. The time until the first message arrives at a computer T min(t 1, T 2 ). P[T > t] P[min(T 1, T 2 ) > t] P[T 1 > t, T 2 > t] P[T 1 > t]p[t 2 > t] e λ 1t e λ 2t pdf of T f T (t) d dt P[T > t] (λ 1 + λ 2 )e (λ 1+λ 2 )t.

15 (c) N total number of messages that arrive in an interval of time t X 1 + X 2. It is known that the sum of independent Poisson processes remains to be Poisson. Hence, P[N n] e (λ 1+λ 2 )t [(λ 1 + λ 2 )t] n. n!

16 Example Show that given one arrival has occurred in the interval [0, t], then the customer arrival time is uniformly distributed in [0, t]. Precisely, let X denote the arrival time of the single customer, then for 0 < x < t, P[X x] x/t. Solution P[X x] P[N(x) 1 N(t) 1] P[N(x) 1 and N(t) 1] P[N(t) 1] P[N(x) 1 and N(t) N(x) 0] P[N(t) 1] P[N(x) 1]P[N(t) N(x) 0] P[N(t) 1] λxe λx e λ(t x) λte λt x t.

17 Random telegraph signal Consider a random process X(t) that assumes the values ±1. Suppose that X(0) ±1 with probability 1 and X(t) then changes polarity with each occurrence of an event in a Poisson process of rate 2 α. The figure shows a sample path of a random telegraph signal. The times between transitions X j are iid exponential random variables. It can be shown that the random telegraph signal is equally likely to be ±1 at any time t > 0.

18 Note that P[X(t) ±1] P[X(t) ±1 X(0) 1]P[X(0) 1] + P[X(t) ±1 X(0) 1]P[X(0) 1]. (i) X(t) will have the same polarity as X(0) only when an even number of events occurs in (0, t]. P[X(t) ±1 X(0) ±1] P[N(t) even integer] (αt) 2j (2j)! e αt j0 e αteαt + e αt (1 + e 2αt ). (ii) X(t) and X(0) will differ in sign if the number of events in t is odd P[X(t) ±1 X(0) 1] j0 (αt) 2j+1 (2j + 1)! e αt e αteαt e αt 2 1 e 2αt. 2

19 Now, P[X(t) 1] 1 2 [ 1 + e 2αt ] e 2αt and P[X(t) 1] 1 P[X(t) 1] 1 2. Next, m X (t) 1P[X(t) 1] + ( 1)P[X(t) 1] 0 VAR[X(t)] E[X(t) 2 ] m X (t) P[X(t) 1] + ( 1) 2 P[X(t) 1] 1 C X (t 1, t 2 ) E[X(t 1 )X(t 2 )] 1P[X(t 1 ) X(t 2 )] + ( 1)P[X(t 1 ) X(t 2 )] 1 2 [1 + e 2α t 2 t 1 ] 1 2 [1 e 2α t 2 t 1 ] e 2α t 2 t 1. The autocovariance tends to zero when t 2 t 1.

20 Example Find P[N(t d) j N(t) k] with d > 0, where N(t) is a Poisson process with rate λ. Solution P[N(t d) j N(t) k] P[N(t d) j, N(t) k] P[N(t) k] P[N(t d) j, N(t) N(t d) k j] P[N(t) k] P[N(t d) j]p[n(t) N(t d) k j] P[N(t) k] P[N(t d) j]p[n(d) k j] [λ(t d)] j e λ(t d) j! P[N(t) k] (λd) k j e λd (k j)! (λt) k e λt k! k C j [λ(t d)] j (λd) k j (λt) k k C j ( t d t (independent increments) (stationary increments) ) j ( ) d k j. t

21 This is same as the probability of choosing j successes out of k trials, with probability of success t d. Conditional on k occurrences over [0, t], we find t the probability of j occurrences over [0, t d].

22 Example Customers arrive at a soft drink dispensing machine according to a Poisson process with rate λ. Suppose that each time a customer deposits money, the machine dispenses a soft drink with probability p. Find the pmf for the number of soft drinks dispensed in time t. Assume that the machine holds an infinite number of soft drinks.

23 Solution Let N(t) be the number of soft drinks dispensed up to time t, and X(t) be the number of customer arrivals up to time t. P[N(t) k] nk nk m0 e λt P[N(t) k X(t) n]p[x(t) n] nc k p k (1 p) n k [ e λt (λt) n n! m+kc k p k (1 p) me λt (λt) m+k,set n m + k (m + k)! m0 [λt(1 p)] m m! e λt e λt(1 p)(λpt)k k! (λpt) k k! ] e λpt (λpt) k, k 0,1,2, k!

24 Conditional Expectation The conditional expectation of Y given X x is given by E[Y x] yf Y (y x) dy. When X and Y are both discrete random variables E[Y x] y j y j P Y (y j x). On the other hand, E[Y x] can be viewed as a function of x: g(x) E[Y x]. Correspondingly, this gives rise to the random variable: g(x) E[Y X].

25 What is E[E[Y X]]? Note that E[E[Y X]] E[Y x]f X(x) dx, X is continuous E[Y x k ]P X (x k ), X is discrete x k. Suppose X and Y are jointly continuous random variables E[E[Y X]] E[Y x]f X(x) dx y yf Y (y x) dy f X (x) dx f XY (x, y) dxdy yf Y (y) dy E[Y ]. Generalization E[h(Y )] E[E(h(Y ) X]] [in the above proof, change y to h(y)]; and in particular, E[Y k ] E[E[Y k X]].

26 Example A customer entering a service station is served by serviceman i with probability p i, i 1,2,, n. The time taken by serviceman i to service a customer is an exponentially distributed random variable with parameter α i. Let I be the discrete random variable which assumes the value i if the customer is serviced by the ith serviceman, and let P I (i) denote the probability mass function of I. Let T denote the time taken to service a customer. (a) Explain the meaning of the following formula P[T t] n i1 P I (i)p[t t I i]. Use it to find the probability density function of T. (b) Use the conditional expectation formula to compute E[T]. E[E[T I]] E[T]

27 Solution (a) From the conditional probability formula, we have P[T t, I i] P I (i)p[t t I i]. The marginal distribution function P[T t] is obtained by summing the joint probability values P[T t, I i] for all possible values of i. Hence, P[T t] n i1 P I (i)p[t t I i]. Here, P I (i) p i and P[T t I i] 1 e αit, t 0. The probability density function of T is given by f T (t) d P[T t] dt n i1 p i α i e α it t 0 0 otherwise.

28 (b) E[T] E[E[T I]] n p i i1 n i1 p i α i. n i1 0 α ite α it dt P I (i)e[t I i] The mean service time is the weighted average of mean service times at different counters, where 1 α i is the mean service time for the ith serviceman.

29 Example Find the mean and variance of number of customer arrivals N during the service time T of a specific customer. Let f T (t) denote the pdf of T. Assume the customer arrivals follow the Poisson process. Solution E[N T t] λt, E[N 2 T t] λt + λ 2 t 2 where λ is the average number of customers per unit time. E[N] E[N 2 ] 0 E[N T t]f T(t) dt 0 λtf T(t) dt λe[t] 0 E[N2 T t]f T (t) dt (λt + 0 λ2 t 2 )f T (t) dt λe[t] + λ 2 E[T 2 ] VAR[N] E[N 2 ] E[N] 2 λe[t] + λ 2 E[T 2 ] λ 2 E[T] 2 λ 2 VAR[T] + λe[t].

30 Example (a) Show that VAR[X] E[VAR[X Y ]] + VAR[E[X Y ]]. (b) Suppose that by any time t the number of people that have arrived at a train station is a Poisson variable with mean λt. If a train arrives at the station at a time that is uniformly distributed over (0, T), what are the mean and variance of the number of passengers that enter the train? Hint: Let Y denote the arrival time of the train. Knowing that E[N(Y ) Y t] λt, compute E[N(Y )] and VAR[N(Y )].

31 Solution Starting with Var(X Y ) E[X 2 Y ] (E[X Y ]) 2 so E[Var(X Y )] E[E[X 2 Y ]] E[E[X Y ]) 2 ] E[X 2 ] E[(E Y ]) 2 ]. Since E[E[X Y ]] E[X], we have Var(E[X Y ]) E[(E[X Y ]) 2 ] (E[X]) 2. Hence, by adding the above two equations, we obtain the result.

32 Let N(t) denote the number of arrivals by t, and let Y denote the time at which the train arrives. The random variable of interest is then N(Y ). Conditioning on Y t, we have Hence E[N(Y ) Y t] E[N(t) Y t] so taking expectations gives E[N(t)] by the independence of Y and N(t) λt since N(t) is Poisson with mean λt. E[N(Y ) Y ] λy E[N(Y )] λe[y ] λt 2.

33 To obtain Var(N(Y )), we use the conditional variance formula: so Var(N(Y ) Y t) Var(N(t) Y t) Var(N(t)) by independence λt Var(N(Y ) Y ) λy E[N(Y ) Y ] λy. Hence, from the conditional variance formula, Var(N(Y )) E[λY ] + Var(λY ) Note that we have used Var(Y ) T 2 /12. λ T 2 + λ2t2 12

### Exponential Distribution

Exponential Distribution Definition: Exponential distribution with parameter λ: { λe λx x 0 f(x) = 0 x < 0 The cdf: F(x) = x Mean E(X) = 1/λ. f(x)dx = Moment generating function: φ(t) = E[e tx ] = { 1

### Worked examples Random Processes

Worked examples Random Processes Example 1 Consider patients coming to a doctor s office at random points in time. Let X n denote the time (in hrs) that the n th patient has to wait before being admitted

### The Exponential Distribution

21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding

### Math 461 Fall 2006 Test 2 Solutions

Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two

### 6.041/6.431 Spring 2008 Quiz 2 Wednesday, April 16, 7:30-9:30 PM. SOLUTIONS

6.4/6.43 Spring 28 Quiz 2 Wednesday, April 6, 7:3-9:3 PM. SOLUTIONS Name: Recitation Instructor: TA: 6.4/6.43: Question Part Score Out of 3 all 36 2 a 4 b 5 c 5 d 8 e 5 f 6 3 a 4 b 6 c 6 d 6 e 6 Total

### Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab

Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?

### Math 431 An Introduction to Probability. Final Exam Solutions

Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <

### Topic 2: Scalar random variables. Definition of random variables

Topic 2: Scalar random variables Discrete and continuous random variables Probability distribution and densities (cdf, pmf, pdf) Important random variables Expectation, mean, variance, moments Markov and

### What is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference

0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures

### Section 5.1 Continuous Random Variables: Introduction

Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,

### Conditional expectation

A Conditional expectation A.1 Review of conditional densities, expectations We start with the continuous case. This is sections 6.6 and 6.8 in the book. Let X, Y be continuous random variables. We defined

### MTH135/STA104: Probability

MTH135/STA14: Probability Homework # 8 Due: Tuesday, Nov 8, 5 Prof Robert Wolpert 1 Define a function f(x, y) on the plane R by { 1/x < y < x < 1 f(x, y) = other x, y a) Show that f(x, y) is a joint probability

### Renewal Theory. (iv) For s < t, N(t) N(s) equals the number of events in (s, t].

Renewal Theory Def. A stochastic process {N(t), t 0} is said to be a counting process if N(t) represents the total number of events that have occurred up to time t. X 1, X 2,... times between the events

### Important Probability Distributions OPRE 6301

Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.

### 3 Multiple Discrete Random Variables

3 Multiple Discrete Random Variables 3.1 Joint densities Suppose we have a probability space (Ω, F,P) and now we have two discrete random variables X and Y on it. They have probability mass functions f

### Exercises with solutions (1)

Exercises with solutions (). Investigate the relationship between independence and correlation. (a) Two random variables X and Y are said to be correlated if and only if their covariance C XY is not equal

### Contents. TTM4155: Teletraffic Theory (Teletrafikkteori) Probability Theory Basics. Yuming Jiang. Basic Concepts Random Variables

TTM4155: Teletraffic Theory (Teletrafikkteori) Probability Theory Basics Yuming Jiang 1 Some figures taken from the web. Contents Basic Concepts Random Variables Discrete Random Variables Continuous Random

### Tenth Problem Assignment

EECS 40 Due on April 6, 007 PROBLEM (8 points) Dave is taking a multiple-choice exam. You may assume that the number of questions is infinite. Simultaneously, but independently, his conscious and subconscious

### Aggregate Loss Models

Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing

### Statistics 100A Homework 8 Solutions

Part : Chapter 7 Statistics A Homework 8 Solutions Ryan Rosario. A player throws a fair die and simultaneously flips a fair coin. If the coin lands heads, then she wins twice, and if tails, the one-half

### Math 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 2 Solutions

Math 70/408, Spring 2008 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 2 Solutions About this problem set: These are problems from Course /P actuarial exams that I have collected over the years,

### 1 IEOR 6711: Notes on the Poisson Process

Copyright c 29 by Karl Sigman 1 IEOR 6711: Notes on the Poisson Process We present here the essentials of the Poisson point process with its many interesting properties. As preliminaries, we first define

### Homework 4 - KEY. Jeff Brenion. June 16, 2004. Note: Many problems can be solved in more than one way; we present only a single solution here.

Homework 4 - KEY Jeff Brenion June 16, 2004 Note: Many problems can be solved in more than one way; we present only a single solution here. 1 Problem 2-1 Since there can be anywhere from 0 to 4 aces, the

### ECE302 Spring 2006 HW4 Solutions February 6, 2006 1

ECE302 Spring 2006 HW4 Solutions February 6, 2006 1 Solutions to HW4 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in

### 18 Poisson Process 18 POISSON PROCESS 196. A counting process is a random process N(t), t 0, such that. 1. N(t) is a nonnegative integer for each t;

18 POISSON PROCESS 196 18 Poisson Process A counting process is a random process N(t), t 0, such that 1. N(t) is a nonnegative integer for each t;. N(t) is nondecreasing in t; and 3. N(t) is right-continuous.

### Continuous Random Variables

Continuous Random Variables COMP 245 STATISTICS Dr N A Heard Contents 1 Continuous Random Variables 2 11 Introduction 2 12 Probability Density Functions 3 13 Transformations 5 2 Mean, Variance and Quantiles

### Probability Generating Functions

page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence

### Joint Exam 1/P Sample Exam 1

Joint Exam 1/P Sample Exam 1 Take this practice exam under strict exam conditions: Set a timer for 3 hours; Do not stop the timer for restroom breaks; Do not look at your notes. If you believe a question

### Definition 6.1.1. A r.v. X has a normal distribution with mean µ and variance σ 2, where µ R, and σ > 0, if its density is f(x) = 1. 2σ 2.

Chapter 6 Brownian Motion 6. Normal Distribution Definition 6... A r.v. X has a normal distribution with mean µ and variance σ, where µ R, and σ > 0, if its density is fx = πσ e x µ σ. The previous definition

### MAINTAINED SYSTEMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University ENGINEERING RELIABILITY INTRODUCTION

MAINTAINED SYSTEMS Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University OUTLINE MAINTE MAINTE MAINTAINED UNITS Maintenance can be employed in two different manners: Preventive

### Practice Problems #4

Practice Problems #4 PRACTICE PROBLEMS FOR HOMEWORK 4 (1) Read section 2.5 of the text. (2) Solve the practice problems below. (3) Open Homework Assignment #4, solve the problems, and submit multiple-choice

### Chapter 4 Expected Values

Chapter 4 Expected Values 4. The Expected Value of a Random Variables Definition. Let X be a random variable having a pdf f(x). Also, suppose the the following conditions are satisfied: x f(x) converges

### The Poisson process. Chapter Definition of the Poisson process

Chapter 3 The Poisson process The next part of the course deals with some fundamental models of events occurring randomly in continuous time. Many modelling applications involve events ( arrivals ) happening

### Notes on Continuous Random Variables

Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes

### UNIT I: RANDOM VARIABLES PART- A -TWO MARKS

UNIT I: RANDOM VARIABLES PART- A -TWO MARKS 1. Given the probability density function of a continuous random variable X as follows f(x) = 6x (1-x) 0

### CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.

Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,

### Chapter 4. Multivariate Distributions

1 Chapter 4. Multivariate Distributions Joint p.m.f. (p.d.f.) Independent Random Variables Covariance and Correlation Coefficient Expectation and Covariance Matrix Multivariate (Normal) Distributions Matlab

### Poisson processes (and mixture distributions)

Poisson processes (and mixture distributions) James W. Daniel Austin Actuarial Seminars www.actuarialseminars.com June 26, 2008 c Copyright 2007 by James W. Daniel; reproduction in whole or in part without

### ST 371 (VIII): Theory of Joint Distributions

ST 371 (VIII): Theory of Joint Distributions So far we have focused on probability distributions for single random variables. However, we are often interested in probability statements concerning two or

### 5. Continuous Random Variables

5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be

### Chapter 4 Lecture Notes

Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,

### Lecture Notes 1. Brief Review of Basic Probability

Probability Review Lecture Notes Brief Review of Basic Probability I assume you know basic probability. Chapters -3 are a review. I will assume you have read and understood Chapters -3. Here is a very

### Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density

HW MATH 461/561 Lecture Notes 15 1 Definition: Suppose that two random variables, either continuous or discrete, X and Y have joint density and marginal densities f(x, y), (x, y) Λ X,Y f X (x), x Λ X,

### Chapters 5. Multivariate Probability Distributions

Chapters 5. Multivariate Probability Distributions Random vectors are collection of random variables defined on the same sample space. Whenever a collection of random variables are mentioned, they are

### 1 Definition of Conditional Expectation

1 DEFINITION OF CONDITIONAL EXPECTATION 4 1 Definition of Conditional Expectation 1.1 General definition Recall the definition of conditional probability associated with Bayes Rule P(A B) P(A B) P(B) For

### EE 322: Probabilistic Methods for Electrical Engineers. Zhengdao Wang Department of Electrical and Computer Engineering Iowa State University

EE 322: Probabilistic Methods for Electrical Engineers Zhengdao Wang Department of Electrical and Computer Engineering Iowa State University Discrete Random Variables 1 Introduction to Random Variables

### Review. Lecture 3: Probability Distributions. Poisson Distribution. May 8, 2012 GENOME 560, Spring Su In Lee, CSE & GS

Lecture 3: Probability Distributions May 8, 202 GENOME 560, Spring 202 Su In Lee, CSE & GS suinlee@uw.edu Review Random variables Discrete: Probability mass function (pmf) Continuous: Probability density

### STAT 430/510 Probability Lecture 14: Joint Probability Distribution, Continuous Case

STAT 430/510 Probability Lecture 14: Joint Probability Distribution, Continuous Case Pengyuan (Penelope) Wang June 20, 2011 Joint density function of continuous Random Variable When X and Y are two continuous

### Bivariate Distributions

Chapter 4 Bivariate Distributions 4.1 Distributions of Two Random Variables In many practical cases it is desirable to take more than one measurement of a random observation: (brief examples) 1. What is

### Lecture 7: Continuous Random Variables

Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider

### Solutions for the exam for Matematisk statistik och diskret matematik (MVE050/MSG810). Statistik för fysiker (MSG820). December 15, 2012.

Solutions for the exam for Matematisk statistik och diskret matematik (MVE050/MSG810). Statistik för fysiker (MSG8). December 15, 12. 1. (3p) The joint distribution of the discrete random variables X and

### 2WB05 Simulation Lecture 8: Generating random variables

2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating

### Math 370, Spring 2008 Prof. A.J. Hildebrand. Practice Test 2 Solutions

Math 370, Spring 008 Prof. A.J. Hildebrand Practice Test Solutions About this test. This is a practice test made up of a random collection of 5 problems from past Course /P actuarial exams. Most of the

### IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS

IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)

### Topic 4: Multivariate random variables. Multiple random variables

Topic 4: Multivariate random variables Joint, marginal, and conditional pmf Joint, marginal, and conditional pdf and cdf Independence Expectation, covariance, correlation Conditional expectation Two jointly

### Chapter 2: Data quantifiers: sample mean, sample variance, sample standard deviation Quartiles, percentiles, median, interquartile range Dot diagrams

Review for Final Chapter 2: Data quantifiers: sample mean, sample variance, sample standard deviation Quartiles, percentiles, median, interquartile range Dot diagrams Histogram Boxplots Chapter 3: Set

### Probability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X

Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random

### Introduction to Probability

Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence

### 6. Jointly Distributed Random Variables

6. Jointly Distributed Random Variables We are often interested in the relationship between two or more random variables. Example: A randomly chosen person may be a smoker and/or may get cancer. Definition.

### LECTURE 16. Readings: Section 5.1. Lecture outline. Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process

LECTURE 16 Readings: Section 5.1 Lecture outline Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process Number of successes Distribution of interarrival times The

### EE 302 Division 1. Homework 5 Solutions.

EE 32 Division. Homework 5 Solutions. Problem. A fair four-sided die (with faces labeled,, 2, 3) is thrown once to determine how many times a fair coin is to be flipped: if N is the number that results

### POL 571: Expectation and Functions of Random Variables

POL 571: Expectation and Functions of Random Variables Kosuke Imai Department of Politics, Princeton University March 10, 2006 1 Expectation and Independence To gain further insights about the behavior

### Stat 515 Midterm Examination II April 6, 2010 (9:30 a.m. - 10:45 a.m.)

Name: Stat 515 Midterm Examination II April 6, 2010 (9:30 a.m. - 10:45 a.m.) The total score is 100 points. Instructions: There are six questions. Each one is worth 20 points. TA will grade the best five

### ECE302 Spring 2006 HW7 Solutions March 11, 2006 1

ECE32 Spring 26 HW7 Solutions March, 26 Solutions to HW7 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics where

### Statistics 100A Homework 7 Solutions

Chapter 6 Statistics A Homework 7 Solutions Ryan Rosario. A television store owner figures that 45 percent of the customers entering his store will purchase an ordinary television set, 5 percent will purchase

### STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE

STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE TROY BUTLER 1. Random variables and distributions We are often presented with descriptions of problems involving some level of uncertainty about

### Random Variables and Their Expected Values

Discrete and Continuous Random Variables The Probability Mass Function The (Cumulative) Distribution Function Discrete and Continuous Random Variables The Probability Mass Function The (Cumulative) Distribution

### Example: 1. You have observed that the number of hits to your web site follow a Poisson distribution at a rate of 2 per day.

16 The Exponential Distribution Example: 1. You have observed that the number of hits to your web site follow a Poisson distribution at a rate of 2 per day. Let T be the time (in days) between hits. 2.

### M/M/1 and M/M/m Queueing Systems

M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential

### 4. Joint Distributions of Two Random Variables

4. Joint Distributions of Two Random Variables 4.1 Joint Distributions of Two Discrete Random Variables Suppose the discrete random variables X and Y have supports S X and S Y, respectively. The joint

### Worked examples Multiple Random Variables

Worked eamples Multiple Random Variables Eample Let X and Y be random variables that take on values from the set,, } (a) Find a joint probability mass assignment for which X and Y are independent, and

### Fifth Problem Assignment

EECS 40 PROBLEM (24 points) Discrete random variable X is described by the PMF { K x p X (x) = 2, if x = 0,, 2 0, for all other values of x Due on Feb 9, 2007 Let D, D 2,..., D N represent N successive

### ECE302 Spring 2006 HW3 Solutions February 2, 2006 1

ECE302 Spring 2006 HW3 Solutions February 2, 2006 1 Solutions to HW3 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in

### Principle of Data Reduction

Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then

### ECE302 Spring 2006 HW5 Solutions February 21, 2006 1

ECE3 Spring 6 HW5 Solutions February 1, 6 1 Solutions to HW5 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in italics

### Math 370, Actuarial Problemsolving Spring 2008 A.J. Hildebrand. Practice Test, 1/28/2008 (with solutions)

Math 370, Actuarial Problemsolving Spring 008 A.J. Hildebrand Practice Test, 1/8/008 (with solutions) About this test. This is a practice test made up of a random collection of 0 problems from past Course

### ISyE 6761 Fall 2012 Homework #2 Solutions

1 1. The joint p.m.f. of X and Y is (a) Find E[X Y ] for 1, 2, 3. (b) Find E[E[X Y ]]. (c) Are X and Y independent? ISE 6761 Fall 212 Homework #2 Solutions f(x, ) x 1 x 2 x 3 1 1/9 1/3 1/9 2 1/9 1/18 3

### Finite Markov Chains and Algorithmic Applications. Matematisk statistik, Chalmers tekniska högskola och Göteborgs universitet

Finite Markov Chains and Algorithmic Applications Olle Häggström Matematisk statistik, Chalmers tekniska högskola och Göteborgs universitet PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE

### Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS

Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 4: Geometric Distribution Negative Binomial Distribution Hypergeometric Distribution Sections 3-7, 3-8 The remaining discrete random

### RANDOM VARIABLES MATH CIRCLE (ADVANCED) 3/3/2013. 3 k) ( 52 3 )

RANDOM VARIABLES MATH CIRCLE (ADVANCED) //0 0) a) Suppose you flip a fair coin times. i) What is the probability you get 0 heads? ii) head? iii) heads? iv) heads? For = 0,,,, P ( Heads) = ( ) b) Suppose

### Master s Theory Exam Spring 2006

Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem

### MATH 201. Final ANSWERS August 12, 2016

MATH 01 Final ANSWERS August 1, 016 Part A 1. 17 points) A bag contains three different types of dice: four 6-sided dice, five 8-sided dice, and six 0-sided dice. A die is drawn from the bag and then rolled.

### Continuous random variables

Continuous random variables So far we have been concentrating on discrete random variables, whose distributions are not continuous. Now we deal with the so-called continuous random variables. A random

### Chapter 3: Discrete Random Variable and Probability Distribution. January 28, 2014

STAT511 Spring 2014 Lecture Notes 1 Chapter 3: Discrete Random Variable and Probability Distribution January 28, 2014 3 Discrete Random Variables Chapter Overview Random Variable (r.v. Definition Discrete

### Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x

### 1.1 Introduction, and Review of Probability Theory... 3. 1.1.1 Random Variable, Range, Types of Random Variables... 3. 1.1.2 CDF, PDF, Quantiles...

MATH4427 Notebook 1 Spring 2016 prepared by Professor Jenny Baglivo c Copyright 2009-2016 by Jenny A. Baglivo. All Rights Reserved. Contents 1 MATH4427 Notebook 1 3 1.1 Introduction, and Review of Probability

### Recitation 4. 24xy for 0 < x < 1, 0 < y < 1, x + y < 1 0 elsewhere

Recitation. Exercise 3.5: If the joint probability density of X and Y is given by xy for < x

### Summary of Formulas and Concepts. Descriptive Statistics (Ch. 1-4)

Summary of Formulas and Concepts Descriptive Statistics (Ch. 1-4) Definitions Population: The complete set of numerical information on a particular quantity in which an investigator is interested. We assume

### The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

### Random Variables of The Discrete Type

Random Variables of The Discrete Type Definition: Given a random experiment with an outcome space S, a function X that assigns to each element s in S one and only one real number x X(s) is called a random

### Section 6.1 Joint Distribution Functions

Section 6.1 Joint Distribution Functions We often care about more than one random variable at a time. DEFINITION: For any two random variables X and Y the joint cumulative probability distribution function

### Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. Part 3: Discrete Uniform Distribution Binomial Distribution

Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 3: Discrete Uniform Distribution Binomial Distribution Sections 3-5, 3-6 Special discrete random variable distributions we will cover

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 18. A Brief Introduction to Continuous Probability

CS 7 Discrete Mathematics and Probability Theory Fall 29 Satish Rao, David Tse Note 8 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces

### 3. Continuous Random Variables

3. Continuous Random Variables A continuous random variable is one which can take any value in an interval (or union of intervals) The values that can be taken by such a variable cannot be listed. Such

### Review Exam Suppose that number of cars that passes through a certain rural intersection is a Poisson process with an average rate of 3 per day.

Review Exam 2 This is a sample of problems that would be good practice for the exam. This is by no means a guarantee that the problems on the exam will look identical to those on the exam but it should

### Topic 8: The Expected Value

Topic 8: September 27 and 29, 2 Among the simplest summary of quantitative data is the sample mean. Given a random variable, the corresponding concept is given a variety of names, the distributional mean,

### 3. The Economics of Insurance

3. The Economics of Insurance Insurance is designed to protect against serious financial reversals that result from random evens intruding on the plan of individuals. Limitations on Insurance Protection

### Statistics 100A Homework 4 Solutions

Problem 1 For a discrete random variable X, Statistics 100A Homework 4 Solutions Ryan Rosario Note that all of the problems below as you to prove the statement. We are proving the properties of epectation