1. The Poisson Process

2. 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 by time t (i.e., in the time interval [0, t ]). Counting Processes

3. 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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Counting Processes

4. 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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Example 2: N ( t ) is the number of individuals born at or prior to time t. An event occurs whenever a child is born. Counting Processes

5. 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 by time t (i.e., in the time interval [0, t ]). Example 1: N ( t ) is the number of customers that enter a store at or prior to time t. An event corresponds to a person entering the store. Example 2: N ( t ) is the number of individuals born at or prior to time t. An event occurs whenever a child is born. Example 3: N ( t ) is the number of calls made to a technical help line at or prior to time t. An event occurs whenever a call is placed. Counting Processes

6. A counting process satisfies the following properties. (i) N ( t ) ≥ 0. (ii) N ( t ) is integer valued. (iii) If s < t, then N ( s ) ≤ N ( t ). (iv) For s < t, N ( t ) – N ( s ) equals the number of events that occurs in the time interval ( s, t ]. Properties of counting processes

7. A counting process is said to possess independent increments if the number of events that occur in disjoint intervals are independent.

8. Example 1: The number of customers N (10) that enter the store in the interval [0, 10] is independent from the number of customers N (15) – N (10) that enter the store in the interval (10, 15] if customers arrive “randomly.”

9. A counting process is said to possess independent increments if the number of events that occur in disjoint intervals are independent. Example 1: The number of customers N (10) that enter the store in the interval [0, 10] is independent from the number of customers N (15) – N (10) that enter the store in the interval (10, 15] if customers arrive “randomly”. Example 2: The number of individuals N(2000)-N(1996) born in the interval [1996, 2000] is not independent from the number of individuals N (2004) – N (2000) born in the interval (2000, 2004].

10. A counting process is said to possess stationary increments if the distribution of the number of events that occur in an interval depend only on the length of the interval and not the starting time of the interval.

11. Example 1: The number of customers N ( t ) – N ( s ) that enter the store in the interval ( s, t ] does not depend on s (this is true if there is not a particular time of day where more customers enter the store).

12. The Poisson processes The counting process { N ( t ) t ≥ 0} is said to be a Poisson process having rate, > 0, if (i) N ( 0 ) = 0. (ii) The process has independent increments. (iii) The number of events in any interval of length t is Poisson distributed with mean t. That is for all s, t ≥ 0

13. The Poisson processes The number of customers that call a help line forms a Poisson process with rate 4 customers per hour. What is the probability that more 10 customers arrive in the first 5 hours? What is the probability that less than 4 customers arrive in the interval (6, 8].

14. The Poisson processes The number of customers that call a help line forms a Poisson process with rate 4 customers per hour. What is the probability that more 10 customers arrive in the first 5 hours? What is the probability that less than 4 customers arrive in the interval (6, 8].

15. The distribution of interarrival times Let T n describe the time that elapses between ( n -1)th event and the n th event for n > 1 and let T 1 be the time of the first event. The sequence { T n, n = 1, 2,...} is called the sequence of interarrival times.

16. The distribution of interarrival times Let T n describe the time that elapses between ( n -1)th event and the n th event for n > 1 and let T 1 be the time of the first event. The sequence { T n, n = 1, 2,...} is called the sequence of interarrival times. Example: if T 1 = 5 and T 2 = 10  the first event arrives at time t = 5 and event 2 occurs at time t = 15.

17. The distribution of interarrival times for a Poisson process P ( T 1 > t ) = P(N(t ) = 0) = e - t  T 1 has the exponential distribution.

18. P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] Since P ( T 2 > t|T 1 = s ) = P (0 events in ( s, s + t ]| T 1 = s ) = P (0 events in ( s, s + t ]) = e - t Then, P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] = e - t  T 2 has the exponential The distribution of interarrival times for a Poisson process

19. P ( T 1 > t ) = P(N(t ) = 0) = e - t  T 1 has the exponential distribution. P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] Since P ( T 2 > t|T 1 = s ) = P (0 events in ( s, s + t ]| T 1 = s ) = P (0 events in ( s, s + t ]) = e - t Then, P ( T 2 > t ) = E[ P ( T 2 > t|T 1 ) ] = e - t  T 2 has the exponential The same applies to other values of n  T n has the exponential distribution. The distribution of interarrival times for a Poisson process

20. Let T n denote the inter-arrival time between the ( n -1)th event and the n th event of a Poisson process, then the T n ( n =1, 2,...) are independent, identically distributed exponential random variables having mean 1/. The distribution of interarrival times for a Poisson process

21. Arrival times Let S n describe the time at which the n th arrival takes place. The sequence { S n, n = 1, 2,...} is called the sequence of arrival times. Example: If T 1 = 5 and T 2 = 10  S 1 = 5 and S 2 = 15.

22. The distribution of arrival times

24. The distribution of arrival times for a Poisson process

25. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

26. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

27. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

28. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

29. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

30. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

31. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

32. Equivalence A counting process with N ( t ) = 0 and exponentially i.i.d. inter- arrival times is a Poisson process.

33. Equivalence

34. Composition of independent Poisson processes Suppose N 1 ( t ) and N 2 ( t ) are independent Poisson process processes with rates 1 and 2. Then the composite process N 1 ( t )+ N 2 ( t ) is also a Poisson process with rates 1 + 2. This follows from the fact that interval arrival times are i.i.d. and exponentially distributed with rate 1 + 2.

35. Random partition of a Poisson distribution Suppose N is a random variable with the Poisson distribution with parameter. Suppose each item is of type i ( i = 1,..., N ) with probability p i. Then N i the number of items of type i has the Poisson distribution with parameter p i, and N i and N j are independent for i ≠ j.

36. Random partition of a Poisson process Suppose N ( t ) is a Poisson process processes with rate. Suppose events can be of different types. The probability that an event is of type i is p i. Then, the number of events of type i N i ( t ) is a Poisson process with rate p i, and and N i ( t ) and N j ( t ) are independent for i ≠ j.