MAS275 Probability Modelling

Size: px
Start display at page:

Download "MAS275 Probability Modelling"

Transcription

1 MAS275 Probability Modellig 6 Poisso processes 6.1 Itroductio Poisso processes are a particularly importat topic i probability theory. The oe-dimesioal Poisso process, which most of this sectio will be about, is a model for the radom times of occurreces of istataeous evets; there are may examples of thigs whose radom occurreces i time ca be modelled by Poisso processes, for example customers arrivig i a queue, icomig calls to a phoe, eruptios of a volcao, ad so o. Higher dimesioal aalogues of the basic Poisso process are also useful as models for radom locatios of objects i space; we will discuss this i sectio 6.9. We will firstly recall some properties of the Poisso distributio before movig oto the defiitio of the process. 6.2 Properties of the Poisso distributio Recall that the Poisso distributio with parameter λ, deoted P o(λ), has probability fuctio p(x) = λx e λ, x = 0, 1, 2, 3,... x! ad a radom variable with P o(λ) distributio has E(X) = Var(X) = λ. Some further properties of the Poisso distributio follow. Propositio 16. The Poisso distributio is additive. More precisely, if X ad Y are idepedet radom variables with distributios P o(λ) ad P o(µ) respectively, the XY has the distributio P o(λµ). 48

2 This property exteds i a obvious way to more tha two idepedet radom variables. Proof. See Exercise 17(b)(i). Propositio 17. The Poisso distributio is a limit of biomial distributios. Specifically, if we cosider the sequece of biomial distributios Bi(, µ/) for fixed µ, the the umber of trials is icreasig but the probability of success o a trial is µ/ which is decreasig i proportio, so that the mea µ remais fixed. I the limit, the distributio is Poisso with parameter µ. Proof. This was show i MAS113, sectio 9.3. The proof is repeated below, but will ot be covered i lectures. To verify this, we look at the probability fuctio of Bi(, µ/) ( ) (µ ) x ( 1 µ ) x ( 1)... ( x 1) µ x = (1 µ x x! x ( = ) ( ) (x 1) µ x... 1 x! 1 µx x! e µ 1 as. This is the probability fuctio of P o(µ). ) ( 1 µ ( 1 µ ) x ) ( 1 µ ) x 6.3 The basic Poisso process We ow move to a cotiuous time scale which is usually regarded as startig at time zero, so that it cosists of the positive real umbers, ad deote our time variable typically by t. Whe we refer to a time iterval, we adopt the covetio that it excludes the left had ed poit but icludes the right had ed-poit, say (u, v] = {t : u < t v}. 49

3 The Poisso process is described i terms of the radom variables N u,v for 0 u v, where N u,v is the umber of occurreces i the time iterval (u, v]. The process has oe parameter, which is a positive umber λ kow as the rate of the process ad which is meat to measure the average or expected umber of occurreces per uit time. The basic Poisso process is the defied by the followig two assumptios: (a). For ay 0 u v, the distributio of N u,v is Poisso with parameter λ(v u). (b). If (u 1, v 1 ], (u 2, v 2 ],..., (u k, v k ] are disjoit time itervals the N u1,v 1, N u2,v 2,..., N uk,v k are idepedet radom variables. Note that by assumptio (a) ad the mea of a Poisso radom variable, N u,v has mea λ(v u), which gives the correct iterpretatio to the rate λ as described above. To show that a process actually exists which satisfies these assumptios still requires a bit of work. At this poit, we ca observe that the special properties of Poisso distributios are importat: if say u < v < w the N u,w = N u,v N v,w ad because all three of these radom variables are to have Poisso distributios, ad the two o the right had side are idepedet, the assumptios ca oly work because of the additivity property of Poisso radom variables. We will see a bit more o justifyig the existece of a process satisfyig the assumptios at the ed of sectio 6.8. We ca also ask about why the assumptio of Poisso distributios might make sese i a modellig cotext. To see this, approximate the cotiuous time scale by dividig (0, t] up ito small itervals, ad assume that there is the same small probability of a occurrece i each, assumig that the probability of more tha oe occurrece i a iterval is egligible. I order to fix the expected umber of occurreces at λt, this probability must be 50

4 set equal to λt/. The the umber of occurreces i the iterval has the biomial distributio Bi(, λt/). As we let ted to ifiity, the small itervals become smaller ad so the approximatio to the cotiuous time scale becomes closer, ad, by the relatioship betwee the Poisso ad Biomial distributios (see Propositio 17) the distributio of the umber of occurreces approaches the Poisso distributio with parameter λt. This suggests the Poisso distributio as a sesible model i the geuiely cotiuous time settig. You might like to thik about which other distributios you have ecoutered might have assumptios similar to (a) ad (b) which work. Figure 1: A simulatio of a Poisso process with rate 1 up to time 10 Example 33. Volcaic eruptios 51

5 6.4 Iter-occurrece times Let T 1 deote the legth of time util the first occurrece, T 2 deote the legth of time betwee the first ad secod occurreces, ad so o, so that T represets the time betwee occurreces 1 ad. These radom variables are called iter-occurrece times. We first show that these caot be zero, ad we will the show which distributio they have. Theorem 18. The probability that i (0, t] two occurreces of a Poisso process with rate λ occur at exactly the same time is zero. Proof. Cosider dividig (0, t] ito small itervals, as i the justificatio of the Poisso model above. Each of these small itervals will be of the form ((i 1)t/, it/] for some i, ad has legth t/, so the umber of occurreces i ay small iterval has a Poisso distributio with parameter λt/. Hece the probability there are at least two occurreces i a give small iterval is 1 e λt λt λt e = 1 e λt ( 1 λt Let Y be the umber of the small itervals which have at least two occurreces. By the idepedece assumptios, Y will have a Biomial distributio: ( ( Y Bi, 1 e λt 1 λt )), ad hece P (Y = 0) = ). ( ( e λt 1 λt )) ( = e λt 1 λt ). As ( 1 λt ) e λt as, we have that P (Y = 0) 1 as. But if there were a probability p > 0 that there were two occurreces at exactly the same time, we would have P (Y = 0) < 1 p for all, so this caot be the case. Hece the probability of there beig two occurreces at exactly the same time is 0. 52

6 Theorem 19. Iter-occurrece times are idepedet of each other, ad are expoetially distributed with parameter λ. Proof. (Sketch) That T 1 has this distributio is straightforward to show. First, P (T 1 t) is the probability that the first occurrece has happeed by time t, so is the probability that there is at least oe occurrece i (0, t]. Hece P (T 1 t) = P (N 0,t 1) = 1 P (N 0,t = 0) = 1 e λt, which is the distributio fuctio of a expoetial distributio with parameter λ. Now cosider the probability that T is at most t, coditioal o the values of T 1, T 2,..., T 1, P (T t T 1 = t 1, T 2 = t 2,..., T 1 = t 1 ). (There are some techical details to deal with the fact that we are coditioig o a evet of probability zero, which is why this proof is a sketch.) Similarly to the above argumet, this is the probability that there is at least oe occurrece betwee times t 1 t 2... t 1 ad t 1 t 2... t 1 t, which agai is 1 e λt. So, regardless of the values take by T 1, T 2,..., T 1, the coditioal distributio of T is expoetial with parameter λ, which implies the result. 6.5 Variable rate Poisso process We ca make the basic Poisso process more flexible ad realistic as a model by allowig the rate of the process to vary with time, λ(t) say. This ca take ito accout, for example, the fact that traffic is heavier at rush hours, the rate of emissio of particles from a radioactive isotope declies with time, ad so o. The oly chage to the defiitio of the Poisso process is that the assumptio (a) is replaced by the followig: 53

7 For ay 0 u v, the distributio of N u,v v u λ(t)dt. is Poisso with parameter This assumptio geeralises that of the costat rate case, ad gives the correct iterpretatio of rate whe this rate is varyig. If λ(t) is a costat we recover the basic Poisso process. Figure 2: A simulatio of a variable rate Poisso process with rate 30/(t 1) up to time 10 The idepedece assumptio (b) still holds whe the rate is variable; this still works because of the additivity property of Poisso radom variables, ad also because of the additivity of itegrals, amely that if u < v < w the w u λ(t)dt = Example 34. arrivals v u λ(t)dt w v λ(t)dt. 54

8 6.6 Superpositio I some situatios we have more tha oe Poisso process ruig. If these are idepedet, the the process formed by combiig them is also a Poisso process. Theorem 20. Let (N u,v ) ad (M u,v ) be idepedet Poisso processes with (possibly variable) rates λ(t) ad µ(t) respectively. The (N u,v M u,v ) also forms a Poisso process, with rate λ(t) µ(t). Proof. Because (N u,v ) ad (M u,v ) are Poisso processes, ( v ) N u,v P o λ(t) dt ad ( v ) M u,v P o µ(t) dt. u Because they are idepedet, the additivity of the Poisso distributio (Propositio 16) tells us that ( v v ) N u,v M u,v P o λ(t) dt µ(t) dt u u ( v ) = P o (λ(t) µ(t)) dt. u The idepedece of the umber of occurreces i disjoit itervals i the combied process follows from the same property of the two origial processes. u 6.7 Markig ad thiig Sometimes the occurreces i a Poisso process may be categorised as each belogig to oe of a umber of types. This is sometimes referred to as 55

9 markig: thik of each occurrece as beig give a radom mark. Specifically we will assume that each occurrece i a Poisso process with (possibly variable) rate λ(t) is give, idepedetly of everythig else, oe of k differet marks with probabilities p 1, p 2,..., p k respectively. Write the total umber of occurreces i (u, v] as N u,v (as before) ad write the umber of occurreces of type i i (u, v] as N (i) u,v. The followig result about Poisso radom variables will be useful. Lemma 21. Let X be a Poisso radom variable with parameter µ, ad imagie that, coditioal o X = x, we have x objects each of which is of oe of k types. Assume further that each of these objects is of type i with probability p i, idepedetly of the other objects. Let the umber of objects of type i be Y i. The (ucoditioal) joit distributio of Y 1, Y 2,..., Y k is such that they are idepedet Poisso, with parameters p 1 µ, p 2 µ,... ad p k µ respectively. Proof. For y 1, y 2,... y k = 0, 1, 2,..., ad lettig x = y 1 y 2... y k, P (Y 1 = y 1, Y 2 = y 2,..., Y k = y k ) = P (X = x)p (Y 1 = y 1, Y 2 = y 2,..., Y k = y k X = x) µ µx x! = e x! y 1!y 2!... y k! py 1 1 p y p y k k as required. = e p 1µ (p 1µ) y 1 e p 2µ (p 2µ) y 2... e p kµ (p kµ) y k y 1! y 2! y k! Theorem 22. For each i, the process give by (N (i) u,v) (coutig the occurreces which are type i) is a Poisso process with rate λ(t)p i, ad the k processes for the differet types are idepedet of each other. Proof. This essetially follows from Lemma 21 together with the idepedece properties of Poisso processes. 56

10 It is eve possible to allow the probabilities of the marks to be depedet o time, say p 1 (t), p 2 (t),..., p k (t). The the geeralised result is that the marked processes are idepedet Poisso processes with variable rates p 1 (t)λ(t), p 2 (t)λ(t),..., p k (t)λ(t) respectively. Oe special case of markig is where k = 2 ad the process of markig cosists of either retaiig the occurrece, with probability p, or deletig it, with probability q = 1 p. The the process of retaied poits is Poisso with rate pλ, ad i this cotext the property is ofte kow as the thiig property. Example 35. Uiversity applicatios 6.8 Coditioig o the umber of occurreces i a iterval Sometimes we kow how may occurreces there are i a give iterval, ad are iterested i how they are distributed withi the iterval. Theorem 23. Assume that we have a Poisso process with costat rate λ. Give that there are occurreces i the time iterval (0, t] say, the positios of these occurreces are distributed as a radom sample of size from the uiform distributio o that iterval. Note that this implies that, coditioal o there beig occurreces i (0, t], the umber of occurreces i ay iterval (u, v] (0, t] (so 0 u < v t) has a Bi(, (v u)/t) distributio, as each of the occurreces would have probability (v u)/t of beig i (u, v], idepedetly of the others. We will prove this latter versio of the statemet. Proof. Note that N 0,t P o(λt), N u,v P o(λ(v u)) ad N 0,t N u,v = N 0,u N v,t P o(λ(t (v u)), ad the latter two radom variables are 57

11 idepedet. Thus, for 0 a, P (N u,v = a P 0,t = ) = P (N u,v = a, N 0,t = ) P (N 0,t = ) = P (N u,v = a, N 0,t N u,v = a) P (N 0,t = ) = P (N u,v = a)p (N 0,t N u,v = a) P (N 0,t = ) = (λ(v u))a e λ(v u) a! (λ(t (v u))) a e λ(t (v u)) ( a)!! (λt) e λ = e λ(v u) e λ(t (v u))! λ a (v u) a λ a (t (v u)) a e λ a!( a)! (λt) ( ) ( ) a ( v u = 1 v u ) a, a t t which is the probability that a Bi(, (v u)/t) radom variable takes the value a, as required. This result geeralises to the variable rate case, but the uiform distributio is replaced by the distributio which has p.d.f. f(s) = λ(s) t 0 λ(x)dx, which is the distributio o (0, t] whose desity is proportioal to the rate of the origial process. So the umber of occurreces i ay iterval (u, v] (0, t] has a ( v u Bi, λ(s)ds ) t 0 λ(s)ds distributio. The proof is essetially the same. Example 36. Coditioig o umber of evets Note that we ca actually reverse this idea to costruct a Poisso process, for example for simulatio purposes, or to covice ourselves that Poisso processes really exist. Assumig that we wat to costruct a variable rate Poisso process with rate λ(t), we ca do the followig: 58

12 Divide the positive real lie up ito itervals ( 1, ] for each positive iteger. To each of these itervals ( 1, ] assig a Poisso radom variable X with parameter 1 λ(t) dt. These Poisso radom variables should be idepedet of each other. (This assumes this itegral is fiite; if for oe of the itervals it is ot we will eed to be more careful.) If X = 0, the there will be o occurreces i the iterval ( 1, ]; if X = x > 0, the we create a radom sample of x radom variables o λ(s) ( 1, ] with probability desity fuctio f(s) = λ(x)dx, i a similar 1 maer to above. The values of these radom variables will give the times of occurreces i the iterval. It is ot too hard to show, usig the markig ad additivity properties of the Poisso distributio, that a process of occurreces costructed i this way will satisfy the assumptios with which we defied the Poisso process. 6.9 The spatial Poisso process A importat geeralisatio of the basic Poisso process is to replace the time scale with a space, ad the aim is to model a radom scatterig of poits i this space. The space may be oe-dimesioal for example if we wish to cosider defects o a legth of cable ad i that case it looks like the time scale, or it may be i a higher dimesio two dimesios for positios of spots of rai o a pavemet, three dimesios for positios of stars i space, for example. To geeralise the assumptios we made for the basic Poisso process, we eed a aalogue of the legth of a time iterval. The atural way to do this is to cosider legth i oe dimesio, area i two dimesios, volume i three dimesios, ad so o. We will refer to legth, area or volume, as appropriate, as measure, ad deote the measure of the set A by A. [For 59

13 those who are familiar with the mathematical cocept of a measure, we ca use other measures o our space here i place of legth, area or volume.] The behaviour of the process ca be described by radom variables N(A) for subsets A with fiite measure: N(A) represets the umber of poits of the process which fall iside the set A. The parameter λ is i this cotext called the desity of the process. A spatial Poisso process is ow defied to be a process which satisfies the followig assumptios, which are geeralisatios of those we used i the time settig. (a). For ay set A of fiite measure, N(A) has the Poisso distributio with parameter λ A. (b). If A 1, A 2,..., A k are disjoit sets of fiite measure, the N(A 1 ), N(A 2 ),..., N(A k ) are idepedet radom variables. The assumptios work for essetially the same reasos as before, otably the additivity of idepedet Poisso radom variables. Most of the properties of the basic Poisso process have aalogues i more tha oe dimesio: Superpositio Two idepedet spatial Poisso processes with rates λ ad µ ca be combied to form a spatial Poisso process with rate λ µ. Markig If the poits of a spatial Poisso process with rate λ are give idepedet marks (from 1, 2,..., k) with probabilities p 1, p 2,..., p k the the poits with mark i form a spatial Poisso process with rate λp i, ad the processes correspodig to the differet marks are idepedet. Coditioig If we kow that there are poits of the process i A, the the coditioal distributio of the locatio of the poits is that of a radom sample of size from the uiform distributio o A. I particular, if B A, the the umber of poits i B is Biomial with parameters ad B / A. 60

14 The proofs of all of these properties are atural geeralisatios of the proofs of the oe-dimesioal versios. It is also possible to simulate from a spatial Poisso process i a similar way to the oe described for the variable rate time Poisso process. Figure 3: A simulatio of a spatial Poisso process with rate 40 o a uit square Oe property of the basic Poisso process which does ot aturally carry over is the joit distributio of iter-occurrece times, as there is o atural orderig of poits i two or more dimesios, ad so the aalogue of iteroccurrece times does ot exist. However, it is possible to use a similar idea to calculate the distributio of the distace to the earest poit i the process from a give poit. Example 37. Trees i a forest It is also possible to defie variable rate spatial Poisso processes; the parameter of the Poisso distributio givig the umber of poits i a set A will be 61

15 the itegral over A of the rate fuctio, just as for the oe-dimesioal case, but the itegral is ow a multidimesioal oe. A actual scatter of poits may be clustered relative to the true radomess of the Poisso process for example, positios of plats each of which self-propagates withi a local area or regular relative to the Poisso process for example, positios of birds ests whe there is a territorial effect ihibitig ests from beig too close together. regular Figure 4: A simulatio of a spatial process more regular tha a Poisso process 6.10 Compoud Poisso processes* Suppose that evets occur at radom times but also each evet carries with it some umerical value, ad the chief iterest is i the sum of these umerical values over a period of time. Examples might be claims o a isurace compay, which occur at radom times but they differ i size; or fatalities i 62

16 cluster Figure 5: A simulatio of a spatial process more clustered tha a Poisso process road accidets, where the accidets occur at radom times but each accidet may icur a umber of deaths. The simplest model for such situatios is to take the times of occurreces as a basic Poisso process ad the to assume that the sizes of the occurreces are radom variables each with some kow distributio, which may be discrete or cotiuous, these radom variables beig idepedet of each other ad of the times of the occurreces. This gives what is kow as a compoud Poisso process. We will use the followig otatio. N(t) deotes the umber of occurreces i the time iterval (0, t], previously writte as N 0,t ; the sizes of the occurreces i chroological order are deoted by Y 1, Y 2,.... The the sum of these over 63

17 the time iterval (0, t] may be writte N(t) X(t) = Y i. If we thik graphically of plottig N(t) ad X(t) agaist t, the the graph of N(t) jumps upwards by 1 at each occurrece ad stays costat i betwee, whereas the graph of X(t) jumps (upwards or dowwards, sice Y i could be egative) by the radom quatities Y 1, Y 2,... at the times of the occurreces, ad stays costat i betwee. The process is completely specified by the rate λ of the Poisso process ad the commo distributio of the radom variables Y 1, Y 2,.... i=1 Figure 6: A simulatio of a compoud Poisso process with rate 1 ad jumps havig χ 2 4 distributio up to time 10 We ca combie the ideas of compoud Poisso processes with variable rate ad spatial Poisso processes as well. 64

18 For example, we might be modellig the locatios of ests of some species of bird withi some regio. We could treat the locatios as poits i two dimesioal space to be modelled by a spatial Poisso process. If some parts of the regio are more favourable to the species tha others, the we would expect a higher desity of ests i these areas, so the model would have a variable rate which is higher i favourable areas ad lower elsewhere. If we wated to model the total umber of offsprig raised, the a compoud spatial Poisso model might be appropriate. 65

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 15 CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model

More information

Discrete probability distributions

Discrete probability distributions Discrete probability distributios I the chapter o probability we used the classical method to calculate the probability of various values of a radom variable. I some cases, however, we may be able to develop

More information

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p).

Limit Theorems. Convergence in Probability. Let X be the number of heads observed in n tosses. Then, E[X] = np and Var[X] = np(1-p). Limit Theorems Covergece i Probability Let X be the umber of heads observed i tosses. The, E[X] = p ad Var[X] = p(-p). L O This P x p NM QP P x p should be close to uity for large if our ituitio is correct.

More information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

The Poisson Process *

The Poisson Process * OpeStax-CNX module: m11255 1 The Poisso Process * Do Johso This work is produced by OpeStax-CNX ad licesed uder the Creative Commos Attributio Licese 1.0 Some sigals have o waveform. Cosider the measuremet

More information

4. Partial Sums and the Central Limit Theorem

4. Partial Sums and the Central Limit Theorem 1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15

Discrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15 CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19 CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

( θ. sup θ Θ f X (x θ) = L. sup Pr (Λ (X) < c) = α. x : Λ (x) = sup θ H 0. sup θ Θ f X (x θ) = ) < c. NH : θ 1 = θ 2 against AH : θ 1 θ 2

( θ. sup θ Θ f X (x θ) = L. sup Pr (Λ (X) < c) = α. x : Λ (x) = sup θ H 0. sup θ Θ f X (x θ) = ) < c. NH : θ 1 = θ 2 against AH : θ 1 θ 2 82 CHAPTER 4. MAXIMUM IKEIHOOD ESTIMATION Defiitio: et X be a radom sample with joit p.m/d.f. f X x θ. The geeralised likelihood ratio test g.l.r.t. of the NH : θ H 0 agaist the alterative AH : θ H 1,

More information

Simulation. Two Rule For Inverting A Distribution Function

Simulation. Two Rule For Inverting A Distribution Function Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump

More information

Probability and statistics: basic terms

Probability and statistics: basic terms Probability ad statistics: basic terms M. Veeraraghava August 203 A radom variable is a rule that assigs a umerical value to each possible outcome of a experimet. Outcomes of a experimet form the sample

More information

EE 4TM4: Digital Communications II Probability Theory

EE 4TM4: Digital Communications II Probability Theory 1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair

More information

Generalized Semi- Markov Processes (GSMP)

Generalized Semi- Markov Processes (GSMP) Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP

Entropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1. Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 6 9/24/2008 DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 6 9/24/2008 DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 6 9/24/2008 DISCRETE RANDOM VARIABLES AND THEIR EXPECTATIONS Cotets 1. A few useful discrete radom variables 2. Joit, margial, ad

More information

NOTES ON DISTRIBUTIONS

NOTES ON DISTRIBUTIONS NOTES ON DISTRIBUTIONS MICHAEL N KATEHAKIS Radom Variables Radom variables represet outcomes from radom pheomea They are specified by two objects The rage R of possible values ad the frequecy fx with which

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

STAT Homework 1 - Solutions

STAT Homework 1 - Solutions STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

The Poisson process Random points

The Poisson process Random points 12 The Poisso process I may radom pheomea we ecouter, it is ot just oe or two radom variables that play a role but a whole collectio. I that case oe ofte speaks of a radom process. The Poisso process is

More information

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes.

IE 230 Seat # Name < KEY > Please read these directions. Closed book and notes. 60 minutes. IE 230 Seat # Name < KEY > Please read these directios. Closed book ad otes. 60 miutes. Covers through the ormal distributio, Sectio 4.7 of Motgomery ad Ruger, fourth editio. Cover page ad four pages of

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

The Random Walk For Dummies

The Random Walk For Dummies The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

Approximations and more PMFs and PDFs

Approximations and more PMFs and PDFs Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

( ) = p and P( i = b) = q.

( ) = p and P( i = b) = q. MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of

More information

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

More information

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

More information

Application to Random Graphs

Application to Random Graphs A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let

More information

Lecture 20: Multivariate convergence and the Central Limit Theorem

Lecture 20: Multivariate convergence and the Central Limit Theorem Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece

More information

As stated by Laplace, Probability is common sense reduced to calculation.

As stated by Laplace, Probability is common sense reduced to calculation. Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST

More information

Chapter IV Integration Theory

Chapter IV Integration Theory Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures

FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Discrete Mathematics for CS Spring 2008 David Wagner Note 22

Discrete Mathematics for CS Spring 2008 David Wagner Note 22 CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

Lecture 6 Simple alternatives and the Neyman-Pearson lemma STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull

More information

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.

Resampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n. Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator

More information

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2 Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY

5. INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY IA Probability Let Term 5 INEQUALITIES, LIMIT THEOREMS AND GEOMETRIC PROBABILITY 51 Iequalities Suppose that X 0 is a radom variable takig o-egative values ad that c > 0 is a costat The P X c E X, c is

More information

Kurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version)

Kurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version) Kurskod: TAMS Provkod: TENB 2 March 205, 4:00-8:00 Examier: Xiagfeg Yag (Tel: 070 2234765). Please aswer i ENGLISH if you ca. a. You are allowed to use: a calculator; formel -och tabellsamlig i matematisk

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

Rademacher Complexity

Rademacher Complexity EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY

UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach

More information

Lecture 18: Sampling distributions

Lecture 18: Sampling distributions Lecture 18: Samplig distributios I may applicatios, the populatio is oe or several ormal distributios (or approximately). We ow study properties of some importat statistics based o a radom sample from

More information

Lecture 1 Probability and Statistics

Lecture 1 Probability and Statistics Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark

More information

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.

Random Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A. Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)

More information

Lecture 2. The Lovász Local Lemma

Lecture 2. The Lovász Local Lemma Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

Distribution of Random Samples & Limit theorems

Distribution of Random Samples & Limit theorems STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to

More information

Elements of Statistical Methods Lots of Data or Large Samples (Ch 8)

Elements of Statistical Methods Lots of Data or Large Samples (Ch 8) Elemets of Statistical Methods Lots of Data or Large Samples (Ch 8) Fritz Scholz Sprig Quarter 2010 February 26, 2010 x ad X We itroduced the sample mea x as the average of the observed sample values x

More information

B Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets

B Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets B671-672 Supplemetal otes 2 Hypergeometric, Biomial, Poisso ad Multiomial Radom Variables ad Borel Sets 1 Biomial Approximatio to the Hypergeometric Recall that the Hypergeometric istributio is fx = x

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2 Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios

More information

Lecture 5. Random variable and distribution of probability

Lecture 5. Random variable and distribution of probability Itroductio to theory of probability ad statistics Lecture 5. Radom variable ad distributio of probability prof. dr hab.iż. Katarzya Zarzewsa Katedra Eletroii, AGH e-mail: za@agh.edu.pl http://home.agh.edu.pl/~za

More information

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3

4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3 Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x

More information

Math 525: Lecture 5. January 18, 2018

Math 525: Lecture 5. January 18, 2018 Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the

More information

Introduction to Probability. Ariel Yadin. Lecture 2

Introduction to Probability. Ariel Yadin. Lecture 2 Itroductio to Probability Ariel Yadi Lecture 2 1. Discrete Probability Spaces Discrete probability spaces are those for which the sample space is coutable. We have already see that i this case we ca take

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Lecture 5: April 17, 2013

Lecture 5: April 17, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 5: April 7, 203 Scribe: Somaye Hashemifar Cheroff bouds recap We recall the Cheroff/Hoeffdig bouds we derived i the last lecture idepedet

More information

Outline Continuous-time Markov Process Poisson Process Thinning Conditioning on the Number of Events Generalizations

Outline Continuous-time Markov Process Poisson Process Thinning Conditioning on the Number of Events Generalizations Expoetial Distributio ad Poisso Process Page 1 Outlie Cotiuous-time Markov Process Poisso Process Thiig Coditioig o the Number of Evets Geeralizatios Radom Vectors utdallas Probability ad Stochastic Processes

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More information