# POISSON PROCESSES. Chapter Introduction Arrival processes

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Chater 2 POISSON PROCESSES 2.1 Introduction A Poisson rocess is a simle and widely used stochastic rocess for modeling the times at which arrivals enter a system. It is in many ways the continuous-time version of the Bernoulli rocess. Section characterized the Bernoulli rocess by a sequence of IID binary random variables (rv s), Y 1, Y 2,... where Y i = 1 indicates an arrival at increment i and Y i = 0 otherwise. We observed (without any careful roof) that the rocess could also be characterized by a sequence of geometrically distributed interarrival times. For the Poisson rocess, arrivals may occur at arbitrary ositive times, and the robability of an arrival at any articular instant is 0. This means that there is no very clean way of describing a Poisson rocess in terms of the robability of an arrival at any given instant. It is more convenient to define a Poisson rocess in terms of the sequence of interarrival times, X 1, X 2,..., which are defined to be IID. Before doing this, we describe arrival rocesses in a little more generality Arrival rocesses An arrival rocess is a sequence of increasing rv s, 0 < S 1 < S 2 <, where S i < S i+1 means that S i+1 S i is a ositive rv, i.e., a rv X such that F X (0) = 0. The rv s S 1, S 2,... are called arrival eochs 1 and reresent the successive times at which some random reeating henomenon occurs. Note that the rocess starts at time 0 and that multile arrivals can t occur simultaneously (the henomenon of bulk arrivals can be handled by the simle extension of associating a ositive integer rv to each arrival). We will sometimes ermit simultaneous arrivals or arrivals at time 0 as events of zero robability, but these can be ignored. In order to fully secify the rocess by the sequence S 1, S 2,... of rv s, it is necessary to secify the joint distribution of the subsequences S 1,..., S n for all n > 1. Although we refer to these rocesses as arrival rocesses, they could equally well model deartures from a system, or any other sequence of incidents. Although it is quite common, 1 Eoch is a synonym for time. We use it here to avoid overusing the word time in overlaing ways. 74

2 2.1. INTRODUCTION 75 esecially in the simulation field, to refer to incidents or arrivals as events, we shall avoid that here. The nth arrival eoch S n is a rv and {S n ale t}, for examle, is an event. This would make it confusing to refer to the nth arrival itself as an event. r X 3 - r X 2-6N(t) r N(t) = n for S n ale t < S n+1 X 1 - t 0 S 1 S 2 S 3 Figure 2.1: A samle function of an arrival rocess and its arrival eochs {S 1, S 2,... }, its interarrival timess {X 1, X 2,... }, and its counting rocess {N(t); t > 0} As illustrated in Figure 2.1, any arrival rocess {S n ; n 1} can also be secified by either of two alternative stochastic rocesses. The first alternative is the sequence of interarrival times, {X i ; i 1}. The X i here are ositive rv s defined in terms of the arrival eochs by X 1 = S 1 and X i = S i S i 1 for i > 1. Similarly, each arrival eoch S n is secified by {X i ; i 1} as S n = X n i=1 X i. (2.1) Thus the joint distribution of X 1,..., X n for all n > 1 is su cient (in rincile) to secify the arrival rocess. Since the interarrival times are IID in most cases of interest, it is usually simler to secify the joint distribution of the X i than of the S i. The second alternative is the counting rocess {N(t); t > 0}, where for each t > 0, the rv N(t) is the aggregate number of arrivals 2 u to and including time t. The counting rocess {N(t); t > 0}, illustrated in Figure 2.1, is an uncountably infinite family of rv s where the counting rv N(t), for each t > 0, is the aggregate number of arrivals in the interval (0, t], i.e., the number of arrivals in the set { : 0 < ale t}. By convention, a arenthesis is used to indicate that the corresonding end oint of an interval is not contained in the interval and a bracket is used if it is. Thus, as another examle, (a, b) = { : a < < b}. The rv N(0) is defined to be 0 with robability 1, which means that we are considering only arrivals at strictly ositive times. The counting rocess {N(t); t > 0} for any arrival rocess has the roerty that N( ) N(t) for all t > 0 (i.e., N( ) N(t) is a nonnegative random variable for t > 0). For any given integer n 1 and time t > 0, the nth arrival eoch, S n, and the counting random variable, N(t), are related by {S n ale t} = {N(t) n}. (2.2) 2 Thus, for the Bernoulli rocess with an increment size of 1, N(n) is the rv denoted as S n in Section

3 76 CHAPTER 2. POISSON PROCESSES To see this, note that {S n ale t} is the event that the nth arrival occurs at some eoch ale t. This event imlies that N( ) = n, and thus that {N(t) n}. Similarly, {N(t) = m} for some m n imlies {S m ale t}, and thus that {S n ale t}. This equation is essentially obvious from Figure 2.1, but is one of those eculiar obvious things that is often di cult to see. An alternate form, which is occasionally more transarent, comes from taking the comlement of both sides of (2.2), getting {S n > t} = {N(t) < n}. (2.3) For examle, the event {S 1 > t} means that the first arrival occurs after t, which means {N(t) < 1} (i.e., {N(t) = 0}). These relations will be used constantly in going back and forth between arrival eochs and counting rv s. In rincile, (2.2) or (2.3) can be used to secify joint CDF of arrival eochs in terms of joint CDF s of counting variables and vice versa, so either characterization can be used to secify an arrival rocess. In summary, then, an arrival rocess can be secified by the joint distributions of the arrival eochs, or of the interarrival times, or of the counting rv s. In rincile, secifying any one of these secifies the others also Definition and roerties of a Poisson rocess The nicest, and in many ways most imortant, arrival rocesses are those for which the interarrival times are IID. These arrival rocesses are called renewal rocesses and form the subject of Chater 5. Poisson rocesses are the nicest, and in many ways most imortant, class of renewal rocesses. They are characterized by having exonentially distributed interarrival times. We will soon see why these exonentially distributed interarrival times simlify these rocesses and make it ossible to look at them in so many simle ways. We start by being exlicit about the definitions of renewal and Poisson rocesses. Definition A renewal rocess is an arrival rocess for which the sequence of interarrival times is a sequence of ositive IID rv s. Definition A Poisson rocess is a renewal rocess in which the interarrival times have an exonential CDF; i.e., for some real > 0, each X i has the density 4 f X (x) = ex( x) for x 0. The arameter is called the rate of the rocess. We shall see later that for any interval of size t, t is the exected number of arrivals in that interval, giving some interretation to denoting as a rate. 3 By definition, a stochastic rocess is a collection of rv s, so one might ask whether an arrival rocess (as a stochastic rocess) is really the arrival-eoch rocess {S n; n 1 or the interarrival rocess X i; i > 0} or the counting rocess {N(t); t > 0}. The arrival-eoch rocess comes to gris with the actual arrivals, the interarrival rocess is often the simlest, and the counting rocess looks most like a stochastic rocess in time since N(t) is a rv for each t 0. It seems referable, since the descritions are so clearly equivalent, to view arrival rocesses in terms of whichever descrition is most convenient. 4 With this density, Pr{X i>0} = 1, so that we can regard X i as a ositive random variable. Since events of robability zero can be ignored, the density ex( x) for x 0 and zero for x < 0 is e ectively the same as the density ex( x) for x > 0 and zero for x ale 0.

4 2.2. DEFINITION AND PROPERTIES OF A POISSON PROCESS Memoryless roerty What makes the Poisson rocess unique among renewal rocesses is the memoryless roerty of the exonential distribution. Definition Memoryless random variables: A rv X ossesses the memoryless roerty if X is a ositive rv (i.e., Pr{X > 0} = 1) for which Pr{X > t + x} = Pr{X > x} Pr{X > t} for all x, t 0. (2.4) Note that (2.4) is a statement about the comlementary CDF of X. There is no intimation that the event {X > t+x} in the equation has any articular relation to the events {X > t} or {X > x}. For an exonential rv X of rate > 0, Pr{X > x} = e x for x 0. This satisfies (2.4) for all x 0, t 0, so X is memoryless. Conversely, an arbitrary rv X is memoryless only if it is exonential. To see this, let h(x) = ln[pr{x > x}] and observe that since Pr{X > x} is non-increasing in x, h(x) is also. In addition, (2.4) says that h(t + x) = h(x) + h(t) for all x, t 0. These two statements (see Exercise 2.6) imly that h(x) must be linear in x, and Pr{X > x} must be exonential in x. Since a memoryless rv X must be exonential, there must be some > 0 such that Pr{X > t} = e t > 0 for all t 0. Since Pr{X > t} > 0, we can rewrite (2.4) as Pr{X > t + x X > t} = Pr{X > x}. (2.5) If X is interreted as the waiting time until some given arrival, then (2.5) states that, given that the arrival has not occured by time t, the distribution of the remaining waiting time (given by x on the left side of (2.5)) is the same as the original waiting time distribution (given on the right side of (2.5)), i.e., the remaining waiting time has no memory of revious waiting. Examle Suose X is the waiting time, starting at time 0, for a bus to arrive, and suose X is memoryless. After waiting from 0 to t, the distribution of the remaining waiting time from t is the same as the original distribution starting from 0. The still waiting customer is, in a sense, no better o at time t than at time 0. On the other hand, if the bus is known to arrive regularly every 16 minutes, then it will certainly arrive within a minute for a erson who has already waited 15 minutes. Thus regular arrivals are not memoryless. The oosite situation is also ossible. If the bus frequently breaks down, then a 15 minute wait can indicate that the remaining wait is robably very long, so again X is not memoryless. We study these non-memoryless situations when we study renewal rocesses in Chater 5. Although memoryless distributions must be exonential, it can be seen that if the definition of memoryless is restricted to integer times, then the geometric distribution becomes memoryless, and it can be seen as before that this is the only memoryless integer-time distribution. In this resect, the Bernoulli rocess (which has geometric interarrival times)

5 78 CHAPTER 2. POISSON PROCESSES is like a discrete-time version of the Poisson rocess (which has exonential interarrival times). We now use the memoryless roerty of exonential rv s to find the distribution of the first arrival in a Poisson rocess after an arbitrary given time t > 0. We not only find this distribution, but also show that this first arrival after t is indeendent of all arrivals u to and including t. More recisely, we rove the following theorem. Theorem For a Poisson rocess of rate, and any given t > 0, the length of the interval from t until the first arrival after t is a nonnegative rv Z with the CDF 1 ex[ z] for z 0. This rv is indeendent of both N(t) and of the N(t) arrival eochs before time t. It is also indeendent of the set of rv s {N( ); ale t}. The basic idea behind this theorem is that Z, conditional on the eoch of the last arrival before t, is simly the remaining time until the next arrival. Since the interarrival time starting at is exonential and thus memoryless, Z is indeendent of ale t, and of all earlier arrivals. The following roof carries this idea out in detail. Z - X 1 - X 2-0 t S 1 S 2 Figure 2.2: For arbitrary fixed t > 0, consider the event {N(t) = 0}. Conditional on this event, Z is the distance from t to S 1 ; i.e., Z = X 1 t. Proof: Let Z be the interval from t until the first arrival after t. We first condition on N(t) = 0 (see Figure 2.2). Given N(t) = 0, we see that X 1 > t and Z = X 1 t. Thus, Pr{Z > z N(t)=0} = Pr{X 1 > z + t N(t)=0} = Pr{X 1 > z + t X 1 > t} (2.6) = Pr{X 1 > z} = e z. (2.7) In (2.6), we used the fact that {N(t) = 0} = {X 1 > t}, which is clear from Figure 2.1 (and also from (2.3)). In (2.7) we used the memoryless condition in (2.5) and the fact that X 1 is exonential. Next consider the conditions that N(t) = n (for arbitrary n > 1) and S n = (for arbitrary ale t). The argument here is basically the same as that with N(t) = 0, with a few extra details (see Figure 2.3). Conditional on N(t) = n and S n =, the first arrival after t is the first arrival after the arrival at S n, i.e., Z = z corresonds to X n+1 = z + (t ). Pr{Z > z N(t)=n, S n = } = Pr{X n+1 > z+t N(t)=n, S n = } (2.8) = Pr{X n+1 > z+t X n+1 >t, S n = } (2.9) = Pr{X n+1 > z+t X n+1 >t } (2.10) = Pr{X n+1 > z} = e z, (2.11)

6 2.2. DEFINITION AND PROPERTIES OF A POISSON PROCESS 79 X 3 - N(t) X 2-6 Z - X 1 - t 0 S 1 S 2 S 3 Figure 2.3: Given N(t) = 2, and S 2 =, X 3 is equal to Z + (t {N(t)=2, S 2 = } is the same as the event {S 2 =, X 3 >t }. ). Also, the event where (2.9) follows because, given S n = ale t, we have {N(t) = n} = {X n+1 > t } (see Figure 2.3). Eq. (2.10) follows because X n+1 is indeendent of S n. Eq. (2.11) follows from the memoryless condition in (2.5) and the fact that X n+1 is exonential. The same argument alies if, in (2.8), we condition not only on S n but also on S 1,..., S n 1. Since this is equivalent to conditioning on N( ) for all in (0, t], we have Pr{Z > z {N( ), 0 < ale t}} = ex( z). (2.12) Next consider the sequence of interarrival times starting from a given time t. The first of these is taken to be the rv Z (now renamed Z 1 ) of the time from t to the first arrival eoch after t. For m 2, let Z m be the time from the (m 1)st arrival after t to the mth arrival eoch after t. Thus, given N(t) = n and S n =, we see that Z m = X m+n for m 2. It follows that, conditional on N(t) = n and S n =, Z 1, Z 2,..., are IID exonentially distributed rv s. (see Exercise 2.8). Since this is indeendent of N(t) and S n, it follows that that Z 1, Z 2,... are unconditionally IID and also indeendent of N(t) and S n. It should also be clear that Z 1, Z 2,... are indeendent of {N( ); 0 < ale t}. The above argument shows that the ortion of a Poisson rocess starting at an arbitrary time t > 0 is a robabilistic relica of the rocess starting at 0; that is, the time until the first arrival after t is an exonentially distributed rv with arameter, and all subsequent interarrival times are indeendent of this first arrival eoch and of each other, and all have the same exonential distribution. Definition A counting rocess {N(t); t > 0} has the stationary increment roerty if N(t 0 ) N(t) has the same CDF as N(t 0 t) for every t 0 > t > 0. Let us define N(t, e t 0 ) = N(t 0 ) N(t) as the number of arrivals in the interval (t, t 0 ] for any given t 0 t. We have just shown that for a Poisson rocess, the rv N(t, e t 0 ) has the same distribution as N(t 0 t), which means that a Poisson rocess has the stationary increment roerty. Thus, the distribution of the number of arrivals in an interval deends on the size of the interval but not on its starting oint. Definition A counting rocess {N(t); t > 0} has the indeendent increment roerty if, for every integer k > 0, and every k-tule of times 0 < t 1 < t 2 < < t k, the k-tule of rv s N(t 1 ), N(t1 e, t 2 ),..., N(t e k 1, t k ) are statistically indeendent.

7 80 CHAPTER 2. POISSON PROCESSES For the Poisson rocess, Theorem says that for any t, the time Z 1 until the next arrival after t is indeendent of N( ) for all ale t. Letting t 1 < t 2 < t k 1 < t, this means that Z 1 is indeendent of N(t 1 ), N(t e 1, t 2 ),..., N(t e k 1, t). We have also seen that the subsequent interarrival times after Z 1, and thus N(t, e t 0 ) are indeendent of N(t 1 ), N(t e 1, t 2 ),..., N(t e k 1, t). Renaming t as t k and t 0 as t k+1, we see that N(t e k, t k+1 ) is indeendent of N(t 1 ), N(t e 1, t 2 ),..., N(t e k 1, t k ). Since this is true for all k, the Poisson rocess has the indeendent increment roerty. In summary, we have roved the following: Theorem Poisson rocesses have both the stationary increment and indeendent increment roerties. Note that if we look only at integer times, then the Bernoulli rocess also has the stationary and indeendent increment roerties Probability density of S n and joint density of S 1,..., S n Recall from (2.1) that, for a Poisson rocess, S n is the sum of n IID rv s, each with the density function f X (x) = ex( x), x 0. Also recall that the density of the sum of two indeendent rv s can be found by convolving their densities, and thus the density of S 2 can be found by convolving f X (x) with itself, S 3 by convolving the density of S 2 with f X (x), and so forth. The result, for t 0, is called the Erlang density, 5 f Sn (t) = n t n 1 ex( t). (2.13) (n 1)! We can understand this density (and other related matters) better by viewing the above mechanical derivation in a slightly di erent way involving the joint density of S 1,..., S n. For n = 2, the joint density of X 1 and S 2 (or equivalently, S 1 and S 2 ) is given by f X1 S 2 (x 1, s 2 ) = f X1 (x 1 )f S2 X 1 (s 2 x 1 ) = e x 1 e (s 2 x 1 ) for 0 ale x 1 ale s 2, where, since S 2 = X 1 + X 2, we have used the fact that the density of S 2 conditional on X 1 is just the exonential interarrival density evaluated at S 2 X 1. Thus, f X1 S 2 (x 1, s 2 ) = 2 ex( s 2 ) for 0 ale x 1 ale s 2. (2.14) This says that the joint density does not contain x 1, excet for the constraint 0 ale x 1 ale s 2. Thus, for fixed s 2, the joint density, and thus the conditional density of X 1 given S 2 = s 2 is uniform over 0 ale x 1 ale s 2. The integration over x 1 in the convolution equation is then simly multilication by the interval size s 2, yielding the marginal PDF f S2 (s 2 ) = 2 s 2 ex( s 2 ), in agreement with (2.13) for n = 2. The following theorem shows that this same curious behavior exhibits itself for the sum of an arbitrary number n of IID exonential rv s. 5 Another (somewhat rarely used) name for the Erlang density is the gamma density.

8 2.2. DEFINITION AND PROPERTIES OF A POISSON PROCESS 81 Theorem Let X 1, X 2,... be IID rv s with the density f X (x) = e x for x 0. Let S n = X X n for each n 1. Then for each n 2 f S1 S n (s 1,..., s n ) = n ex( s n ) for 0 ale s 1 ale s 2 ale s n. (2.15) Proof: Relacing X 1 with S 1 in (2.14), we see the theorem holds for n = 2. This serves as the basis for the following inductive roof. Assume (2.15) holds for given n. Then f S1 S n+1 (s 1,..., s n+1 ) = f S1 S n (s 1,..., s n )f Sn+1 S 1 S n (s n+1 s 1,..., s n ) = n ex( s n ) f Sn+1 S 1 S n (s n+1 s 1,..., s n ), (2.16) where we used (2.15) for the given n. Now S n+1 = S n + X n+1. Since X n+1 is indeendent of S 1,..., S n, f Sn+1 S 1 S n (s n+1 s 1,..., s n ) = ex (s n+1 s n ). Substituting this into (2.16) yields (2.15) The interretation here is the same as with S 2. The joint density does not contain any arrival time other than s n, excet for the ordering constraint 0 ale s 1 ale s 2 ale ale s n, and thus this joint density is constant over all choices of arrival times satisfying the ordering constraint for a fixed s n. Mechanically integrating this over s 1, then s 2, etc. we get the Erlang formula (2.13). The Erlang density then is the joint density in (2.15) times the volume s n n 1 /(n 1)! of the region of s 1,..., s n 1 satisfying 0 < s 1 < < s n. This will be discussed further later. Note that (2.15), for all n, secifies the joint distribution for all arrival eochs, and thus fully secifies a Poisson rocess The PMF for N(t) The Poisson counting rocess, {N(t); t > 0} consists of a nonnegative integer rv N(t) for each t > 0. In this section, we show that the PMF for this rv is the well-known Poisson PMF, as stated in the following theorem. We give two roofs for the theorem, each roviding its own tye of understanding and each showing the close relationshi between {N(t) = n} and {S n = t}. Theorem For a Poisson rocess of rate, and for any t > 0, the PMF for N(t), i.e., the number of arrivals in (0, t], is given by the Poisson PMF, N(t) (n) = ( t)n ex( t). (2.17) n! Proof 1: This roof, for given n and t, is based on two ways of calculating Pr{t < S n+1 ale t + } for some vanishingly small. The first way is based on the already known density of S n+1 and gives Pr{t < S n+1 ale t + } = Z t+ t f Sn+1 ( ) d = f Sn+1 (t) ( + o( )).

9 82 CHAPTER 2. POISSON PROCESSES The term o( ) is used to describe a function of that goes to 0 faster than as! 0. More recisely, a function g( ) is said to be of order o( ) if lim!0 g( ) = 0. Thus Pr{t < S n+1 ale t + } = f Sn+1 (t)( + o( )) is simly a consequence of the fact that S n+1 has a continuous robability density in the interval [t, t + ]. The second way to calculate Pr{t < S n+1 ale t + } is to first observe that the robability of more than 1 arrival in (t, t + ] is o( ). Ignoring this ossibility, {t < S n+1 ale t + } occurs if exactly n arrivals are in the interval (0, t] and one arrival occurs in (t, t + ]. Because of the indeendent increment roerty, this is an event of robability N(t) (n)( + o( )). Thus N(t) (n)( + o( )) + o( ) = f Sn+1 (t)( + o( )). Dividing by and taking the limit! 0, we get N(t) (n) = f Sn+1 (t). Using the density for f Sn in (2.13), we get (2.17). Proof 2: The aroach here is to use the fundamental relation that {N(t) Taking the robabilities of these events, 1X N(t) (i) = i=n Z t 0 f Sn ( ) d for all n 1 and t > 0. n} = {S n ale t}. The term on the right above is the CDF of S n and the term on the left is the comlementary CDF of N(t). The comlementary CDF and the PMF of N(t) uniquely secify each other, so the theorem is equivalent to showing that X 1 i=n ( t) i ex( t) i! = Z t 0 f Sn ( ) d. (2.18) If we take the derivative with resect to t of each side of (2.18), we find that almost magically each term excet the first on the left cancels out, leaving us with n t n 1 ex( t) (n 1)! = f Sn (t). Thus the derivative with resect to t of each side of (2.18) is equal to the derivative of the other for all n 1 and t > 0. The two sides of (2.18) are also equal in the limit t! 1, so it follows that (2.18) is satisfied everywhere, comleting the roof Alternate definitions of Poisson rocesses Definition 2 of a Poisson rocess: A Poisson counting rocess {N(t); t > 0} is a counting rocess that satisfies (2.17) (i.e., has the Poisson PMF) and has the indeendent and stationary increment roerties. We have seen that the roerties in Definition 2 are satisfied starting with Definition 1 (using IID exonential interarrival times), so Definition 1 imlies Definition 2. Exercise

10 2.2. DEFINITION AND PROPERTIES OF A POISSON PROCESS shows that IID exonential interarrival times are imlied by Definition 2, so the two definitions are equivalent. It may be somewhat surrising at first to realize that a counting rocess that has the Poisson PMF at each t is not necessarily a Poisson rocess, and that the indeendent and stationary increment roerties are also necessary. One way to see this is to recall that the Poisson PMF for all t in a counting rocess is equivalent to the Erlang density for the successive arrival eochs. Secifying the robability density for S 1, S 2,... as Erlang secifies the marginal densities of S 1, S 2,... but need not secify the joint densities of these rv s. Figure 2.4 illustrates this in terms of the joint density of S 1, S 2, given as f S1 S 2 (s 1, s 2 ) = 2 ex( s 2 ) for 0 ale s 1 ale s 2 and 0 elsewhere. The figure illustrates how the joint density can be changed without changing the marginals. s 1 0 f S1S2 (s 1s 2 ) > 0 ) s 2 q Figure 2.4: The joint density of S 1, S 2 is non-zero in the region shown. It can be changed, while holding the marginals constant, by reducing the joint density by in the uer left and lower right squares above and increasing it by in the uer right and lower left squares. There is a similar e ect with the Bernoulli rocess in that a discrete counting rocess for which the number of arrivals from 0 to t, for each integer t, is a binomial rv, but the rocess is not Bernoulli. This is exlored in Exercise 2.5. The next definition of a Poisson rocess is based on its incremental roerties. Consider the number of arrivals in some very small interval (t, t + ]. Since N(t, e t + ) has the same distribution as N( ), we can use (2.17) to get n o Pr en(t, t + ) = 0 = e 1 + o( ) n o Pr en(t, t + ) = 1 = e + o( ) n o Pr en(t, t + ) 2 o( ). (2.19) Definition 3 of a Poisson rocess: A Poisson counting rocess is a counting rocess that satisfies (2.19) and has the stationary and indeendent increment roerties. We have seen that Definition 1 imlies Definition 3. The essence of the argument the other way is that for any interarrival interval X, F X (x+ ) F X (x) is the robability of an arrival

11 84 CHAPTER 2. POISSON PROCESSES in an aroriate infinitesimal interval of width, which by (2.19) is +o( ). Turning this into a di erential equation (see Exercise 2.7), we get the desired exonential interarrival intervals. Definition 3 has an intuitive aeal, since it is based on the idea of indeendent arrivals during arbitrary disjoint intervals. It has the disadvantage that one must do a considerable amount of work to be sure that these conditions are mutually consistent, and robably the easiest way is to start with Definition 1 and derive these roerties. Showing that there is a unique rocess that satisfies the conditions of Definition 3 is even harder, but is not necessary at this oint, since all we need is the use of these roerties. Section will illustrate better how to use this definition (or more recisely, how to use (2.19)). What (2.19) accomlishes in Definition 3, beyond the assumtion of indeendent and stationary increments, is the revention of bulk arrivals. For examle, consider a counting rocess in which arrivals always occur in airs, and the intervals between successive airs aren IID and exonentially o distributed n with arameter o (see Figure 2.5). For this rocess, Pr en(t, t + )=1 = 0, and Pr en(t, t+ )=2 = + o( ), thus violating (2.19). This rocess has stationary and indeendent increments, however, since the rocess formed by viewing a air of arrivals as a single incident is a Poisson rocess. N(t) 4 2 X 1-1 X S 1 S 2 Figure 2.5: A counting rocess modeling bulk arrivals. X 1 is the time until the first air of arrivals and X 2 is the interval between the first and second air of arrivals The Poisson rocess as a limit of shrinking Bernoulli rocesses The intuition of Definition 3 can be achieved in a less abstract way by starting with the Bernoulli rocess, which has the roerties of Definition 3 in a discrete-time sense. We then go to an aroriate limit of a sequence of these rocesses, and find that this sequence of Bernoulli rocesses converges in some sense to the Poisson rocess. Recall that a Bernoulli rocess is an IID sequence, Y 1, Y 2,... of binary random variables for which Y (1) = and Y (0) = 1. We can visualize Y i = 1 as an arrival at time i and Y i = 0 as no arrival, but we can also shrink the time scale of the rocess so that for some integer j > 0, Y i is an arrival or no arrival at time i2 j. We consider a sequence indexed by j of such shrinking Bernoulli rocesses, and in order to kee the arrival rate constant, we let = 2 j for the jth rocess. Thus for each unit increase in j, the Bernoulli rocess shrinks by relacing each slot with two slots, each with half the revious arrival robability. The exected number of arrivals er unit time is then, matching the Poisson rocess that

12 2.2. DEFINITION AND PROPERTIES OF A POISSON PROCESS 85 we are aroximating. If we look at this jth rocess relative to Definition 3 of a Poisson rocess, we see that for these regularly saced increments of size = 2 j, the robability of one arrival in an increment is and that of no arrival is 1, and thus (2.19) is satisfied, and in fact the o( ) terms are exactly zero. For arbitrary sized increments, it is clear that disjoint increments have essentially indeendent arrivals. The increments are not quite stationary, since, for examle, an increment of size 2 j 1 might contain a time that is a multile of 2 j or might not, deending on its lacement. However, for any fixed increment of size, the number of multiles of 2 j (i.e., the number of ossible arrival oints) is either b 2 j c or 1 + b 2 j c. Thus in the limit j! 1, the increments are both stationary and indeendent. For each j, the jth Bernoulli rocess has an associated Bernoulli counting rocess N j (t) = P bt2 j c i=1 Y i. This is the number of arrivals u to time t and is a discrete rv with the binomial PMF. That is, Nj (t)(n) = bt2j c n n (1 ) bt2j c n where = 2 j. We now show that this PMF aroaches the Poisson PMF as j increases. 6 Theorem (Poisson s theorem). Consider the sequence of shrinking Bernoulli rocesses with arrival robability 2 j and time-slot size 2 j. Then for every fixed time t > 0 and fixed number of arrivals n, the counting PMF Nj (t)(n) aroaches the Poisson PMF (of the same ) with increasing j, i.e., lim N j!1 j (t)(n) = N(t) (n). (2.20) Proof: We first rewrite the binomial PMF, for bt2 j c variables with = 2 j as bt2 j lim c 2 j n N j!1 j (t)(n) = lim j!1 n 1 2 j ex[bt2 j c ln(1 2 j )] bt2 j c 2 j n = lim j!1 n 1 2 j ex( t) (2.21) = lim j!1 bt2 j c bt2 j 1c bt2 j n+1c n! 2 j 1 2 j n ex( t) (2.22) = ( t)n ex( t). (2.23) n! We used ln(1 2 j ) = 2 j + o(2 j ) in (2.21) and exanded the combinatorial term in (2.22). In (2.23), we recognized that lim j!1 bt2 j ic 2 j = t for 0 ale i ale n j Since the binomial PMF (scaled as above) has the Poisson PMF as a limit for each n, the CDF of N j (t) also converges to the Poisson CDF for each t. In other words, for each t > 0, the counting random variables N j (t) of the Bernoulli rocesses converge in distribution to N(t) of the Poisson rocess. 6 This limiting result for the binomial distribution is very di erent from the asymtotic results in Chater 1 for the binomial. Here the arameter of the binomial is shrinking with increasing j, whereas there, is constant while the number of variables is increasing.

13 86 CHAPTER 2. POISSON PROCESSES This does not say that the Bernoulli counting rocesses converge to the Poisson counting rocess in any meaningful sense, since the joint distributions are also of concern. The following corollary treats this. Corollary For any finite integer k > 0, let 0 < t 1 < t 2 < < t k be any set of time instants. Then the joint CDF of N j (t 1 ), N j (t 2 ),... N j (t k ) aroaches the joint CDF of N(t 1 ), N(t 2 ),... N(t k ) as j! 1. Proof: We can rewrite the joint PMF for each Bernoulli rocess as Nj (t 1 ),...,N j (t k )(n 1,..., n k ) = Nj (t 1 ),Ñj(t 1,t 2 ),...,Ñj(t k 1,t k ) (n 1, n 2 n 1,..., n k n k 1 ) = Nj (t 1 )(n 1 ) ky `=2 Ñj (t`,t` 1 ) (n` n` 1 ) (2.24) where we have used the indeendent increment roerty for the Bernoulli rocess. For the Poisson rocess, we similarly have N(t1 ),...,N(t k )(n 1,... n k ) = N(t1 )(n 1 ) ky `=2 Ñ(t`,t` 1 ) (n` n` 1 ) (2.25) Taking the limit of (2.24) as j! 1, we recognize from Theorem that each term of (2.24) goes to the corresonding term in (2.25). For the Ñ rv s, this requires a trivial generalization in Theorem to deal with the arbitrary starting time. We conclude from this that the sequence of Bernoulli rocesses above converges to the Poisson rocess in the sense of the corollary. Recall from Section that there are a number of ways in which a sequence of rv s can converge. As one might imagine, there are many more ways in which a sequence of stochastic rocesses can converge, and the corollary simly establishes one of these. Note however that showing only that Nj (t)(n) aroaches N(t) (n) for each t is too weak to be very helful, because it shows nothing about the timeevolution of the rocess. On the other hand, we don t even know how to define a joint distribution over an infinite number of eochs, let alone deal with limiting characteristics. Considering arbitrary finite sets of eochs forms a good middle ground. Both the Poisson rocess and the Bernoulli rocess are so easy to analyze that the convergence of shrinking Bernoulli rocesses to Poisson is rarely the easiest way to establish roerties about either. On the other hand, this convergence is a owerful aid to the intuition in understanding each rocess. In other words, the relation between Bernoulli and Poisson is very useful in suggesting new ways of looking at roblems, but is usually not the best way to analyze those roblems. 2.3 Combining and slitting Poisson rocesses Suose that {N 1 (t); t > 0} and {N 2 (t); t > 0} are indeendent Poisson counting rocesses 7 of rates 1 and 2 resectively. We want to look at the sum rocess where N(t) = N 1 (t) + 7 Two rocesses {N 1(t); t > 0} and {N 2(t); t > 0} are said to be indeendent if for all ositive integers k and all sets of times 0 < t 1 < t 2 < < t k, the random variables N 1(t 1),..., N 1(t k ) are indeendent

14 2.3. COMBINING AND SPLITTING POISSON PROCESSES 87 N 2 (t) for all t 0. In other words, {N(t); t > 0} is the rocess consisting of all arrivals to both rocess 1 and rocess 2. We shall show that {N(t); t > 0} is a Poisson counting rocess of rate = We show this in three di erent ways, first using Definition 3 of a Poisson rocess (since that is most natural for this roblem), then using Definition 2, and finally Definition 1. We then draw some conclusions about the way in which each aroach is helful. Since {N 1 (t); t > 0} and {N 2 (t); t > 0} are indeendent and both ossess the stationary and indeendent increment roerties, it follows from the definitions that {N(t); t > 0} also ossesses the stationary and indeendent increment roerties. Using the aroximations in (2.19) for the individual rocesses, we see that n o o o Pr en(t, t + ) = 0 = Prn en1 (t, t + ) = 0 Prn en2 (t, t + ) = 0 = (1 1 )(1 2 ) 1. n o where has been droed. In the same way, Pr en(t, t+ ) = 1 is aroximated by n o and Pr en(t, t + ) 2 is aroximated by 0, both with errors roortional to 2. It follows that {N(t); t > 0} is a Poisson rocess. In the second aroach, we have N(t) = N 1 (t) + N 2 (t). Since N(t), for any given t, is the sum of two indeendent Poisson rv s, it is also a Poisson rv with mean t = 1 t + 2 t. If the reader is not aware that the sum of two indeendent Poisson rv s is Poisson, it can be derived by discrete convolution of the two PMF s (see Exercise 1.22). More elegantly, one can observe that we have already imlicitly shown this fact. That is, if we break an interval I into disjoint subintervals, I 1 and I 2, then the number of arrivals in I (which is Poisson) is the sum of the number of arrivals in I 1 and in I 2 (which are indeendent Poisson). Finally, since N(t) is Poisson for each t, and since the stationary and indeendent increment roerties are satisfied, {N(t); t > 0} is a Poisson rocess. In the third aroach, X 1, the first interarrival interval for the sum rocess, is the minimum of X 11, the first interarrival interval for the first rocess, and X 21, the first interarrival interval for the second rocess. Thus X 1 > t if and only if both X 11 and X 21 exceed t, so Pr{X 1 > t} = Pr{X 11 > t} Pr{X 21 > t} = ex( 1t 2t) = ex( t). Using the memoryless roerty, each subsequent interarrival interval can be analyzed in the same way. The first aroach above was the most intuitive for this roblem, but it required constant care about the order of magnitude of the terms being neglected. The second aroach was the simlest analytically (after recognizing that sums of indeendent Poisson rv s are Poisson), and required no aroximations. The third aroach was very simle in retrosect, but not very natural for this roblem. If we add many indeendent Poisson rocesses together, it is clear, by adding them one at a time, that the sum rocess is again Poisson. What is more interesting is that when many indeendent counting rocesses (not necessarily Poisson) are added together, the sum rocess often tends to be aroximately Poisson if of N 2(t 1),..., N 2(t k ). Here it is enough to extend the indeendent increment roerty to indeendence between increments over the two rocesses; equivalently, one can require the interarrival intervals for one rocess to be indeendent of the interarrivals for the other rocess.

15 88 CHAPTER 2. POISSON PROCESSES the individual rocesses have small rates comared to the sum. To obtain some crude intuition about why this might be exected, note that the interarrival intervals for each rocess (assuming no bulk arrivals) will tend to be large relative to the mean interarrival interval for the sum rocess. Thus arrivals that are close together in time will tyically come from di erent rocesses. The number of arrivals in an interval large relative to the combined mean interarrival interval, but small relative to the individual interarrival intervals, will be the sum of the number of arrivals from the di erent rocesses; each of these is 0 with large robability and 1 with small robability, so the sum will be aroximately Poisson Subdividing a Poisson rocess Next we look at how to break {N(t); t > 0}, a Poisson counting rocess of rate, into two rocesses, {N 1 (t); t > 0} and {N 2 (t); t > 0}. Suose that each arrival in {N(t); t > 0} is sent to the first rocess with robability and to the second rocess with robability 1 (see Figure 2.6). Each arrival is switched indeendently of each other arrival and indeendently of the arrival eochs. It may be helful to visualize this as the combination of two indeendent rocesses. The first is the Poisson rocess of rate and the second is a Bernoulli rocess {X n ; n 1} where Xn (1) = and Xn (2) = 1. The nth arrival of the Poisson rocess is, with robability, labeled as a tye 1 arrival i.e., labeled as X n = 1. With robability 1, it is labeled as tye 2, i.e., labeled as X n = 2. We shall show that the resulting rocesses are each Poisson, with rates 1 = and 2 = (1 ) resectively, and that furthermore the two rocesses are indeendent. Note that, conditional on the original rocess, the two new rocesses are not indeendent; in fact one comletely determines the other. Thus this indeendence might be a little surrising. N(t) rate - HHHH 1 H N 1 (t) rate 1 = N 2 (t) rate 2 = (1 ) - - Figure 2.6: Each arrival is indeendently sent to rocess 1 with robability and to rocess 2 otherwise. First consider a small increment (t, t + ]. The original rocess has an arrival in this incremental interval with robability (ignoring 2 terms as usual), and thus rocess 1 has an arrival with robability and rocess 2 with robability (1 ). Because of the indeendent increment roerty of the original rocess and the indeendence of the division of each arrival between the two rocesses, the new rocesses each have the indeendent increment roerty, and from above have the stationary increment roerty. Thus each rocess is Poisson. Note now that we cannot verify that the two rocesses are indeendent from this small increment model. We would have to show that the number of arrivals for rocess 1 and 2 are indeendent over (t, t + ]. Unfortunately, leaving out the terms of order 2, there is at most one arrival to the original rocess and no ossibility of

16 2.3. COMBINING AND SPLITTING POISSON PROCESSES 89 an arrival to each new rocess in (t, t + ]. If it is imossible for both rocesses to have an arrival in the same interval, they cannot be indeendent. It is ossible, of course, for each rocess to have an arrival in the same interval, but this is a term of order 2. Thus, without aying attention to the terms of order 2, it is imossible to demonstrate that the rocesses are indeendent. To demonstrate that rocess 1 and 2 are indeendent, we first calculate the joint PMF for N 1 (t), N 2 (t) for arbitrary t. Conditioning on a given number of arrivals N(t) for the original rocess, we have Pr{N 1 (t)=m, N 2 (t)=k N(t)=m+k} = (m + k)! m (1 ) k. (2.26) m!k! Equation (2.26) is simly the binomial distribution, since, given m + k arrivals to the original rocess, each indeendently goes to rocess 1 with robability. Since the event {N 1 (t) = m, N 2 (t) = k} is a subset of the conditioning event above, Pr{N 1 (t)=m, N 2 (t)=k N(t)=m+k} = Pr{N 1(t)=m, N 2 (t)=k}. Pr{N(t)=m+k} Combining this with (2.26), we have Pr{N 1 (t)=m, N 2 (t)=k} = (m + k)! m!k! m (1 ) k ( t)m+k e t. (2.27) (m + k)! Rearranging terms, we get Pr{N 1 (t)=m, N 2 (t)=k} = ( t)m e m! t [(1 ) t] k e (1 )t. (2.28) k! This shows that N 1 (t) and N 2 (t) are indeendent. To show that the rocesses are indeendent, we must show that for any k > 1 and any set of times 0 ale t 1 ale t 2 ale ale t k, the sets {N 1 (t i ); 1 ale i ale k} and {N 2 (t j ); 1 ale j ale k} are indeendent of each other. It is equivalent to show that the sets { e N 1 (t i 1, t i ); 1 ale i ale k} and { e N 2 (t j 1, t j ); 1 ale j ale k} (where t 0 is 0) are indeendent. The argument above shows this indeendence for i = j, and for i 6= j, the indeendence follows from the indeendent increment roerty of {N(t); t > 0} Examles using indeendent Poisson rocesses We have observed that if the arrivals of a Poisson rocess are slit into two new arrival rocesses, with each arrival of the original rocess indeendently entering the first of the new rocesses with some fixed robability, then each new rocess is Poisson and indeendent of the other. The most useful consequence of this is that any two indeendent Poisson rocesses can be viewed as being generated from a single rocess in this way. Thus, if one rocess has rate 1 and the other has rate 2, they can be viewed as coming from a rocess of rate Each arrival to the combined rocess is then labeled as a first-rocess arrival with robability = 1 /( ) and as a second-rocess arrival with robability 1.

17 90 CHAPTER 2. POISSON PROCESSES Examle The above oint of view is very useful for finding robabilities such as Pr{S 1k < S 2j } where S 1k is the eoch of the kth arrival to the first rocess and S 2j is the eoch of the jth arrival to the second rocess. The roblem can be rehrased in terms of a combined rocess to ask: out of the first k + j 1 arrivals to the combined rocess, what is the robability that k or more of them are switched to the first rocess? (Note that if k or more of the first k + j 1 go to the first rocess, at most j 1 go to the second, so the kth arrival to the first recedes the jth arrival to the second; similarly if fewer than k of the first k + j 1 go to the first rocess, then the jth arrival to the second rocess recedes the kth arrival to the first). Since each of these first k + j 1 arrivals are switched indeendently with the same robability, the answer is Pr{S 1k < S 2j } = X k+j 1 i=k (k + j 1)! i!(k + j 1 i)! i (1 ) k+j 1 i. (2.29) Examle (The M/M/1 queue). Queueing theorists use a standard notation of characters searated by slashes to describe common tyes of queueing systems. The first character describes the arrival rocess to the queue. M stands for memoryless and means a Poisson arrival rocess; D stands for deterministic and means that the interarrival interval is fixed and non-random; G stands for general interarrival distribution. We assume that the interarrival intervals are IID (thus making the arrival rocess a renewal rocess), but many authors use GI to exlicitly indicate IID interarrivals. The second character describes the service rocess. The same letters are used, with M indicating exonentially distributed service times. The third character gives the number of servers. 8 It is assumed, when this notation is used, that the service times are IID, indeendent of the arrival eochs, and indeendent of which server is used. Consider an M/M/1 queue, i.e., a queueing system with a Poisson arrival system (say of rate ) and a single server that serves arriving customers in order with a service time distribution F(y) = 1 ex[ µy]. The service times are indeendent of each other and of the interarrival intervals. During any eriod when the server is busy, customers then leave the system according to a Poisson rocess (rocess 2) of rate µ. We then see that if j or more customers are waiting at a given time, then (2.29) gives the robability that the kth subsequent arrival comes before the jth dearture. Examle (The sum of geometrically many exonential rv s). Consider waiting for a taxi on a busy street during rush hour. We will model the eochs at which taxis ass our sot on the street as a Poisson rocess of rate. We assume that each taxi is indeendently emty (i.e., will sto to ick us u) with robability. The emty taxis then form a Poisson rocess of rate and our waiting time is exonential with arameter. Looked at slightly di erently, we will be icked by the first taxi with robability, by the second with robability (1 ), and in general, by the mth taxi with robability (1 ) m 1. In other words, the number of the taxi that icks us u (numbered in order of arrival) is a geometricly distributed rv, say M, and our waiting time is the sum of the first M interarrival times, i.e., S M. 8 Sometimes a fourth character is added which gives the size of the queue lus service facility. Thus, for examle, an M/M/m/m queueing system would have Poisson arrivals, m indeendent servers, each with exonential service time. If an arrival occurs when all servers are busy, then that arrival is droed.

18 2.4. NON-HOMOGENEOUS POISSON PROCESSES 91 As illustrated by taxis, waiting times modeled by a geometric sum of exonentials are relatively common. An imortant examle that we shall analyze in Chater 7 is that of the service time distribution of an M/M/1 queue in steady state (i.e., after the e ect of the initially emty queue has disaeared). We will show there that the number M of customers in the system immediately after an arrival is geometric with the PMF Pr{M = m} = ( /µ) m 1 (1 /µ) for m 1. Now the time that the new arrival sends in the system is the sum of M service times, each of which is exonential with arameter µ. These service times are indeendent of each other and of M. Thus the system time (the time in queue and in service) of the new arrival is exonential with arameter µ(1 /µ) = µ. 2.4 Non-homogeneous Poisson rocesses The Poisson rocess, as we defined it, is characterized by a constant arrival rate. It is often useful to consider a more general tye of rocess in which the arrival rate varies as a function of time. A non-homogeneous Poisson rocess with time varying arrival rate (t) is defined 9 as a counting rocess {N(t); t > 0} which has the indeendent increment roerty and, for all t 0, > 0, also satisfies: n o Pr en(t, t + ) = 0 n o Pr en(t, t + ) = 1 n o Pr en(t, t + ) 2 = 1 (t) + o( ) = (t) + o( ) = o( ). (2.30) where N(t, e t + ) = N(t + ) N(t). The non-homogeneous Poisson rocess does not have the stationary increment roerty. One common alication occurs in otical communication where a non-homogeneous Poisson rocess is often used to model the stream of hotons from an otical modulator; the modulation is accomlished by varying the hoton intensity (t). We shall see another alication shortly in the next examle. Sometimes a Poisson rocess, as we defined it earlier, is called a homogeneous Poisson rocess. We can use a shrinking Bernoulli rocess again to aroximate a non-homogeneous Poisson rocess. To see how to do this, assume that (t) is bounded away from zero. We artition the time axis into increments whose lengths vary inversely with (t), thus holding the robability of an arrival in an increment at some fixed value = (t). Thus, 9 We assume that (t) is right continuous, i.e., that for each t, (t) is the limit of (t+ ) as aroaches 0 from above. This allows (t) to contain discontinuities, as illustrated in Figure 2.7, but follows the convention that the value of the function at the discontinuity is the limiting value from the right. This convention is required in (2.30) to talk about the distribution of arrivals just to the right of time t.

19 92 CHAPTER 2. POISSON PROCESSES temorarily ignoring the variation of (t) within an increment, Pr en t, t + = 0 = 1 + o() (t) Pr en t, t + = 1 = + o() (t) Pr en t, t + 2 = o(). (2.31) (t) This artition is defined more recisely by defining m(t) as m(t) = Then the ith increment ends at that t for which m(t) = i. r Z t t ( )d. (2.32) Figure 2.7: Partitioning the time axis into increments each with an exected number of arrivals equal to. Each rectangle or traezoid above has the same area, which ensures that the ith artition ends where m(t) = i. As before, let {Y i ; i 1} be a sequence of IID binary rv s with Pr{Y i = 1} = and Pr{Y i = 0} = 1. Consider the counting rocess {N(t); t > 0} in which Y i, for each i 1, denotes the number of arrivals in the interval (t i 1, t i ], where t i satisfies m(t i ) = i. Thus, N(t i ) = Y 1 + Y Y i. If is decreased as 2 j, each increment is successively slit into a air of increments. Thus by the same argument as in (2.23), Pr{N(t) = n} = [1 + o()][m(t)]n ex[ n! Similarly, for any interval (t, ], taking em(t, ) = R t some k, i, we get n o Pr en(t, ) = n m(t)]. (2.33) (u)du, and taking t = t k, = t i for = [1 + o()][ em(t, )]n ex[ em(t, )]. (2.34) n! Going to the limit! 0, the counting rocess {N(t); t > 0} above aroaches the nonhomogeneous Poisson rocess under consideration, and we have the following theorem: Theorem For a non-homogeneous Poisson rocess with right-continuous arrival rate (t) bounded away from zero, the distribution of N(t, e ), the number of arrivals in (t, ], satisfies n o Pr en(t, ) = n = [ em(t, )]n ex[ em(t, )] n! where em(t, ) = Z t (u) du. (2.35)

20 2.4. NON-HOMOGENEOUS POISSON PROCESSES 93 Hence, one can view a non-homogeneous Poisson rocess as a (homogeneous) Poisson rocess over a non-linear time scale. That is, let {N (s); s 0} be a (homogeneous) Poisson rocess with rate 1. The non-homogeneous Poisson rocess is then given by N(t) = N (m(t)) for each t. Examle (The M/G/1 Queue). Using the queueing notation exlained in Examle 2.3.2, an M/G/1 queue indicates a queue with Poisson arrivals, a general service distribution, and an infinite number of servers. Since the M/G/1 queue has an infinite number of servers, no arriving customers are ever queued. Each arrival immediately starts to be served by some server, and the service time Y i of customer i is IID over i with some given CDF G(y); the service time is the interval from start to comletion of service and is also indeendent of arrival eochs. We would like to find the CDF of the number of customers being served at a given eoch. Let {N(t); t > 0} be the Poisson counting rocess, at rate, of customer arrivals. Consider the arrival times of those customers that are still in service at some fixed time. In some arbitrarily small interval (t, t+ ], the robability of an arrival is +o( ) and the robability of 2 or more arrivals is negligible (i.e., o( )). The robability that a customer arrives in (t, t + ] and is still being served at time > t is then [1 G( t)] + o( ). Consider a counting rocess {N 1 (t); 0<tale } where N 1 (t) is the number of arrivals between 0 and t that are still in service at. This counting rocess has the indeendent increment roerty. To see this, note that the overall arrivals in {N(t); t > 0} have the indeendent increment roerty; also the arrivals in {N(t); t > 0} have indeendent service times, and thus are indeendently in or not in {N 1 (t); 0 < t ale }. It follows that {N 1 (t); 0 < t ale } is a non-homogeneous Poisson rocess with rate [1 G( t)] at time t ale. The exected number of arrivals still in service at time is then m( ) = Z t=0 [1 G( t)] dt = Z t=0 [1 G(t)] dt. (2.36) and the PMF of the number in service at time is given by Pr{N 1 ( ) = n} = m( )n ex( n! m( )). (2.37) Note that as! 1, the integral in (2.36) aroaches the mean of the service time distribution (i.e., it is the integral of the comlementary CDF, 1 G(t), of the service time). This means that in steady state (as! 1), the distribution of the number in service at deends on the service time distribution only through its mean. This examle can be used to model situations such as the number of hone calls taking lace at a given eoch. This requires arrivals of new calls to be modeled as a Poisson rocess and the holding time of each call to be modeled as a random variable indeendent of other holding times and of call arrival times. Finally, as shown in Figure 2.8, we can regard {N 1 (t); 0<t ale } as a slitting of the arrival rocess {N(t); t>0}. By the same tye of argument as in Section 2.3, the number of customers who have comleted service by time is indeendent of the number still in service.

### 6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks

6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In

### 1 Gambler s Ruin Problem

Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of \$i and then on each successive gamble either wins

### 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

### Fourier Analysis of Stochastic Processes

Fourier Analysis of Stochastic Processes. Time series Given a discrete time rocess ( n ) nz, with n :! R or n :! C 8n Z, we de ne time series a realization of the rocess, that is to say a series (x n )

### Monitoring Frequency of Change By Li Qin

Monitoring Frequency of Change By Li Qin Abstract Control charts are widely used in rocess monitoring roblems. This aer gives a brief review of control charts for monitoring a roortion and some initial

### (This result should be familiar, since if the probability to remain in a state is 1 p, then the average number of steps to leave the state is

How many coin flis on average does it take to get n consecutive heads? 1 The rocess of fliing n consecutive heads can be described by a Markov chain in which the states corresond to the number of consecutive

### Large Sample Theory. Consider a sequence of random variables Z 1, Z 2,..., Z n. Convergence in probability: Z n

Large Samle Theory In statistics, we are interested in the roerties of articular random variables (or estimators ), which are functions of our data. In ymtotic analysis, we focus on describing the roerties

### The Online Freeze-tag Problem

The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,

### ChE 120B Lumped Parameter Models for Heat Transfer and the Blot Number

ChE 0B Lumed Parameter Models for Heat Transfer and the Blot Number Imagine a slab that has one dimension, of thickness d, that is much smaller than the other two dimensions; we also assume that the slab

### PRIME NUMBERS AND THE RIEMANN HYPOTHESIS

PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.

### Point Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)

Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint

### Pinhole Optics. OBJECTIVES To study the formation of an image without use of a lens.

Pinhole Otics Science, at bottom, is really anti-intellectual. It always distrusts ure reason and demands the roduction of the objective fact. H. L. Mencken (1880-1956) OBJECTIVES To study the formation

### Loglikelihood and Confidence Intervals

Stat 504, Lecture 3 Stat 504, Lecture 3 2 Review (contd.): Loglikelihood and Confidence Intervals The likelihood of the samle is the joint PDF (or PMF) L(θ) = f(x,.., x n; θ) = ny f(x i; θ) i= Review:

### Introduction to NP-Completeness Written and copyright c by Jie Wang 1

91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of

### Computational Finance The Martingale Measure and Pricing of Derivatives

1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet

### The fast Fourier transform method for the valuation of European style options in-the-money (ITM), at-the-money (ATM) and out-of-the-money (OTM)

Comutational and Alied Mathematics Journal 15; 1(1: 1-6 Published online January, 15 (htt://www.aascit.org/ournal/cam he fast Fourier transform method for the valuation of Euroean style otions in-the-money

### Risk in Revenue Management and Dynamic Pricing

OPERATIONS RESEARCH Vol. 56, No. 2, March Aril 2008,. 326 343 issn 0030-364X eissn 1526-5463 08 5602 0326 informs doi 10.1287/ore.1070.0438 2008 INFORMS Risk in Revenue Management and Dynamic Pricing Yuri

### Confidence Intervals for Capture-Recapture Data With Matching

Confidence Intervals for Cature-Recature Data With Matching Executive summary Cature-recature data is often used to estimate oulations The classical alication for animal oulations is to take two samles

### An important observation in supply chain management, known as the bullwhip effect,

Quantifying the Bullwhi Effect in a Simle Suly Chain: The Imact of Forecasting, Lead Times, and Information Frank Chen Zvi Drezner Jennifer K. Ryan David Simchi-Levi Decision Sciences Deartment, National

### TRANSCENDENTAL NUMBERS

TRANSCENDENTAL NUMBERS JEREMY BOOHER. Introduction The Greeks tried unsuccessfully to square the circle with a comass and straightedge. In the 9th century, Lindemann showed that this is imossible by demonstrating

### Assignment 9; Due Friday, March 17

Assignment 9; Due Friday, March 17 24.4b: A icture of this set is shown below. Note that the set only contains oints on the lines; internal oints are missing. Below are choices for U and V. Notice that

### A Modified Measure of Covert Network Performance

A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy

### Chapter 3. Special Techniques for Calculating Potentials. r ( r ' )dt ' ( ) 2

Chater 3. Secial Techniues for Calculating Potentials Given a stationary charge distribution r( r ) we can, in rincile, calculate the electric field: E ( r ) Ú Dˆ r Dr r ( r ' )dt ' 2 where Dr r '-r. This

### 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

### Effect Sizes Based on Means

CHAPTER 4 Effect Sizes Based on Means Introduction Raw (unstardized) mean difference D Stardized mean difference, d g Resonse ratios INTRODUCTION When the studies reort means stard deviations, the referred

### Risk and Return. Sample chapter. e r t u i o p a s d f CHAPTER CONTENTS LEARNING OBJECTIVES. Chapter 7

Chater 7 Risk and Return LEARNING OBJECTIVES After studying this chater you should be able to: e r t u i o a s d f understand how return and risk are defined and measured understand the concet of risk

### 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

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

### SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q. 1. Quadratic Extensions

SOME PROPERTIES OF EXTENSIONS OF SMALL DEGREE OVER Q TREVOR ARNOLD Abstract This aer demonstrates a few characteristics of finite extensions of small degree over the rational numbers Q It comrises attemts

### Math 5330 Spring Notes Prime Numbers

Math 5330 Sring 206 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating

### Population Genetics I

Poulation Genetics I The material resented here considers a single diloid genetic locus, ith to alleles A and a; their relative frequencies in the oulation ill be denoted as and q (ith q 1 ). Hardy-Weinberg

### Multiperiod Portfolio Optimization with General Transaction Costs

Multieriod Portfolio Otimization with General Transaction Costs Victor DeMiguel Deartment of Management Science and Oerations, London Business School, London NW1 4SA, UK, avmiguel@london.edu Xiaoling Mei

### 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

### On Multicast Capacity and Delay in Cognitive Radio Mobile Ad-hoc Networks

On Multicast Caacity and Delay in Cognitive Radio Mobile Ad-hoc Networks Jinbei Zhang, Yixuan Li, Zhuotao Liu, Fan Wu, Feng Yang, Xinbing Wang Det of Electronic Engineering Det of Comuter Science and Engineering

### 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)

### Lecture Notes: Discrete Mathematics

Lecture Notes: Discrete Mathematics GMU Math 125-001 Sring 2007 Alexei V Samsonovich Any theoretical consideration, no matter how fundamental it is, inevitably relies on key rimary notions that are acceted

### where a, b, c, and d are constants with a 0, and x is measured in radians. (π radians =

Introduction to Modeling 3.6-1 3.6 Sine and Cosine Functions The general form of a sine or cosine function is given by: f (x) = asin (bx + c) + d and f(x) = acos(bx + c) + d where a, b, c, and d are constants

### 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

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

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

### Stat 134 Fall 2011: Gambler s ruin

Stat 134 Fall 2011: Gambler s ruin Michael Lugo Setember 12, 2011 In class today I talked about the roblem of gambler s ruin but there wasn t enough time to do it roerly. I fear I may have confused some

### Four Derivations of the Black-Scholes Formula by Fabrice Douglas Rouah www.frouah.com www.volopta.com

Four Derivations of the Black-Scholes Formula by Fabrice Douglas Rouah www.frouah.com www.volota.com In this note we derive in four searate ways the well-known result of Black and Scholes that under certain

### X How to Schedule a Cascade in an Arbitrary Graph

X How to Schedule a Cascade in an Arbitrary Grah Flavio Chierichetti, Cornell University Jon Kleinberg, Cornell University Alessandro Panconesi, Saienza University When individuals in a social network

### C-Bus Voltage Calculation

D E S I G N E R N O T E S C-Bus Voltage Calculation Designer note number: 3-12-1256 Designer: Darren Snodgrass Contact Person: Darren Snodgrass Aroved: Date: Synosis: The guidelines used by installers

### Simple thermodynamic systems

Simle thermodynamic systems Asaf Pe er 1 October 30, 2013 1. Different statements of the second law We have seen that Clausius defined the second law as the entroy of an isolated system cannot decrease

### Stochastic Derivation of an Integral Equation for Probability Generating Functions

Journal of Informatics and Mathematical Sciences Volume 5 (2013), Number 3,. 157 163 RGN Publications htt://www.rgnublications.com Stochastic Derivation of an Integral Equation for Probability Generating

### 1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

### HOMEWORK (due Fri, Nov 19): Chapter 12: #62, 83, 101

Today: Section 2.2, Lesson 3: What can go wrong with hyothesis testing Section 2.4: Hyothesis tests for difference in two roortions ANNOUNCEMENTS: No discussion today. Check your grades on eee and notify

### Module 5: Multiple Random Variables. Lecture 1: Joint Probability Distribution

Module 5: Multile Random Variables Lecture 1: Joint Probabilit Distribution 1. Introduction irst lecture o this module resents the joint distribution unctions o multile (both discrete and continuous) random

### Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields. Tom Weston

Lectures on the Dirichlet Class Number Formula for Imaginary Quadratic Fields Tom Weston Contents Introduction 4 Chater 1. Comlex lattices and infinite sums of Legendre symbols 5 1. Comlex lattices 5

### FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES

FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES AVNER ASH, LAURA BELTIS, ROBERT GROSS, AND WARREN SINNOTT Abstract. We consider statistical roerties of the sequence of ordered airs obtained by taking

### Beyond the F Test: Effect Size Confidence Intervals and Tests of Close Fit in the Analysis of Variance and Contrast Analysis

Psychological Methods 004, Vol. 9, No., 164 18 Coyright 004 by the American Psychological Association 108-989X/04/\$1.00 DOI: 10.1037/108-989X.9..164 Beyond the F Test: Effect Size Confidence Intervals

### Variations on the Gambler s Ruin Problem

Variations on the Gambler s Ruin Problem Mat Willmott December 6, 2002 Abstract. This aer covers the history and solution to the Gambler s Ruin Problem, and then exlores the odds for each layer to win

### 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

### A Simple Model of Pricing, Markups and Market. Power Under Demand Fluctuations

A Simle Model of Pricing, Markus and Market Power Under Demand Fluctuations Stanley S. Reynolds Deartment of Economics; University of Arizona; Tucson, AZ 85721 Bart J. Wilson Economic Science Laboratory;

### 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

### An Analysis of Reliable Classifiers through ROC Isometrics

An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit

### c 2009 Je rey A. Miron 3. Examples: Linear Demand Curves and Monopoly

Lecture 0: Monooly. c 009 Je rey A. Miron Outline. Introduction. Maximizing Pro ts. Examles: Linear Demand Curves and Monooly. The Ine ciency of Monooly. The Deadweight Loss of Monooly. Price Discrimination.

### Large-Scale IP Traceback in High-Speed Internet: Practical Techniques and Theoretical Foundation

Large-Scale IP Traceback in High-Seed Internet: Practical Techniques and Theoretical Foundation Jun Li Minho Sung Jun (Jim) Xu College of Comuting Georgia Institute of Technology {junli,mhsung,jx}@cc.gatech.edu

### Local Connectivity Tests to Identify Wormholes in Wireless Networks

Local Connectivity Tests to Identify Wormholes in Wireless Networks Xiaomeng Ban Comuter Science Stony Brook University xban@cs.sunysb.edu Rik Sarkar Comuter Science Freie Universität Berlin sarkar@inf.fu-berlin.de

### Machine Learning with Operational Costs

Journal of Machine Learning Research 14 (2013) 1989-2028 Submitted 12/11; Revised 8/12; Published 7/13 Machine Learning with Oerational Costs Theja Tulabandhula Deartment of Electrical Engineering and

### Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

### Precalculus Prerequisites a.k.a. Chapter 0. August 16, 2013

Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, Ph.D. Lakeland Community College Jeff Zeager, Ph.D. Lorain County Community College August 6, 0 Table of Contents 0 Prerequisites 0. Basic Set

### 3. Renewal Theory. Definition 3 of the Poisson process can be generalized: Let X 1, X 2,..., iidf(x) be non-negative interarrival times.

3. Renewal Theory Definition 3 of the Poisson process can be generalized: Let X 1, X 2,..., iidf(x) be non-negative interarrival times. Set S n = n i=1 X i and N(t) = max {n : S n t}. Then {N(t)} is a

### The Magnus-Derek Game

The Magnus-Derek Game Z. Nedev S. Muthukrishnan Abstract We introduce a new combinatorial game between two layers: Magnus and Derek. Initially, a token is laced at osition 0 on a round table with n ositions.

### SECTION 6: FIBER BUNDLES

SECTION 6: FIBER BUNDLES In this section we will introduce the interesting class o ibrations given by iber bundles. Fiber bundles lay an imortant role in many geometric contexts. For examle, the Grassmaniann

### PARAMETER CHOICE IN BANACH SPACE REGULARIZATION UNDER VARIATIONAL INEQUALITIES

PARAMETER CHOICE IN BANACH SPACE REGULARIZATION UNDER VARIATIONAL INEQUALITIES BERND HOFMANN AND PETER MATHÉ Abstract. The authors study arameter choice strategies for Tikhonov regularization of nonlinear

### Supplement to Call Centers with Delay Information: Models and Insights

Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290

### 1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as

### Large firms and heterogeneity: the structure of trade and industry under oligopoly

Large firms and heterogeneity: the structure of trade and industry under oligooly Eddy Bekkers University of Linz Joseh Francois University of Linz & CEPR (London) ABSTRACT: We develo a model of trade

### 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

### ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS

ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science

### IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 4, APRIL 2011 757. Load-Balancing Spectrum Decision for Cognitive Radio Networks

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 29, NO. 4, APRIL 20 757 Load-Balancing Sectrum Decision for Cognitive Radio Networks Li-Chun Wang, Fellow, IEEE, Chung-Wei Wang, Student Member, IEEE,

### As we have seen, there is a close connection between Legendre symbols of the form

Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In

### Failure Behavior Analysis for Reliable Distributed Embedded Systems

Failure Behavior Analysis for Reliable Distributed Embedded Systems Mario Tra, Bernd Schürmann, Torsten Tetteroo {tra schuerma tetteroo}@informatik.uni-kl.de Deartment of Comuter Science, University of

### The Geometric Series

The Geometric Series Professor Jeff Stuart Pacific Lutheran University c 8 The Geometric Series Finite Number of Summands The geometric series is a sum in which each summand is obtained as a common multiple

### 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

### NOISE ANALYSIS OF NIKON D40 DIGITAL STILL CAMERA

NOISE ANALYSIS OF NIKON D40 DIGITAL STILL CAMERA F. Mojžíš, J. Švihlík Detartment of Comuting and Control Engineering, ICT Prague Abstract This aer is devoted to statistical analysis of Nikon D40 digital

### Memory management. Chapter 4: Memory Management. Memory hierarchy. In an ideal world. Basic memory management. Fixed partitions: multiple programs

Memory management Chater : Memory Management Part : Mechanisms for Managing Memory asic management Swaing Virtual Page relacement algorithms Modeling age relacement algorithms Design issues for aging systems

### Approximate Guarding of Monotone and Rectilinear Polygons

Aroximate Guarding of Monotone and Rectilinear Polygons Erik Krohn Bengt J. Nilsson Abstract We show that vertex guarding a monotone olygon is NP-hard and construct a constant factor aroximation algorithm

### 5. Convergence of sequences of random variables

5. Convergence of sequences of random variables Throughout this chapter we assume that {X, X 2,...} is a sequence of r.v. and X is a r.v., and all of them are defined on the same probability space (Ω,

### A MOST PROBABLE POINT-BASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION

9 th ASCE Secialty Conference on Probabilistic Mechanics and Structural Reliability PMC2004 Abstract A MOST PROBABLE POINT-BASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### Solution Using the geometric series a/(1 r) = x=1. x=1. Problem For each of the following distributions, compute

Math 472 Homework Assignment 1 Problem 1.9.2. Let p(x) 1/2 x, x 1, 2, 3,..., zero elsewhere, be the pmf of the random variable X. Find the mgf, the mean, and the variance of X. Solution 1.9.2. Using the

### 4 Perceptron Learning Rule

Percetron Learning Rule Objectives Objectives - Theory and Examles - Learning Rules - Percetron Architecture -3 Single-Neuron Percetron -5 Multile-Neuron Percetron -8 Percetron Learning Rule -8 Test Problem

### A 60,000 DIGIT PRIME NUMBER OF THE FORM x 2 + x Introduction Stark-Heegner Theorem. Let d > 0 be a square-free integer then Q( d) has

A 60,000 DIGIT PRIME NUMBER OF THE FORM x + x + 4. Introduction.. Euler s olynomial. Euler observed that f(x) = x + x + 4 takes on rime values for 0 x 39. Even after this oint f(x) takes on a high frequency

### A joint initiative of Ludwig-Maximilians University s Center for Economic Studies and the Ifo Institute for Economic Research

A joint initiative of Ludwig-Maximilians University s Center for Economic Studies and the Ifo Institute for Economic Research Area Conference on Alied Microeconomics - 2 March 20 CESifo Conference Centre,

### Softmax Model as Generalization upon Logistic Discrimination Suffers from Overfitting

Journal of Data Science 12(2014),563-574 Softmax Model as Generalization uon Logistic Discrimination Suffers from Overfitting F. Mohammadi Basatini 1 and Rahim Chiniardaz 2 1 Deartment of Statistics, Shoushtar

### Two-resource stochastic capacity planning employing a Bayesian methodology

Journal of the Oerational Research Society (23) 54, 1198 128 r 23 Oerational Research Society Ltd. All rights reserved. 16-5682/3 \$25. www.algrave-journals.com/jors Two-resource stochastic caacity lanning

### Complex Conjugation and Polynomial Factorization

Comlex Conjugation and Polynomial Factorization Dave L. Renfro Summer 2004 Central Michigan University I. The Remainder Theorem Let P (x) be a olynomial with comlex coe cients 1 and r be a comlex number.

### Coin ToGa: A Coin-Tossing Game

Coin ToGa: A Coin-Tossing Game Osvaldo Marrero and Paul C Pasles Osvaldo Marrero OsvaldoMarrero@villanovaedu studied mathematics at the University of Miami, and biometry and statistics at Yale University

### 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

### Characterizing and Modeling Network Traffic Variability

Characterizing and Modeling etwork Traffic Variability Sarat Pothuri, David W. Petr, Sohel Khan Information and Telecommunication Technology Center Electrical Engineering and Comuter Science Deartment,

### Analysis of a Production/Inventory System with Multiple Retailers

Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University

### United Arab Emirates University College of Sciences Department of Mathematical Sciences HOMEWORK 1 SOLUTION. Section 10.1 Vectors in the Plane

United Arab Emirates University College of Sciences Deartment of Mathematical Sciences HOMEWORK 1 SOLUTION Section 10.1 Vectors in the Plane Calculus II for Engineering MATH 110 SECTION 0 CRN 510 :00 :00

### Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Wald s Identity by Jeffery Hein Dartmouth College, Math 100 1. Introduction Given random variables X 1, X 2, X 3,... with common finite mean and a stopping rule τ which may depend upon the given sequence,

### An inventory control system for spare parts at a refinery: An empirical comparison of different reorder point methods

An inventory control system for sare arts at a refinery: An emirical comarison of different reorder oint methods Eric Porras a*, Rommert Dekker b a Instituto Tecnológico y de Estudios Sueriores de Monterrey,

### Price Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W

Price Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W The rice elasticity of demand (which is often shortened to demand elasticity) is defined to be the

### Measuring relative phase between two waveforms using an oscilloscope

Measuring relative hase between two waveforms using an oscilloscoe Overview There are a number of ways to measure the hase difference between two voltage waveforms using an oscilloscoe. This document covers