The exponential distribution and the Poisson process

Similar documents
Exponential Distribution and Poisson Process

PoissonprocessandderivationofBellmanequations

Continuous-time Markov Chains

Manual for SOA Exam MLC.

Poisson Processes. Particles arriving over time at a particle detector. Several ways to describe most common model.

EE126: Probability and Random Processes

Chapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

The story of the film so far... Mathematics for Informatics 4a. Continuous-time Markov processes. Counting processes

ECE 313 Probability with Engineering Applications Fall 2000

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Expected Values, Exponential and Gamma Distributions

3. Poisson Processes (12/09/12, see Adult and Baby Ross)

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]

STAT 380 Markov Chains

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

Part I Stochastic variables and Markov chains

Arrivals and waiting times

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =

EDRP lecture 7. Poisson process. Pawe J. Szab owski

STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution

Renewal theory and its applications

Basics of Stochastic Modeling: Part II

1 Probability and Random Variables

Expected Values, Exponential and Gamma Distributions

Continuous Time Processes

CS 237: Probability in Computing

Poisson Processes. Stochastic Processes. Feb UC3M

Chapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations

Lecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014

Slides 8: Statistical Models in Simulation

RENEWAL PROCESSES AND POISSON PROCESSES

System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models

Random variables and transform methods

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Optimization and Simulation

Solution: The process is a compound Poisson Process with E[N (t)] = λt/p by Wald's equation.

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical

2 Continuous Random Variables and their Distributions

TMA 4265 Stochastic Processes

Simulating events: the Poisson process

errors every 1 hour unless he falls asleep, in which case he just reports the total errors

EE126: Probability and Random Processes

Continuous-Valued Probability Review

Birth-Death Processes

Continuous time Markov chains

Figure 10.1: Recording when the event E occurs

Things to remember when learning probability distributions:

Lecture 4a: Continuous-Time Markov Chain Models

PROBABILITY DISTRIBUTIONS

IEOR 6711, HMWK 5, Professor Sigman

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Chapter 8 Queuing Theory Roanna Gee. W = average number of time a customer spends in the system.

These notes will supplement the textbook not replace what is there. defined for α >0

NICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1

BMIR Lecture Series on Probability and Statistics Fall, 2015 Uniform Distribution

EE/CpE 345. Modeling and Simulation. Fall Class 5 September 30, 2002

Lecture 17: The Exponential and Some Related Distributions

Random Processes. DS GA 1002 Probability and Statistics for Data Science.

Queueing Theory. VK Room: M Last updated: October 17, 2013.

Chapter 4 Continuous Random Variables and Probability Distributions

LECTURE #6 BIRTH-DEATH PROCESS

Continuous Distributions

Ching-Han Hsu, BMES, National Tsing Hua University c 2015 by Ching-Han Hsu, Ph.D., BMIR Lab. = a + b 2. b a. x a b a = 12

Exponential & Gamma Distributions

2905 Queueing Theory and Simulation PART IV: SIMULATION

Continuous Time Markov Chains

Moments. Raw moment: February 25, 2014 Normalized / Standardized moment:

Markov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015

MAS1302 Computational Probability and Statistics

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

16:330:543 Communication Networks I Midterm Exam November 7, 2005

ISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16)

Chapter 2. Poisson Processes

Mahler s Guide to Stochastic Models

Introduction to Queuing Theory. Mathematical Modelling

3 Continuous Random Variables

Optional Stopping Theorem Let X be a martingale and T be a stopping time such

Data analysis and stochastic modeling

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)

Chapter 1: Revie of Calculus and Probability

Common ontinuous random variables

Stat410 Probability and Statistics II (F16)

Transform Techniques - CF

Notes on Continuous Random Variables

Simulation and Calibration of a Fully Bayesian Marked Multidimensional Hawkes Process with Dissimilar Decays

ECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes

December 19, Probability Theory Instituto Superior Técnico. Poisson Convergence. João Brazuna. Weak Law of Small Numbers

Review of Queuing Models

Lectures 16-17: Poisson Approximation. Using Lemma (2.4.3) with θ = 1 and then Lemma (2.4.4), which is valid when max m p n,m 1/2, we have

Chapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued

Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators.

An Analysis of the Preemptive Repeat Queueing Discipline

Performance Modelling of Computer Systems

Poisson processes and their properties

Continuous Probability Spaces

Independence is a basic property of events and r.v. in a probability model.

THE QUEEN S UNIVERSITY OF BELFAST

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

ISyE 3044 Fall 2015 Test #1 Solutions

Transcription:

The exponential distribution and the Poisson process 1-1

Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T] = 1 λ 2 1-2

Key Property: Memorylessness Memoryless Property Pr{T > a + b T > b} = Pr{T > a} a, b 0 Reliability: Amount of time a component has been in service has no effect on the amount of time until it fails Inter-event times: Amount of time since the last event contains no information about the amount of time until the next event Service times: Amount of remaining service time is independent of the amount of service time elapsed so far 1-3

Example Suppose that the amount of time one spends in a bank is exponentially distributed with mean 10 minutes, λ = 1/10. a. What is the probability that a customer will spend more than 15 minutes in the bank? b. What is the probability that a customer will spend more than 15 minutes in the bank given that he is still in the bank after 10 minutes? Solution P(X >15) = exp( 15 λ ) = exp( 3/2) = 0.22 P(X >15 X >10) = P(X >5) = exp( 1/2) = 0.604 14-4

Properties of Exponential Distribution Minimum of Two Exponentials: 1-5 If X 1, X 2,, X n are independent exponential r.v. s where X i has parameter (rate), then λ i is exponential with parameter (rate) λ + λ + + Competing Exponentials: 1 min(x 1, X 2,, X n ) λ n If X1 and X2 are independent exponential r.v. s with parameters (rate) λ and respectively, then P(x1< x2) = That is, the probability X1 occurs before X2 is 2 λ1 λ1 + λ2 λ1 λ + λ 1 2 1 λ 2

Properties of Exponential RV. The probability of 1 event happening in the next t is Pr{T t ) = 1 e λ t = 1 { 1 + ( λ t )+ ( λ t ) n /n! ) } = λ t When t is small, ( λ t ) n 0 Exponential is the only r.v. that has this property. 1-6

Counting Process A stochastic process {N(t), t 0} is a counting process if N(t) represents the total number of events that have occurred in [0, t] Then { N(t), t 0 } must satisfy: a) N (t) 0 b) N(t) is an integer for all t c) If s < t, then N (s) N(t) and d) For s < t, N (t ) - N (s) is the number of events that occur in the interval (s, t ]. 1-7

Stationary & Independent Increments independent increments A counting process has independent increments if for any 0 s t u v, N(t) N(s) is independent of N(v) N(u) i.e., the numbers of events that occur in non-overlapping intervals are independent r.v.s stationary increments A counting process has stationary increments if the distribution if, for any s < t, the distribution of N(t) N(s) depends only on the length of the time interval, t s. 14-8 1-8

Poisson Process Definition 1 1-9 A counting process {N(t), t 0} is a Poisson process with rate λ, λ > 0, if N(0) = 0 The process has independent increments The number of events in any interval of length t follows a Poisson distribution with mean λt Pr{ N(t+s) N(s) = n } = (λt) n e λt /n!, n = 0, 1,... Where λ is arrival rate and t is length of the interval Notice, it has stationary increments 14-9

Poisson Process Definition 2 A function f is said to be o(h) ( Little oh of h ) if ( ) f h lim = 0 h 0 h A counting process {N(t), t 0} is a Poisson process with rate λ, λ > 0, if N(0) = 0 and the process has stationary and independent increments and Pr { N(h) = 1} = λh + o(h) Pr { N(h) 1} = o(h) Definitions 1 and 2 are equivalent because exponential distribution is the only distribution with this property 14-10 1-10

Interarrival and WaitingTimes N(t) The times between arrivals T1, T2, are independent exponential r.v. s with mean 1/λ: P(T1>t) = P(N(t) =0) = e -λt The (total) waiting time until the nth event has a gamma distribution S1 S 2 S 3 S 4 t n = T 1 T 2 T 3 T 4 i= 1 1-11 S n T i

Interarrival andwaitingtime Define T as the elapsed time between (n 1) st and the n th n event. { T n, n = 1,2,...} is a sequence of interarrival times. Proposition : T n, n = 1,2,... are independent identically 1 distributed exponential random variables with mean. Define as the waiting time for the n th λ S n event, i.e., the arrival time of the n th event. n S = T n i i= 1 1-12

i.e. distribution of S n is: ( ) n 1 t λt f ( t) = λe λ sn ( n 1)! which is the gamma distribution with parameters n and λ. E ( S ) n = E( Ti ) n = n i= 1 λ 1-13

Example Suppose that people immigrate into a territory at a Poisson rate = 1 per day. (a) What is the expected time until the tenth immigrant arrives? (b) What is the probability that the elapsed time between the tenth and the eleventh arrival exceeds 2 days? Solution: Time until the 10th immigrant arrives is S10. 10 E( S ) = = 10 10 λ. 2λ P( > 2) = e = 0. 133 1-14 14-14 T 11