Exponential Distribution & Poisson Process

Slides:



Advertisements
Similar presentations
Order Statistics The order statistics of a set of random variables X1, X2,…, Xn are the same random variables arranged in increasing order. Denote by X(1)
Advertisements

Exponential Distribution
Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Chapter 3 Some Special Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
Exponential and Poisson Chapter 5 Material. 2 Poisson Distribution [Discrete] Poisson distribution describes many random processes quite well and is mathematically.
Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Exponential Distribution. = mean interval between consequent events = rate = mean number of counts in the unit interval > 0 X = distance between events.
Chapter 5 Statistical Models in Simulation
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
Probability and Statistics with Reliability, Queuing and Computer Science Applications: Chapter 6 on Stochastic Processes Kishor S. Trivedi Visiting Professor.
Stochastic Processes Dr. Nur Aini Masruroh. Stochastic process X(t) is the state of the process (measurable characteristic of interest) at time t the.
Computer Systems Modelling Sam Haines Clare College, University of Cambridge 1 st March 2015.
Engineering Probability and Statistics - SE-205 -Chap 4 By S. O. Duffuaa.
1 Review of Probability Theory [Source: Stanford University]
15. Poisson Processes In Lecture 4, we introduced Poisson arrivals as the limiting behavior of Binomial random variables. (Refer to Poisson approximation.
Probability theory 2011 Outline of lecture 7 The Poisson process  Definitions  Restarted Poisson processes  Conditioning in Poisson processes  Thinning.
Some standard univariate probability distributions
Continuous Random Variables and Probability Distributions
Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 4 Continuous Random Variables and Probability Distributions.
Lecture 4 Mathematical and Statistical Models in Simulation.
Some standard univariate probability distributions
Chapter 21 Random Variables Discrete: Bernoulli, Binomial, Geometric, Poisson Continuous: Uniform, Exponential, Gamma, Normal Expectation & Variance, Joint.
Introduction to Stochastic Models GSLM 54100
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,
Chapter 4. Continuous Probability Distributions
1 Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process and compound P.P.’s.
1 Performance Evaluation of Computer Systems By Behzad Akbari Tarbiat Modares University Spring 2009 Introduction to Probabilities: Discrete Random Variables.
The Poisson Process. A stochastic process { N ( t ), t ≥ 0} is said to be a counting process if N ( t ) represents the total number of “events” that occur.
Exponential and Chi-Square Random Variables
Week 41 Continuous Probability Spaces Ω is not countable. Outcomes can be any real number or part of an interval of R, e.g. heights, weights and lifetimes.
Andy Guo 1 Handout Ch5(2) 實習. Andy Guo 2 Normal Distribution There are three reasons why normal distribution is important –Mathematical properties of.
ST3236: Stochastic Process Tutorial 10
Generalized Semi-Markov Processes (GSMP)
Chapter 5 Statistical Models in Simulation
Tch-prob1 Chap 3. Random Variables The outcome of a random experiment need not be a number. However, we are usually interested in some measurement or numeric.
Intro. to Stochastic Processes
Some standard univariate probability distributions Characteristic function, moment generating function, cumulant generating functions Discrete distribution.
Stochastic Models Lecture 2 Poisson Processes
Modeling and Analysis of Computer Networks
1 Birth and death process N(t) Depends on how fast arrivals or departures occur Objective N(t) = # of customers at time t. λ arrivals (births) departures.
STA347 - week 31 Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5’s in the 6 rolls. Let X = number of.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
Chapter 01 Probability and Stochastic Processes References: Wolff, Stochastic Modeling and the Theory of Queues, Chapter 1 Altiok, Performance Analysis.
School of Information Technologies Poisson-1 The Poisson Process Poisson process, rate parameter e.g. packets/second Three equivalent viewpoints of the.
CDA6530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
Stochastic Processes1 CPSC : Stochastic Processes Instructor: Anirban Mahanti Reference Book “Computer Systems Performance.
Week 21 Order Statistics The order statistics of a set of random variables X 1, X 2,…, X n are the same random variables arranged in increasing order.
Ver Chapter 5 Continuous Random Variables 1 Probability/Ch5.
Chapter 4 Continuous Random Variables and Probability Distributions  Probability Density Functions.2 - Cumulative Distribution Functions and E Expected.
Copyright © Cengage Learning. All rights reserved. 4 Continuous Random Variables and Probability Distributions.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
Renewal Theory Definitions, Limit Theorems, Renewal Reward Processes, Alternating Renewal Processes, Age and Excess Life Distributions, Inspection Paradox.
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,
Probability Distributions: a review
Chapter 4 Continuous Random Variables and Probability Distributions
Engineering Probability and Statistics - SE-205 -Chap 4
The Exponential and Gamma Distributions
Exponential Distribution & Poisson Process
The Poisson Process.
Basic Modeling Components
Pertemuan ke-7 s/d ke-10 (minggu ke-4 dan ke-5)
The Bernoulli distribution
EXPONENTIAL RANDOM VARIABLES AND POISSON PROCESSES
Multinomial Distribution
CPSC 531: System Modeling and Simulation
Dept. of Electrical & Computer engineering
Poisson Process and Related Distributions
Presentation transcript:

Exponential Distribution & Poisson Process Memorylessness & other exponential distribution properties; Poisson process; Nonhomogeneous & compound P.P.’s Chapter 5

Exponential Distribution: Basic Facts Density CDF MGF Mean Variance Coefficient of variation Chapter 5

Key Property: Memorylessness 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 Chapter 5

Other Useful Properties Sum of n independent exponential r.v.’s with common parameter l has a gamma distribution w/parameters (n, l) Competing Exponentials: If X1 and X2 are independent exponential r.v.’s with parameters l1 and l2, resp., then (generalizes to any number of competing r.v.’s) Minimum of exponentials: If X1, X2 , …, Xn are independent exponential r.v.’s where Xn has parameter li, then min(X1, X2 , …, Xn) is exponential w/parameter l1 + l2 + … + ln Chapter 5

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: N(t)  0 N(t) is an integer for all t If s < t, then N(s)  N(t) For s < t, N(t) - N(s) is the number of events that occur in the interval (s, t]. Chapter 5

Stationary & Independent Increments A counting process has independent increments if, for any That is, the numbers of events that occur in nonoverlapping intervals are independent random variables. 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. Chapter 5

Poisson Process Definition 1 A counting process {N(t), t  0} is a Poisson process with rate l, l > 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 lt (therefore, it has stationary increments), i.e., Chapter 5

Poisson Process Definition 2 A function f is said to be o(h) (“Little oh of h”) if A counting process {N(t), t  0} is a Poisson process with rate l, l > 0, if N(0) = 0 The process has stationary and independent increments Definitions 1 and 2 are equivalent! Chapter 5

Interarrival and Waiting Times The times between arrivals T1, T2, … are independent exponential r.v.’s with mean 1/l: The (total) waiting time until the nth event has a gamma dist’n: S1 S2 S3 S4 t T1 T2 T3 T4 Chapter 5

Other Poisson Process Properties Poisson Splitting: Suppose {N(t), t  0} is a P.P. with rate l, and suppose that each time an event occurs, it is classified as type I with probability p and type II with probability 1-p, independently of all other events. Let N1(t) and N2(t), respectively, be the number of type I and type II events up to time t. Then {N1(t), t  0} and {N2(t), t  0} are independent Poisson processes with respective rates lp and l(1-p). Chapter 5

Other Poisson Process Properties Competing Poisson Processes: Suppose {N1(t), t  0} and {N2(t), t  0} are independent Poisson processes with respective rates l1 and l2. Let Sni be the time of the nth event of process i, i = 1,2. Chapter 5

Other Poisson Process Properties If Y1, Y2, …, Yn are random variables, then Y(1), Y(2), …, Y(n) are their order statistics if Y(k) is the kth smallest value among Y1, Y2, …, Yn, k = 1, …, n. Conditional Distribution of Arrival Times: Suppose {N(t), t  0} is a Poisson process with rate l and for some time t we know that N(t) = n. Then the arrival times S1, S2, …, Sn have the same conditional distribution as the order statistics of n independent uniform random variables on (0, t). Chapter 5

Nonhomogeneous Poisson Process A counting process {N(t), t  0} is a nonhomogeneous Poisson process with intensity function l(t), t  0, if: N(0) = 0 The process has independent increments (not stationary incr.) Let Then Chapter 5

Compound Poisson Process A counting process {X(t), t  0} is a compound Poisson process if: where {N(t), t  0} is a Poisson process and {Yi, i = 1, 2, …} are independent, identically distributed r.v.’s that are independent of {N(t), t  0}. By conditioning on N(t), we can obtain: Chapter 5