Lecture 7: Brownian motion

Size: px
Start display at page:

Download "Lecture 7: Brownian motion"

Transcription

1 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Lecture 7: Browia motio Readigs Recommeded: Pavliotis (2014) sectio 1.3, Optioal: Grimmett ad Stirzaker (2001) 8.5, 8.6, 9.6, Koralov ad Siai (2010) Ch. 18, Karatzas ad Shreve (1991), 2.9 (ad other bits of Chapter 2), for detailed results about Browia motio 7.1 Itroductio Browia motio is perhaps the most importat stochastic process we will see i this course. It was first brought to popular attetio i 1827 by the Scottish botaist Robert Brow, who oticed that polle grais suspeded i water move about at radom eve whe the water appears to be very still. Oe explaatio for this observatio could be that the grais come from livig matter ad are movig about of their ow accord. I order to rule out this explaatio, Brow repeated the experimet with iaimate objects like dust particles, ad foud the same behaviour. He was ot the first perso to otice this peculiar motio for example, it is described by a Roma Lucretius i a poem i 60 BC, ad poited out by Dutch scietist Ja Igehousz i 1785 but he was the first to ivestigate it so systematically. Here is a movie showig polle grais diffusig i a still liquid (third movie): Ad here is a movie showig 1µm glass beads sittig i water uder a microscope: Brow s work ispired both physicists to ivestigate the pheomeo. It was fially uderstood by Eistei i 1905, who showed how the radom motio could arise if water were made of may discrete compoets, rather tha formig a cotiuum. He argued that this idirectly cofirmed that matter was made of atoms. Smoluchowski costructed a related model i The equatios were verified experimetally by Jea Baptiste Perri i 1908, who received the Nobel prize for his work. Meawhile, mathematicias realized that a fuctio describig a particle movig accordig to Browia motio would have some bizarre properties, ad that it was ot kow how to actually costruct such a fuctio mathematically. Several mathematicias worked o this problem (e.g.theile, 1880, Bachelier, 1900), but it was ot resolved util Wieer gave a rigorous costructio of a Browia motio i For this reaso i mathematics Browia motio is ofte called a Wieer process.

2 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Figure 1: Some approximate realizatios of Browia motio. These were costructed by simulatig a radom walk with i.i.d. steps with distributio N(0, t), at times t = The total time of each realizatio is 10 uits. 7.2 Defiitios We ll start by lookig at how to costruct a stochastic process that could possibly model the erratic motio of a dust particle or other processes that are very radom. Ideally we d like the process to be as radom as possible i some sese, because if there is ay determiistic or predictable part of the process, the we could model that i a more covetioal way. We could do this by askig for a cotiuous process whose derivative is idepedet at each poit i time the idea beig that if the derivative has some correlatios, the we could predict the value of the process at least some time ito the future, ad the it would t be as radom as possible. It turs out that the best approximatio for such a process is a Browia motio. We ll first study the path properties of Browia motio, ad the we ll look at what we ca say about its statistics. Browia motio is our first example of a diffusio process, which we ll study a lot i the comig lectures, so we ll use this lecture as a opportuity for itroducig some of the tools to thik about more geeral Markov processes. The most commo way to defie a Browia Motio is by the followig properties: Defiitio (#1.). A Browia motio or Wieer process (W t ) t 0 is a real-valued stochastic process such that (i) W 0 = 0; (ii) Idepedet icremets: the radom variables W v W u, W t W s are idepedet wheever u v s t (so the itervals (u,v), (s,t) are disjoit.) (iii) Normal icremets: W s+t W s N(0,t) for all s,t 0. (iv) Cotiuous sample paths: with probability 1, the fuctio t W t is cotiuous. Property (iii) says the icremets are statioary. Therefore a Browia motio has statioary, idepedet icremets,, just like the Poisso process; the differece is that Browia motio has ormal icremets. It is also cotiuous. With these properties i had we ca say a lot about the trajectories ad statistics of the process. Therefore 2

3 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 it is atural to woder does such a process actually exist? Ad if so, is it uiquely defied by the four properties above? The aswer is yes to both questios, ad is proved i may probability books, e.g. Durrett (2005), p.373, Karatzas ad Shreve (1991), Breima (1992). The major difficulty is i showig property (iv): that there exists a versio of Browia motio that is cotiuous everywhere, almost surely. Remark. It is possible to replace (iii) with the coditio that the icremets W s+t W t do ot deped o t, P( W plus a cotiuity coditio that lim s+t W t δ) s 0 s = 0 for all δ > 0. Oe ca the show the icremets must be Gaussia. See Breima (1992), Ch. 12, p.248. We have already see a Browia motio, i Lecture 5, where we defied it as a particular Gaussia process. Recall that we defied a Browia motio as Defiitio (#2.). A Browia motio or Wieer process is a stochastic process W = (W t ) t 0 with the followig properties: (i) W 0 = 0; (ii) It is a Gaussia process; (iii) It has mea m(t) = 0 ad covariace B(s, t) = mi(s, t). (iv) Cotiuous sample paths: with probability 1, the fuctio t W t is cotiuous. It turs out that Defiitios 1&2 are equivalet (see e.g. Durrett (2005), p.373.), ad you ca work with whichever oe is more coveiet for the problem at had. Proof. Let s show that Defiitio #1 Defiitio #2. Give a BM (#1), we ca calculate the covariace of B s, B t as Cov(B s,b t ) = EB s B t (EB s )(EB t ) = EB s B t. For s < t, we write B t = (B t B s ) + B s ad so EB s B t = EB s (B t B s + B s ) = (EB s )E(B t B s ) + EB 2 s = s. The secod step follows sice B t B s is idepedet of B s (property (ii)), ad the third because the icremets have a give distributio (property (iii).) Therefore the BM satisfies property (iii) of Defiitio #2. To show that a BM (#1) is a Gaussia process, we must calculate its fiite dimesioal distributios. Cosider the two-poit distributios. Let p t,s (x,y) be the joit probability desity of (W t,w s ), i.e. the desity correspodig to the probability P(W s = x,w t = x). The we have p t,s (x,y) = P(W s = y,w t W s = x y) = P(W s = y)p(w t W s = x y) = p t s (x y)p s (y), where p s (y) is the probability desity of W s. The secod step follows by idepedet icremets ad the third by statioary icremets. Substitutig the kow Gaussia distributio of the icremets shows p t,s (x,y) = 1 e (x y)2 2(t s) 2π(t s) 1 2πs e y2 2s. You ca show this is a multivariate Gaussia by maipulatig the quadratic terms i the expoetial. To obtai ay fiite-dimesioal distributio we defie the trasitio desity to be p(x,t y,s) = 1 2π(t s) e (x y)2 2(t s) (1) 3

4 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 ad proceed i a similar fashio to write p t1,t 2,...,t (x 1,x 2,...,x ) = 1 2πt1 e x2 1 2t 1 p(x 2,t 2 x 1,t 1 ) p(x,t x 1,t 1 ). This is agai a multivariate Gaussia. Therefore, we have show that Defiitio #1 Defiitio #2. Exercise Show that Defiitios #2 Defiitio # Browia motio as a limit of radom walks A ituitive way of costructig about Browia motio is as a limit of radom walks. Let X 1,X 2,... be i.i.d. radom variables with mea 0 ad variace 1. For the sake of illustratio let s suppose that X i = ±1 with equal probability; though the argumet below will hold i the more geeral case. Cosider the sum S = j=1 X j, with S 0 = 0. This is a simple symmetric radom walk o the itegers. It is a discrete-time process, but we ca make a cotiuous-time process by liearly iterpolatig betwee values of S. Cosider the properties of (S t ) t N : (i) ES t = 0 (ii) Var(S t ) = t (iii) (S t ) t N has statioary icremets. To see why, ote that S t S s S t s sice both are a fuctio of t s distict X i. (iv) (S t ) t N has idepedet icremets. To see why, let 0 < q < r < s < t, ad ote that S t S s = X s X t, S r S q = X q X r. But the two sets of sequeces ivolve distict X i, so they are idepedet. (v) For t large, S t N(0,t), by the Cetral Limit Theorem. Therefore (S t ) t N has a lot of the properties of a Browia motio. We might woder if there is a way to scale it so it approaches a Browia motio i some limit. We will costruct such a limit by scalig space ad time i a particular way. Suppose we scale space by some factor x, ad time by some factor t. That is, we let the jumps have size x, ad we let the time betwee jumps be t. The rescaled process is S t, x t = x S t/ t = x ( X X t/ t ). (2) We wat to cosider the limit of the process (St t, x ) t N/ t as t, x 0, but how should these small parameters be related? If the limit is to approach somethig fiite, the we eed the variace to be fiite to. Sice Var(S t, x ) = ( x) 2 t t, we should choose ( x) 2 = costat. (3) t Let s suppose the costat equals 1 so the limitig process has the same variace at a poit as a Browia motio. This is a importat poit for a diffusio process, space scales as the square root of time. We will call this diffusive scalig. It will come up agai ad agai throughout the course. 4

5 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Let s write t = 1/, x = 1/, ad defie a sequece of processes i terms of parameter. Sice our origial process was a discrete-time process, it is coveiet to make a cotiuous-time process by liearly iterpolatig betwee the discrete values of t. The iterpolated, rescaled process is S () t = S [t] + (t [t])s [t]+1, (4) where [t] meas the largest iteger less tha or equal to t. The secod term o the RHS is oly eeded for the iterpolatio. The Dosker s Theorem or Dosker s Ivariace Priciple says that (S () t ) t 0 coverges i distributio to a Browia motio (W t ) t 0. Essetially, this meas that all the fiite-dimesioal distributios of (S () t coverge to the fiite-dimesioal distributios of a Browia motio. (For a rigorous defiitio of weak covergece, see the Appedix.) Dosker s Theorem is a powerful theorem, which is a geeralizatio of the Cetral Limit Theorem to path space. Provig Dosker s Theorem is a fair amout of work; see e.g. Durrett (1996) p.287 or Karatzas ad Shreve (1991) p.70. However, it is ot hard to see why the fiite-dimesioal distributios should coverge, at least heuristically. For the oe-poit distributios, the Cetral Limit theorem gives that S () t ) t 0 d N(0,t) as (with a little bit of care with the iterpolated parts.) Therefore the oe-poit distributios of coverge to the oe-poit distributios of Browia motio. For the two-poit distributios, we eed to cosider the joit distributio of pairs of radom variables of ( the form St, S s (agai igorig the iterpolated parts here.) Usig a similar techique as i the proof of the CLT (cosiderig (( ) the ( characteristic fuctios) )) shows that such a radom vector has a distributio which 0 mi(s,t) 0 coverges to N,. 0 0 mi(s, t) ) Oe ca treat the k-poit distributios similarly, see e.g. Karatzas ad Shreve (1991), p. 67. The fial part is to show the distributio of the etire process coverges i some sese, for all values of t at oce. We wo t do this here. 7.4 Properties of Browia motio Scalig properties (i) ( W t ) t 0 is a Browia motio (symmetry) (ii) (W t+s W s ) t 0 for fixed s is a Browia motio (traslatio property) 1 (iii) c W ct, with c > 0 is a fixed costat, is a Browia motio (scalig) (iv) (tw 1/t ) t 0 is a Browia motio (time-iversio) Property (iii) shows that Browia motio is like a fractal: it looks statistically the same at all scales, o matter how much you zoom i, provided that space ad time are scaled i the right way (agai, we see the diffusive scalig space time. ) This property follows aturally from the costructio of Browia motio as a limit of radom walks. 5

6 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Proof. (i), (ii), (iii) follow straightforwardly from Defiitio #1, by checkig the required coditios are satisfied. For example, for (iii): let X t = c 1/2 W ct. The (i) X 0 = c 1/2 W 0 = 0. (ii) X t has idepedet icremets this is straightforward to check. (iii) Normal icremets: for t s, X t X s = c 1/2 (W ct W cs ) c 1/2 N(0,c(t s)) N(0,t s). (iv) Cotiuity this follows from cotiuity of W t. To check (iv), we use Defiitio #2 of BM as a Gaussia process. We have that tw t is Gaussia, with mea 0. It has covariace fuctio EstW 1/s W 1/t = st ( 1 s 1 ) t = s t. It is cotiuous for t > 0. It remais to check W that it is cotiuous at 0. But lim t 0 tw 1/t = lim s s s 0 a.s., by the result below Behaviour as t There are several ways to characterize BM i the limit as t : (i) lim t W t t = 0 a.s.. W (ii) limsup t t t =, W limif t t t = (both a.s.). (iii) (Law of the Iterated Logarithm) lim sup t W t 2t loglogt = 1 a.s., limsup t 0+ W t 2t loglog1/t = 1 a.s.. If limsup is replaced by limif i either of the above, the limits are 1. Proof. (i) (from Breima (1992), p. 265) This follows from the Strog Law of Large Numbers. For N we ca write W = (W 1 W 0 ) + (W 2 W 1 ) (W W 1 ), which is a sum of iid radom variables. By the SLLN, W / 0 a.s.. To obtai behaviour at o-iteger t, let Z k = max B(k +t) B(k). 0 t 1 For t [k,k + 1], W t t W k k 1 k(k + 1) W k + 1 k + 1 Z k. The first term o the RHS 0 a.s., ad Z k has the same distributio as max 0 t 1 W t. It ca be show that EZ k <, ad that this implies Z k /k 0 a.s.. (iii) See e.g. Durrett (2005) sectio 7.9 p.431, or Breima (1992), p. 263, or Karatzas ad Shreve (1991), p Oe oly eeds to show oe limit, sice they are related to each other by the time iversio property (iv) of BM. (ii) This follows from the Law of the Iterated Logarithm. 6

7 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Figure 2: A sketch of φ h (s,t). From (Evas, 2013) Differetiability Theorem. With probability oe, sample paths of a Browia motio are ot Lipschitz cotiuous (ad hece ot differetiable) at ay poit. A rigorous proof is i the appedix. Here is a heuristic explaatio for why the derivative does t exist, at least at a sigle poit. Suppose we try to calculate the derivative as dw t dt = lim h 0 W t+h W t h But W t+h W t N(0,h) so the variace of the term uder the limit is Var. (5) ( ) Wt+h W t h = 1 h. The quatity o the RHS uder the limit as h 0, so we would ot expect the derivative to exist i ay fiite sese at 0. Aother way to see this, which uses the trasformatio properties of BM, is to argue that X h = W t+h W t is a Browia motio, by the traslatio property, ad the that Y s = sx 1/s for s = 1/t is a Browia motio, by the time-iversio property. But the limit above equals lim s Y s, which does t exist. Of course, the theorem makes a much stroger argumet, which is that the derivative does t exist aywhere, with probability 1. That is, for ay give path, there is ot eve a sigle poit at which a sample path of Browia motio is differetiable! Nevertheless, i the Physics literature it is commo to speak of the derivative of Browia motio, where it is called white oise. It turs out that eve though white oise does t exist i a classical sese, we will work with it i a weaker sese whe we defie stochastic itegrals. Let s set aside for a momet our mathematical kowledge ad preted that the derivative of Browia motio exists, ad see what we ca lear about it. Let ξ t dw t dt where dw t dt is defied i (5). If this is a stochastic process the we ca calculate its covariace fuctio, formally at least. From (5) we have that (e.g. Evas, 2013, p.41) Cov(ξ s,ξ t ) = Eξ s ξ t = lim h 0 φ h (s,t) where ( )( ) Wt+h W t Ws+h W s φ h (s,t) = E = 1 [(t + h) (s + h) (t + h) s t (s + h) +t s]. h h h2 7

8 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 See Figure 2 for a sketch of φ h (s,t). If s t, the for h < t s the quatity o the RHS equals 0. For s = t, it equals h/h 2, which as h 0. However, sice φ h (s,t)ds = 1 for fiite h, we expect this itegral should hold i the limit, ad therefore we expect φ h (s,t) δ(s t) i some sese as h 0. Therefore we expect that, formally at least, we should have i.e. the covariace fuctio should be a delta-fuctio. Eξ s ξ t = δ(s t), (6) Why should ξ t be called white oise? Notice that its covariace fuctio depeds oly o s t so ξ t is weakly statioary, so we ca calculate its spectral decompositio from the last lecture. The spectral desity of δ(t) is f (λ) = 1 e iλt δ(t) dt = 1 for all λ. 2π 2π The spectral desity is flat: all frequecies cotribute equally, just as all frequecies of light cotribute to make white light. Here are some other facts about the sample path properties of Browia motio. Theorem. (a) With probability 1, a Browia sample path is locally Hölder cotiuous with expoet γ for every γ (0, 1 2 ). (b) With probability 1, Browia paths are owhere locally Hölder cotiuous for ay expoet γ > 2 1. Proof. See Karatzas ad Shreve (1991), Durrett (2005). 7.5 Quadratic variatio Recall that the cocept of total variatio from aalysis: Defiitio. The total variatio of a fuctio f (t) o a iterval [a,b] is defied by V [a,b] ( f ) = sup σ i=1 f (t i ) f (t i 1 ), (7) where the supremum is over all partitios σ = {t 0,t 1,...,t } of [a,b] with a = t 0 < t 1 < < t = b. If V [a,b] ( f ) < the f is said to be of bouded variatio, ad if V [a,b] ( f ) = the f is said to be of ifiite variatio. If a fuctio is of bouded variatio o [a,b], the a theorem i aalysis says it has a derivative almost everywhere o [a, b] (i.e. except for a set of measure zero.) Coversely, if a fuctio is owhere differetiable, the it must have ifiite variatio o ay iterval. Sice Browia motio is owhere differetiable, it has ifiite variatio o ay iterval. However, it is actually ot all that bad as a fuctio: it actually has fiite quadratic variatio (i a mea-square sese.) This will tur out to be a very importat property whe we costruct the stochastic itegral. 8

9 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Defiitio. The pth-variatio of a fuctio f o [a,b] is V p [a,b] ( f ) = sup σ i=1 f (t i ) f (t i 1 ) p. (8) where the supremum is over all partitios σ = {t 0,t 1,...,t } of [a,b] with a = t 0 < t 1 < < t = b. Whe p = 2 the V[a,b] 2 ( f ) is called the quadratic variatio of f o [a,b]. We would like to calculate the quadratic variatio of W t. However, sice the fuctio is a stochastic process we will eed to take care with how the supremum over the partitios is calculated. It turs out that we ca calculate it as a particular kid of limit, but ot all types of stochastic covergece will give a result that is fiite. We will use the followig otio of covergece. Defiitio. A sequece of radom variables X 1,X 2,... coverges i mea-square to aother radom variable m.s. X, writte X X, if E X X 2 0 as. Remark. Covergece i mea-square implies covergece i probability, which i tur implies covergece i distributio. Covergece i mea-square does ot imply almost sure covergece or vice versa. (Almost sure covergece does imply covergece i probability ad hece covergece i distributio.) We will use the idea of covergece i mea-square to calculate the supremum i (8). We eed otatio that explicitly idetifies the partitio ivolved i the sum. Defiitio. The quadratic variatio of a fuctio f o [0,t] with respect to a partitio σ is Q σ t ( f ) = i=0 f (t i+1 ) f (t i ) 2. (9) Lemma. The quadratic variatio of Browia motio Qt σ (W t ) coverges i mea-square to t as σ 0, where σ = max i t i+1 t i, i.e. i=1 W t i+1 W ti 2 m.s. t. Proof. (From Koralov ad Siai (2010), p. 269.) ( ( ) 2 E Qt σ (W t ) t = E (Wti W ti 1 ) i=1[ 2 (t i t i 1 ) ]) 2 = = 4 i=1 i=1 i=1 E [ (W ti W ti 1 ) 2 (t i t i 1 ) ] 2 E(W ti W ti 1 ) 4 + i=1 (see explaatio below) (t i t i 1 ) 2 sice (a b) 2 a 2 + b 2 for a,b 0 (t i t i 1 ) 2 sice E(W t W s ) 4 = 3 t s 2 4 max (t i t i 1 ) 1 i = 4t σ i=1 (t i t i 1 ) The secod equality uses the fact that E ( (W ti W ti 1 ) 2 (t i t i 1 ) )( (W t j W t j 1 ) 2 (t j t j 1 ) ) = 0 if i j. 9

10 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Remark. This meas that icremets of W t behave as t, i.e. formally we ca write ( W) 2 = t, or (dw t ) 2 = dt. We see the diffusive scalig arise yet agai. Remark. Whe we say the quadratic variatio of Browia motio is fiite, we mea that the limit of Q σ t (W t ) exists i mea-square or i probability (which is implied by it existig i a mea-square sese.) It is ot true that the limit exists almost surely. I fact, oe ca show if oe uses the classical defiitio of quadratic variatio by takig the supremum of the sum over all partitios, the Browia motio has ifiite quadratic variatio o ay iterval. Remark. A fuctio with o-zero quadratic variatio must have ifiite total variatio. To see why, write i=0 f (t i+1 ) f (t i ) 2 max f (t i+1) f (t i ) i i=0 f (t i+1 ) f (t i ) As σ 0, max i f (t i+1 ) f (t i ) 0 by defiitio, but the quatity o the LHS goes to a fiite umber. Therefore we must have i=0 f (t i+1) f (t i ). But i=0 f (t i+1) f (t i ) V [a,b] ( f ) so the total variatio is ifiite. Of course, this argumet is for a determiistic fuctio, but you could adapt it for a stochastic oe. 7.6 Browia motio as a Markov process Suppose we kow the value of Browia motio for all times up to some time s. What ca we say about W t, for t > s? Sice W t = W s + (W t W s ), ad the icremet W t W s is idepedet of all observatios up to time s, we ca obtai the distributio of W t usig oly our kowledge of W s, ad ot ay earlier observatios. I other words, we ca write P(W t F W t 1 F 1,...,W t0 F 0 ) = P(W t F W t 1 F 1 ), (10) where t 0 < t 1 < < t, ad F i are Borel sets (evets.) This seems a lot like the Markov property that we studied for Markov chais the differece is that previously, we cosidered Markov chais that could take o a discrete set of values, whereas Browia motio ca take o a cotiuum. It turs out that (10) is actually the defiitio of a geeral Markov process, ad that Browia motio satisfies this coditio (Koralov ad Siai (2010), p.278.) 1 Therefore Browia motio is our first example of a cotiuous-time, cotiuous-space Markov process; there are may more to come. Sice Browia motio is Markov, it makes sese to study its trasitio fuctio P(Γ,t y,s) = P(W t Γ W s = y), where s < t ad Γ is a Borel set. This ca be writte i terms of the trasitio desity p(x,t y,s) as P(Γ,t y,s) = Γ 1 e (x y)2 2(t s) dx = p(x, t y, s)dx (11) 2π(t s) Γ The trasitio desity p(x,t y,s) gives the probability desity to be at x at time t, give the process was at y at time s. It is the cotiuous aalog of the trasitio matrix that we itroduced for Markov chais. 1 See Appedix for the rigorous formulatio of the Markov property. 10

11 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 We are able to write it dow explicitly i (11), because we kow the icremets of Browia Motio are Gaussia. A geeral Markov process is time-homogeeous if the trasitio fuctio oly depeds o the differece i times: P(Γ,t x,s) = P(Γ,t s x,0) P(Γ,t s x). The trasitio fuctio for a geeral Markov process satisfies the Chapma-Kolmogorov equatios, which ow take this form: Chapma-Kolmogorov Equatio. P(Γ,t x,s) = P(Γ, t y, u)p(dy, u x, s) (12) for all s u t. For a time-homogeeous Markov process, the Chapma-Kolmogorov equatios are P(Γ,t + s x) = P(Γ, t x)p(dz, s x). (13) See e.g. Pavliotis (2014), p. 35 for a (formal) proof. You could also check it holds directly for the case of a Browia motio for which you have a explicit formula for the trasitio probabilities. Oe approach to studyig Markov processes is to start with a set of trasitio fuctios or desities with kow ifiitesimal properties, ad to show they satisfy certai evolutio equatios (ad/or aalyze the cosistecy of the iitial assumptios) (e.g. Gardier, 2009). We will explore such techiques o the homework. Aother approach to studyig Markov processes is through the trasitio semigroup (Durrett, 1996, Chapter 7), (Varadha, 2007). Let (X t ) t 0 be a time-homogeeous Markov process, ad let s defie the operator T t f (x) E x f (X t ) = f (y)p(dy,t x), (14) R where E x meas the expected value, give X 0 = x, ad t 0. The domai of T t is the set of bouded, measurable fuctios f : R R. We calculate (T t+s ) f (x) = f (y)p(dy,t + s x) = f (y)p(dy, x z)p(dz, t x) = (T s f )(z)p(dz,t x) Therefore = (T t T s )( f )(x). T s+t f = (T s T t ) f. (15) This is the semigroup property for the set of operators {T t } t 0. Note the relatio to the Chapma-Kolmogorov equatios P s P t = P s+t for discrete-time Markov chais. We use the orm f = sup x f (x) ad work i the space of bouded measurable fuctios L = { f : f < }. You ca see that T t is a cotractio semigroup o L, i.e. T t f f, ad therefore T t is a bouded liear operator. (Exercise: show this!) 11

12 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 For a cotiuous-time Markov chai, we calculated the ifiitesimal geerator ad derived a umber of properties from this. It turs out this cocept is also very useful whe studyig more geeral Markov processes. The defiitio of the geerator is similar: Defiitio. The ifiitesimal geerator of a Markov process is the operator L defied by L f lim t 0 T t f f t E x f (X t ) f (x) (L f )(x) = lim, (16) t 0 t The set D(L ) L o which this limit exists is the domai of L. The covergece is uderstood as the orm covergece, i.e. that lim t 0 t 1 (T t f f ) g = 0 for some fuctio g, which is idetified as L f. Formally, we ca write 2 Tt = e L t I +tl + t2 2 L 2 +. (17) Example. Let s calculate the geerator of Browia motio (followig Varadha, 2007). We have that (T t f )(x) = The ifiitesimal geerator is 1 f (y) e (y x)2 2t dy = 2πt (L f )(x) = lim t 0 f (x + z t) f (x) t f (x + z 1 t) e z2 2 dz. 2π 1 e z2 2 dz. (18) 2π Suppose f is bouded ad has three bouded derivatives, so we ca expad it usig Taylor s formula as f (x + z t) f (x) = z t f (x) + tz2 2 f (x) +t 3/2 R(t,z) where the remaider term satisfies R(t,z) C z 3 for some costat C. Substitutig this expasio ito (18) ad calculatig the itegral directly shows that The geerator of Browia motio is the Laplacia operator. L f = 1 2 f = 1 d 2 f 2 dx 2. (19) Remark. Note the aalogy to the geerator for a cotiuous-time Markov chai: there, the geerator was a matrix applied to a vector (or, i the case of the Poisso process, a liear fuctio applied to a coutable sequece.) Here, the geerator is still liear, but ow it acts o fuctios, ot vectors: it is a liear operator. This will be true for Markov processes i geeral: their evolutio ca be described by a geerator, which is always a liear fuctioal. The fuctioal wo t always be a partial differetial operator though for a wide class of processes, amely diffusio processes, it is. Aother commo possibility is a itegral operator, which occurs for jump processes. The Hille-Yosida theorem provides the coditios for a closed liear operator L o a Baach space to be the ifiitesimal geerator of a Markov process. 2 This ca be show to be true rigorously wheever L is bouded, or (equivaletly) T t is a uiformly cotiuous semigroup. We will always assume these coditios hold. 12

13 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Why are we iterested i the geerator? This is the fudametal object from which we ca describe the evolutio of probability ad measurable statistics. Notice that we ca approximate E x f (X t ) f (x) +tl f (x), so L describes what happes to the process i a small amout of time, i.e. how the probability moves aroud. Differet kids of terms i L, i.e. first derivatives, secod derivatives, itegrals, etc, have differet physical meaig. Let s derive (formally) a more specific evolutio equatio. Notice that, from differetiaig the formal relatio (17) term-by-term, we obtai dt t dt = L e L t = L T t, Therefore T t L = L T t, ad by itegratig, we have that dt t dt = e L t L = T t L. (20) t T t f = f + T s L f ds. (21) 0 This calculatio was formal, but it ca be made rigorous with a few extra lies of work, see e.g. Durrett (1996), Sectio 7.1 Theorem 1.5 p.247. We use the first relatio i (20) to get a versio of the Kolmogorov backward equatio. Backward Kolmogorov Equatio. Let u(x,t) E x f (X t ) = T t f (x). If f D(L ), the u t = L u, u(x,0) = f (x). (22) Now let s cosider how the probability measure for the process evolves. Let µ t (dx) be the law of the process at time t, i.e. µ t (A) = P(X t A) = P(dy,t x,0)µ 0 (dx). y A x R Let s defie a operator T t to be the pushforward of the iitial probability measure: T t µ(dx,0) µ(dx,t). Tt is a operator that acts o probability measures ad produces a probability measure. The T t, Tt formally adjoits i L 2. To see why, ote that we have ad also Therefore T t f = R R f (x)µ t (dx) = R T t f = T t f (x) µ 0 (dx). R f (x)(t t µ 0 (dx)) T t f (x) µ 0 (dx) = f (x)(tt µ 0 (dx)) (23) R or i other words T t f, µ 0 = f,t t µ 0, where f,g = R f (x)g(x)dx is the L2 ier product. 13 are

14 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Let L be the L 2 -adjoit of the geerator L, i.e. it is such that (L f )gdx = f (L g)dx R for all fuctios f,g such that f is i D(L ), g is a probability measure. The from (23) you ca show that = e tl. A similar argumet that led to the backward equatio gives the forward equatio: T t Forward Kolmogorov Equatio. µ t t R = L µ t, µ 0 = (give iitial desity.) (24) Remark. The forward equatio may be easier to uderstad i the case whe the process has a smooth probability desity for all time. Suppose the probability desity at time t is ρ(y,t) = ρ 0 (x)p(y,t x,0)dx, where ρ 0 (y) is the iitial desity. To compute ρ t, we eed a equatio for t p(y,t x,0). We will do this idirectly, workig with our previous calculatios for the backward equatio. Let f be a suitable test fuctio, e.g. a bouded, measurable fuctio with compact support. If we let u = T t f as before, we kow from the backward equatio that u t = T tl f = p(y,t x,0)l f (y)dy = (Ly p) f (y)dy. Here L is the adjoit of L with respect to the L 2 ier product, i.e. ul v = vl u, ad the subscript o L is a remider that it acts o the y-variables of p. We also kow that u p t = (x,t y,0) f (y)dy. t (We ca differetiate uder the itegral provided p t exists ad is locally i L 1. This wo t ecessarily hold at t = 0, but we ca get aroud this by itegratig over small times ad the takig the derivative; we ll just igore this issue for ow.) Sice the two calculatios hold for all test fuctios f, we have that p t = Ly p(y,t x,0) (weakly). Itegratig over the iitial desity ρ 0 (x) gives This is a versio of the forward equatio formulated i terms of desities. ρ t = L ρ, ρ(0,y) = ρ 0 (y). (25) Remark. The forward equatio exists for all the processes we will ecouter, though i geeral its mathematical existece is trickier to establish tha the backward equatio. Sometimes, (25) must be iterpreted i weak form, for example whe the probability measure is restricted to a submaifold so it cotais δ-fuctios. Example. For Browia motio, the backward equatio for a fuctio u(x,t) is u t = 1 2 u 2 x 2, u(x,0) = f (x) I terms of the trasitio probabilities p(x,t y,t) the backward equatio is p s = 1 2 p 2 y 2, p(x,t y,t) = δ(x y). 14

15 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 This equatio should be solved backward i time i s, startig at s = t. The forward equatio for the probability desity ρ(x,t) is ρ t = 1 2 ρ 2 x 2, ρ(x,0) = ρ 0(x). I terms of the trasitio probabilities p(x,t y,s) the backward equatio is p t = 1 2 p 2 x 2, p(x,0 y,0) = δ(x y). You ca check that these equatios hold directly from the explicit form of p(x,t y,s). I geeral, you wo t have a explicit formula for the trasitio probabilities, so you will obtai them by solvig the correspodig PDEs. 7.7 Appedix Covergece i distributio Here is the defiitio of covergece i distributio (see e.g. Durrett (1996), Chapter 8, Theorem 1.1.) Defiitio. Cosider a sequece of radom variables X 1,X 2,... defied o a sequece of probability spaces {(Ω,F,P )} =1 ad takig values i some metric space (S,ρ). Let (Ω,F,P) be aother probability space, o which aother radom variable X is defied, which takes values i (S,ρ). The {X } =1 coverges i d distributio, or coverges weakly to X, writte X X, if E f (X ) E f (X) for all bouded, cotiuous, real-valued fuctios f, where E,E deote expectatios with respect to the measures associated with X,X respectively. If X,X are real-valued (i.e. ot path-valued) the a equivalet defiitio is that F (x) F(x) at each poit of cotiuity of F(x), where F,F are the cumulative distributio fuctios of the radom variables. If the probability space is R (so each X is a stochastic process), the weak covergece is equivalet to covergece of fiite dimesioal distributios; see e.g. Durrett (1996), Chapter 8 Theorem 2.7 p Browia motio is ot differetiable Proof of the o-differetiability of Browia motio. This proof is from Breima (1992), p. 261, i tur from Dvoretsky, Erdös, ad Kakutai (1961. The same proof is preseted i Durrett (2005), p 377. Notice that if a fuctio x(t) has a derivative x (s), with x (s) < β at some poit s [0,1], the there is a 0 such that for > 0, x(t) x(s) 2β t s, if t s 2/. (26) Let A = {ω : there is a s [0,1] s.t. W t W s 2β t s whe t s 2/}. 15

16 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 The A icrease with, ad the limit set A icludes the set of all sample paths o [0,1] havig a derivative at ay poit which is less tha β i absolute value. If (26) holds, the let k be the largest iteger such that k/ s, so that } Therefore, if we let y k = max{ Wk+2 Wk+1, Wk+1 Wk, W k Wk 1 { C = B( ) : at least oe y k 6β }, 6β. the A C. To show P(A) = 0, which implies the theorem, it is sufficiet to get lim P(C ) = 0. But so 2 P(C ) k=1 P C = ( Wk+2 P max{ 2 k=1 Wk+1 { B( ) : y k 6β, Wk+1 }, Wk, W k Wk 1 ( max { } W3/ W 2/, W2/ W 1/, W1/ 6β = P( W 1/ 6β ( = 2π 6β/ 6β/ ) 3 ) 3 e x2 /2 dx ( 1 6β = e x2 /2 dx 2π 6β The fial itegral coverges to 0 as, so P(W ) 0. ) 3 } 6β ) ) Markov property The Markov property i cotiuous time ca be formulated more rigorously i terms of σ-algebras. Let (Ω,F,P) a the probability space ad let {F t } t 0 be a filtratio: a icreasig sequece of σ-algebras such that F t F for each t, ad t 1 t 2 F t1 F t2. We suppose the process X t is adapted to the filtratio {F t } t 0 : each X t is measurable with respect to F t. For example, this will be true automatically if we let F t be the σ-algebra geerated by (X s ) 0 s t, i.e. geerated by the pre-images Xs 1 (B) for Borel sets B R. The X t has the Markov property if E( f (X t ) F s ) = E( f (X t ) σ(x s )) for all 0 s t ad bouded, measurable fuctios f. Aother way to say this is P(X t A F s ) = P(X t A σ(x s )), where P( ) is a regular coditioal probability (see Koralov ad Siai (2010), p.184.) 16

17 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Refereces Breima, L. (1992). Probability. SIAM. Durrett, R. (1996). Stochastic Calculus: A practical itroductio. CRC Press, Taylo & Fracis Group. Durrett, R. (2005). Probability: Theory ad Examples. Thomso, 3rd editio. Evas, L. C. (2013). A Itroductio to Stochastic Differetial Equatios. America Mathematical Society. Gardier, C. (2009). Stochastic methods: A hadbook for the atural scieces. Spriger, 4th editio. Grimmett, G. ad Stirzaker, D. (2001). Probability ad Radom Processes. Oxford Uiversity Press. Karatzas, I. ad Shreve, S. E. (1991). Browia Motio ad Stochastic Calculus. Spriger. Koralov, L. B. ad Siai, Y. G. (2010). Theory of Probability ad Radom Processes. Spriger. Pavliotis, G. A. (2014). Stochastic Processes ad Applicatios. Spriger. Varadha, S. R. S. (2007). Stochastic Processes, volume 16 of Courat Lecture Notes. America Mathematical Society. 17

Lecture 5: Stochastic Processes (II)

Lecture 5: Stochastic Processes (II) Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2015 Lecture 5: Stochastic Processes (II) Readigs Recommeded: Pavliotis [2014] sectios 1.3-1.5 Pavliotis [2014] sectios 2.1-2.3, 2.5 Optioal: Grimmett

More information

Notes 27 : Brownian motion: path properties

Notes 27 : Brownian motion: path properties Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties

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

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

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece

More information

6a Time change b Quadratic variation c Planar Brownian motion d Conformal local martingales e Hints to exercises...

6a Time change b Quadratic variation c Planar Brownian motion d Conformal local martingales e Hints to exercises... Tel Aviv Uiversity, 28 Browia motio 59 6 Time chage 6a Time chage..................... 59 6b Quadratic variatio................. 61 6c Plaar Browia motio.............. 64 6d Coformal local martigales............

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

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

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak

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

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

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

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

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

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

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

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

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

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

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 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n. Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset

More information

Probability and Statistics

Probability and Statistics Probability ad Statistics Cotets. Multi-dimesioal Gaussia radom variable. Gaussia radom process 3. Wieer process Why we eed to discuss Gaussia Process The most commo Accordig to the cetral limit theorem,

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

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

Lecture Chapter 6: Convergence of Random Sequences

Lecture Chapter 6: Convergence of Random Sequences ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite

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

Notes 5 : More on the a.s. convergence of sums

Notes 5 : More on the a.s. convergence of sums Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series

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

1 The Haar functions and the Brownian motion

1 The Haar functions and the Brownian motion 1 The Haar fuctios ad the Browia motio 1.1 The Haar fuctios ad their completeess The Haar fuctios The basic Haar fuctio is 1 if x < 1/2, ψx) = 1 if 1/2 x < 1, otherwise. 1.1) It has mea zero 1 ψx)dx =,

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

Notes 19 : Martingale CLT

Notes 19 : Martingale CLT Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall

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

Probability for mathematicians INDEPENDENCE TAU

Probability for mathematicians INDEPENDENCE TAU Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet

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

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

Lecture 7: Stochastic Integration

Lecture 7: Stochastic Integration Mirada Holmes-Cerfo Applied tochastic Aalysis, prig 215 Lecture 7: tochastic Itegratio Readigs Recommeded: Oksedal [25] 3.1-3.3, 4.1-4.2 Pavliotis [214] 3.1-3.2 Optioal: Koralov ad iai [21] 2.2-2.4, 2.7

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

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Math Solutions to homework 6

Math Solutions to homework 6 Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there

More information

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data

Kolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the

More information

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.

1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series. .3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(

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

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

Stochastic Simulation

Stochastic Simulation Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso

More information

Math 2784 (or 2794W) University of Connecticut

Math 2784 (or 2794W) University of Connecticut ORDERS OF GROWTH PAT SMITH Math 2784 (or 2794W) Uiversity of Coecticut Date: Mar. 2, 22. ORDERS OF GROWTH. Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really

More information

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1 Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity

More information

Fourier Series and the Wave Equation

Fourier Series and the Wave Equation Fourier Series ad the Wave Equatio We start with the oe-dimesioal wave equatio u u =, x u(, t) = u(, t) =, ux (,) = f( x), u ( x,) = This represets a vibratig strig, where u is the displacemet of the strig

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

Lecture 27: Optimal Estimators and Functional Delta Method

Lecture 27: Optimal Estimators and Functional Delta Method Stat210B: Theoretical Statistics Lecture Date: April 19, 2007 Lecture 27: Optimal Estimators ad Fuctioal Delta Method Lecturer: Michael I. Jorda Scribe: Guilherme V. Rocha 1 Achievig Optimal Estimators

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

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

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

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

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

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam. Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013. Large Deviations for i.i.d. Random Variables MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 2 9/9/2013 Large Deviatios for i.i.d. Radom Variables Cotet. Cheroff boud usig expoetial momet geeratig fuctios. Properties of a momet

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

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

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

K. Grill Institut für Statistik und Wahrscheinlichkeitstheorie, TU Wien, Austria

K. Grill Institut für Statistik und Wahrscheinlichkeitstheorie, TU Wien, Austria MARKOV PROCESSES K. Grill Istitut für Statistik ud Wahrscheilichkeitstheorie, TU Wie, Austria Keywords: Markov process, Markov chai, Markov property, stoppig times, strog Markov property, trasitio matrix,

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

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

STA Object Data Analysis - A List of Projects. January 18, 2018

STA Object Data Analysis - A List of Projects. January 18, 2018 STA 6557 Jauary 8, 208 Object Data Aalysis - A List of Projects. Schoeberg Mea glaucomatous shape chages of the Optic Nerve Head regio i aimal models 2. Aalysis of VW- Kedall ati-mea shapes with a applicatio

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

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula

Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials

More information

Solutions to HW Assignment 1

Solutions to HW Assignment 1 Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.

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

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

Notes for Lecture 11

Notes for Lecture 11 U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with

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

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

Stochastic Integration and Ito s Formula

Stochastic Integration and Ito s Formula CHAPTER 3 Stochastic Itegratio ad Ito s Formula I this chapter we discuss Itô s theory of stochastic itegratio. This is a vast subject. However, our goal is rather modest: we will develop this theory oly

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

Lecture 6: Integration and the Mean Value Theorem. slope =

Lecture 6: Integration and the Mean Value Theorem. slope = Math 8 Istructor: Padraic Bartlett Lecture 6: Itegratio ad the Mea Value Theorem Week 6 Caltech 202 The Mea Value Theorem The Mea Value Theorem abbreviated MVT is the followig result: Theorem. Suppose

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

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

1 6 = 1 6 = + Factorials and Euler s Gamma function

1 6 = 1 6 = + Factorials and Euler s Gamma function Royal Holloway Uiversity of Lodo Departmet of Physics Factorials ad Euler s Gamma fuctio Itroductio The is a self-cotaied part of the course dealig, essetially, with the factorial fuctio ad its geeralizatio

More information

32 estimating the cumulative distribution function

32 estimating the cumulative distribution function 32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio

More information

Lecture 3 : Random variables and their distributions

Lecture 3 : Random variables and their distributions Lecture 3 : Radom variables ad their distributios 3.1 Radom variables Let (Ω, F) ad (S, S) be two measurable spaces. A map X : Ω S is measurable or a radom variable (deoted r.v.) if X 1 (A) {ω : X(ω) A}

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

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

Linear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form

Linear Elliptic PDE s Elliptic partial differential equations frequently arise out of conservation statements of the form Liear Elliptic PDE s Elliptic partial differetial equatios frequetly arise out of coservatio statemets of the form B F d B Sdx B cotaied i bouded ope set U R. Here F, S deote respectively, the flux desity

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

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)].

Probability 2 - Notes 10. Lemma. If X is a random variable and g(x) 0 for all x in the support of f X, then P(g(X) 1) E[g(X)]. Probability 2 - Notes 0 Some Useful Iequalities. Lemma. If X is a radom variable ad g(x 0 for all x i the support of f X, the P(g(X E[g(X]. Proof. (cotiuous case P(g(X Corollaries x:g(x f X (xdx x:g(x

More information

Lecture 8: Convergence of transformations and law of large numbers

Lecture 8: Convergence of transformations and law of large numbers Lecture 8: Covergece of trasformatios ad law of large umbers Trasformatio ad covergece Trasformatio is a importat tool i statistics. If X coverges to X i some sese, we ofte eed to check whether g(x ) coverges

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15

17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15 17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo

More information

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size. Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

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

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

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