Lecture 5: Stochastic Processes (II)

Size: px
Start display at page:

Download "Lecture 5: Stochastic Processes (II)"

Transcription

1 Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2015 Lecture 5: Stochastic Processes (II) Readigs Recommeded: Pavliotis [2014] sectios Pavliotis [2014] sectios , 2.5 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 5.1 Karhue-Loeve decompositio I this sectio we ll cosider a geeral spectral represetatio that works eve for o-statioary processes. Cosider a stochastic process X(t) that has mea zero, ad is cotiuous i the L 2 -sese: EX 2 t <, EX t = 0, lim h 0 E X t+h X t 2 = 0. Its covariace fuctio B(s,t) = EX s X t is symmetric, positive-defiite, ad cotiuous. Suppose the process is defied o a bouded, measurable set D R, e.g. D = [0,1],[a,b], etc. Let s defie a itegral operator K : L 2 (D) L 2 (D) as (K f )(s) B(s,t) f (t)dt (1) It ca be show that this operator is: (i) positive semi-defiite: K f, f 0 for all f, where u,v = D uv dt is the L2 (D) ier product (ii) self-adjoit: K f,g = f,kg D (iii) compact: if { f } =1 is a bouded sequece i L2 (D), the {K f } =1 has a coverget subsequece. Remark. For a fiite-dimesioal aalogy, cosider the matrix K = (B(t i,t j )) i, j=1 ad let u = (u(t i)) be a vector. The Ku is just a matrix (which is symmetric ad oegative) times a vector. Remark. By (i), (ii) it follows that all its eigevalues are real ad oegative. From (iii), the spectral theorem for compact operators implies that K has a coutable sequece of eigevalues tedig to 0. By Mercer s theorem, K has a orthoormal basis of eigefuctios {e i } ad its eigevalues {λ i} are real ad oegative, with 0 as the oly accumulatio poit. Furthermore, we ca write the kerel as B(s,t) = λ i e i (s)e i (t), (2)

2 where the covergece of the sum is absolute ad uiform o D D, ad we ca write every fuctio f L 2 (D) as f = f e (t), where the series coverges i L 2. Our goal is to write a stochastic process also i this form; basically the oly differece will be that the coefficiets f will be radom variables. Theorem (Karhue-Loeve). Let X t be a mea-zero stochastic process defied o t D = [a,b] with X t L 2 (Ω D), i.e. D EX t 2 <. Suppose it has cotiuous covariace fuctio B(s, t), whose correspodig itegral operator has eigevalues {λ i } ad orthoormal eigefuctios {e i}. The X t = ξ i e i (t), with ξ i = X t e i (t) dt. (3) D The above series coverges i mea-square (L 2 (Ω)) ad uiformly i t, i.e. lim sup t D E(X t ξ i e i (t)) 2 0. The coefficiets are radom variables with the followig properties: (i) zero-mea: Eξ i = 0 (ii) ucorrelated: Eξ i ξ j = δ i j λ j Proof. (Mostly from Pavliotis [2014], p.20) First, suppose that X t has represetatio (3). Let s check the properties of the coefficiets. We have Eξ i = (EX t )e i (t) dt = 0 D which shows property (i). We used Fubii s Theorem to iterchage the expectatio ad the itegral, which we ca do because the assumptio that X t L 2 (Ω D) implies that X t L 1 (Ω D). To show property (ii), calculate: Eξ i ξ j = = D D D E(X s X t )e i (s)e j (t) dsdt = B(s,t)e i (s)e j (t) dsdt D D λ j e i (s)e j (s)ds = λ j δ i j, where the secod-last step follows because e j is a eigefuctio, ad the last step because e i, e j are orthogoal if i j. Agai, we used Fubii s Theorem to iterchage the expectatio ad the itegral; this will be a commo calculatio i this course ad we will usually assume it is possible to do so without further remarks. 2

3 To show covergece of the series to X t, cosider the partial sums S N = N =1 ξ e (t). The E X t S N 2 = EX 2 t + ES 2 N 2E(X t S N ) = B(t,t) + E N k,l=1 ξ k ξ l e k (t)e l (t) 2E N = B(t,t) + k e k=1λ 2 N k (t) 2E k=1 = B(t,t) N k=1 λ k e 2 k (t) ( D B(s,t) X t N =1ξ e (t) ) (just expad) X t X }{{} s e k (s) e k (t) ds (subs. for ξ ) } {{ } λ k e k (t) The fial lie goes to 0 uiformly i t, by Mercer s theorem. Example (Gaussia process). If X t is Gaussia the we ca completely specify the radom coefficiets ξ i. Ideed, ξ i N(0,λ i ), ad ξ i,ξ j are idepedet whe i j. To show that ξ i is Gaussia, we must show X t e i (t) dt is Gaussia. It is clear that if we use a Riema sum approximatio for the itegral this will be Gaussia, sice a fiite sum of Gaussia radom variables is Gaussia. The limit of a sequece of Gaussia radom variables which coverges i probability (amely the Riema sums) is also Gaussia; this is somethig that ca ca be show by cosiderig the characteristic fuctios ad usig Levy s cotiuity theorem. To show that ξ i,ξ j are idepedet for i j, it is eough to kow they are ucorrelated ad Gaussia, sice ucorrelated Gaussia radom variables are idepedet. Note this will ot be true i geeral. This provides a simple way to simulate a Gaussia process, by trucatig ad discretizig its KL expasio. Example (Browia motio). Oe way to defie Browia motio (the Wieer process) W t is by the followig properties: (i) it is Gaussia; (ii) it has mea m(t) = 0, covariace B(s, t) = mi(s, t). (iii) with probability 1, t W t is cotiuous, ad W 0 = 0. Let s calculate the KL expasio o [0,1] usig these properties. First, we fid the eigefuctios. We must solve 1 (s t)e k (t) dt = λ k e k (s) = Takig d ds, d 2 ds 2 gives 0 s 0 1 te k (t)dt + se k (t)dt = λ k e k (s). (4) s 1 λ k e k (s) = se k(s) + s e k (t)dt se k (s), λ k e k = e k. Settig s = 0,1 i (4) to fid e k (0) = 0, e k (1) = 0. Solvig this Sturm-Liouville problem gives ( λ k = π(k 1 ) 2 2 ), e k (s) = 2si (π(k 12 ) )s, k = 1,2,... 3

4 Therefore W t = k=1 2 ξ k (π(k π(k 1 2 ) si 12 ) )t, ξ k N(0,1), i.i.d. Note that this is ot the oly way to expad W t i a set of basis fuctios, for example the Haar basis is also used i some applicatios. 5.2 Browia motio 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 moved about at radom, eve whe the water appeared to be very still. He repeated the experimet with dust particles, ad foud the same behaviour, so he argued the motio was urelated to the fact that the polle came from livig matter. Several mathematicias tried to explai this behaviour (Theile, 1880, Bachelier, 1900). However the pheomeo really took off as a model i physics after a paper by Eistei i 1905, which 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. Here is a movie showig 1µm glass beads sittig i water uder a microscope: Here is aother oe, with actual polle grais (but you have to put up with the soudtrack): 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. The most commo way to defie a Browia Motio is by the followig properties: Defiitio. A Browia motio or Wieer process W t, t 0 is a real-valued stochastic process such that 4

5 (i) if t 0 < t 1 < < t, the W(t 0 ),W(t 1 ) W(t 0 ),...,W(t ) W(t 1 ) are idepedet. (ii) For all s,t 0, the radom variable W(s +t) W(s) is Gaussia, with mea zero ad variace s. (iii) With probability 1, t W t is cotiuous, ad W(0) = 0. Remark. It is possible to replace (ii) with the coditio that the icremets W(s +t) W(t) do ot deped P( W(s+t) W(t) δ) o t, plus a cotiuity coditio that lim s 0 s = 0 for all δ > 0. Oe ca the show the icremets must be Gaussia. See Briema [1992], Ch. 12, p.248. Property (i) says the icremets are idepedet. Property (ii) says the icremets are statioary (they have the same distributio for fixed icremet size), ad Gaussia. The above defiitio implies that i the example i sectio 5.1, ad vice-versa. ELFS (or see Durrett [2005], p.373.) A importat questio is whether such a process exists. The aswer is yes, ad is a subtle, techical questio that is dealt with i may probability books, e.g. Durrett [2005], p.373, Karatzas ad Shreve [1991], Briema [1992]. The major difficulty is i showig property (iii): that there exists a versio of Browia motio that is cotiuous everywhere, almost surely Browia motio as a limit of radom walks A ituitive way of thikig about Browia motio is as a limit of radom walks. Let X 1,X 2,... be iid radom variables with mea 0 ad variace 1. Cosider the sum S = j=1 X j, with S 0 = 0. This is a discrete-time process, but we ca make a cotiuous-time process by liearly iterpolatig betwee values of S. We wat the iterpolated process to approach Browia motio as the umber of steps goes to ifiity, so we will eed to scale time ad space appropriately. To figure out how, suppose time of the approximate Browia motio is t = t for some t, ad suppose we scale the jumps to have size x. We eed t, x 0, but how should they be related? Note that ES 2 =, so E( xs t/ t ) 2 ( x) 2 t/ t. Sice EWt 2 ad x = 1/. Let the iterpolated, rescaled process be W t = t, we should choose x = t. Let t = 1/, = S [t] + (t [t])s [t]+1, (5) where [t] meas the largest iteger less tha or equal to t. We would like to show that Wt of covergece. coverges i some way to Browia motio. For this, we eed a defiitio 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. 5

6 If X,X are real-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. (The former defiitio works for radom variables takig values i a path space, while the latter works also for real-valued radom variables.) We kow by the Cetral Limit Theorem that Wt d N(0, t) as. Therefore the oe-poit distributios of Wt coverge to those of Browia motio. To show that the d-poit distributios coverge uses a similar techique as i the proof of the CLT; oe cosiders the characteristic fuctios ad shows these coverge. See Karatzas ad Shreve [1991], p. 67. Showig the etire process Wt coverges i distributio to W t is sigificatly harder ad is the statemet of Doker s Ivariace Priciple; see Karatzas ad Shreve [1991] p.70. This is a geeralizatio of the CLT to path space Properties of Browia motio Scalig properties (i) W t is a Browia motio (symmetry) (ii) W t+s W s for fixed s is a Browia motio (time-homogeeity) 1 (iii) c W ct, with c > 0 is a fixed costat, is a Browia motio (scalig) (iv) tw 1/t is a Browia motio (time-iversio) Proof. (i), (ii), (iii) follow straightforwardly from the defiitio. To check (iv), we use the defiitio 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 If limsup is replaced by limif i either of the above, the limits are 1. a.s.. Proof. (i) (from Briema [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 6

7 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) For the secod part, see e.g. Briema [1992], p. 263, or Karatzas ad Shreve [1991], p The first part follows from the secod usig the time iversio property (iv) of BM. (ii) This follows from the Law of the Iterated Logarithm. Differetiability Theorem. With probability oe, Browia paths are ot Lipschitz cotiuous (ad hece ot differetiable) at ay poit. Remark. We ca see this heuristically as follows. First let s argue why it should ot be differetiable at t = 0. This implies it s ot differetiable aywhere, by the time-homogeeity property (ii) (though be careful: we should really show it s ot differetiable all poits at oce.) If it were differetiable at 0, the we would have W t W = lim t t 0 t = lim s sw 1/s = lim t W t, where W t is aother BM, by the scalig property (iv). But this limit does t exist. Remark. Here is aother heuristic argumet. We have EWt 2 so we would ot expect the derivative to exist at 0. = t, so Var( W t t ) = t = 1 t 2 t. This as t 0, Proof. (From Briema [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/. (6) Let A = {ω : there is a s [0,1] s.t. W t W s 2β t s whe t s 2/}. 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 (6) 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 C = 2 k=1 { B( ) : y k 6β }, 7

8 so 2 P(C ) k=1 P ( Wk+2 P max{ Wk+1, Wk+1 Wk, W k Wk 1 ( max { } W3/ W 2/, W2/ W 1/, W1/ 6β W1/ = P( 6β ) 3 ( 6β/ = e x2 /2 dx 2π 6β/ ( 1 6β = e x2 /2 dx 2π 6β ) 3 ) 3 } 6β ) ) The fial itegral coverges to 0 as, so P(W ) 0. Corollary. Almost surely, every sample path of W t has ifiite variatio o every fiite iterval. Proof. If a fuctio has bouded variatio o a iterval I, the it has a derivative existig almost everywhere o I. 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 γ > 1 2. Proof. See Karatzas ad Shreve [1991], Durrett [2005] Quadratic variatio Eve though Browia motio is ot differetiable, hece has ifiite variatio, it actually has fiite quadratic variatio. This will be a very importat property that we will use whe costructig the stochastic itegral. Defiitio. The pth-variatio of a fuctio f o [a,b] give partitio σ = {t 0,t 1,...,t }, with a = t 0 < t 1 < < t = b is V p [a,b] ( f ;σ) = f (t i ) f (t i 1 ) p. Defiitio. The quadratic variatio of a fuctio f o [0,t] is ofte writte as Qt σ ( f ) V[0,t] 2 ( f,σ), or just if the fuctio is clear. Explicitly, we have Q σ t Q σ t ( f ) = i=0 f (t i+1 ) f (t i ) 2. 8

9 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. 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. W t+1 W ti 2 m.s. t. 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. Proof. (From Koralov ad Siai [2010], p. 269.) ( ( ) 2 E Qt σ (W t ) t = E (Wti W ti 1 ) [ 2 (t i t i 1 ) ]) 2 = = 4 E [ (W ti W ti 1 ) 2 (t i t i 1 ) ] 2 E(W ti W ti 1 ) 4 + (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 σ (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 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 ), (7) where t 0 < t 1 < < t, ad F i are Borel sets. This seems a lot like the Markov property that we studied i Lectures 2&3 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 (7) is actually the defiitio of a geeral Markov process, 1 ad that Browia motio satisfies this coditio (Koralov ad Siai [2010], p.278.) Therefore Browia motio is our first example of a cotiuous-time, cotiuous-space Markov process; there are may more to come. 1 For a formulatio of the Markov property i terms of σ-algebras, see Lecture 3 otes. 9

10 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 a trasitio desity p(x,t y,s) as 1 P(Γ,t y,s) = e (x y)2 2(t s) dx = p(x, t y, s)dx (8) Γ 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. We were able to write is dow explicitly i (8), because we kow the icremets of Browia Motio are Gaussia. A approach to studyig Markov processes that is commo i the Physics literature 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.) We will explore such techiques o the homework. For ow, let s cosider how the trasitio probabilities for Browia motio evolve, both forward ad backward i time. The trasitio probability desity for Browia motio is statioary i both time ad space: p(x, t y, s) = p(x y,t s 0,0). I additio, oe ca check that it satisfies the PDE This is a versio of the Kolmogorov forward equatio. It also satisfies a PDE i s,y: p t = 1 2 p, p(x,0 y,0) = δ(x y). (9) 2 x2 p s = 1 2 p, p(x,t y,t) = δ(x y). (10) 2 y2 This is a versio of the Kolmogorov backward equatio. It should be solved backward i time i s, startig at s = t. 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 very similar: Defiitio. The geerator of a Markov process is the operator A defied o a subset D(A ) of the set of bouded, measurable fuctios f by A f lim t 0 T t f f t E x f (X t ) f (x) = (A f )(x) = lim, (11) t 0 t The set D(A ) o which this limit exists is the domai of A. We have itroduced the operator T t f (x) E x f (X t ) = f (y)p(dy,t x,0), (12) which acts o the set of bouded, measurable fuctios f. Here E x meas the expected value, give X 0 = x. The covergece is uderstood as the orm covergece, i.e. we mea that lim t 0 t 1 (T t f f ) A f = 0, for a appropriate orm o the fuctio space. R 10

11 Remark. The set of operators {T t } t 0 forms a operator semigroup, i.e. T s T t f = T s+t f. Note the relatio to the Chapma-Kolmogorov equatios P s P t = P s+t i Lecture 3. You ca show this by cosiderig the geeral versio of the Chapma-Kolmogorov equatios: P(B,s x,t) = R P(B,x y,u)p(dy,u x,t), t u s. Let s calculate the geerator of Browia motio. Suppose f C 0 (R). E x f (X t ) f (x) 1 (A f )(x) = lim = lim ( f (y) f (x))p(y,t x,0)dy t 0 t t 0 t R 1 t [ ] = lim s f (y) f (x))p(y,s x,0)dy ds t 0 t 0 R( 1 t = lim f (y) f (x)) t 0 t 0 R( 1 2 p 2 y 2 (y,s x,0)dyds 1 = lim t 0 t 1 = lim t 0 t = 1 2 t 0 t 0 2 f x 2 (x) R 1 2 f 2 y 2 p(y,s x,0)dyds E x 2 f x 2 (X t) (sice ca t put t uder itegral) (usig the forward equatio) (after itegratig by parts twice) Note that i the secod step, it would be ice to differetiate uder the itegral ad replace t p with 1 2 yy p, directly, but we do t kow that we ca sice p t t=0 is ubouded, so we have to get aroud that by first writig p as a time itegral of its time derivative. This shows that the geerator of Browia motio is the Laplacia: A f = f. Note the aalogy to x 2 Lecture 3: 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 A o a Baach space to be the ifiitesimal geerator of a Markov process (alteratively, a strogly cotiuous oe-parameter semigroup.) Why are we iterested i the geerator? This is the fudametal object from which we ca describe the evolutio of probability ad measurable statistics. Let s start with the latter. Let s defie u(x,t) E x f (X t ) = T t f (x). To fid out how u evolves i time, we calculate: We obtai the u t = lim T t+h f T t f h 0 h Backward Kolmogov Equatio. u t T h (T t f ) T 0 (T t f ) = lim = A T t f = A u. (13) h 0 h = A u, u(x,0) = f (x). (14) 11

12 Note that we could have factored the other way i (13), ad foud that u t = lim T t (T h f ) T t (T h f ) = T t A f, h 0 h assumig that we ca iterchage the limit ad expectatio. (See the hadout for a discussio of coditios uder which this is possible; basically we eed to adapt the Bouded/Mootoe/Domiated Covergece theorems to the case of radom variables.) This shows that for a certai class of processes, T t A = A T t, i.e. the geerator ad trasitio operator commute. Now cosider how the probability desity evolves. This derivatio will be formal ad heuristic, but you ca fid more rigorous derivatios elsewhere. The probability desity at time t is ρ(y,t) = ρ 0 (x)p(y,t x,0)dx, where ρ 0 (y) is the iitial desity. Therefore 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 that u t = T ta f = p(y,t x,0)a f (y)dy = (Ay p) f (y)dy. Here A is the adjoit of A with respect to the L 2 ier product, i.e. ua v = va u, ad the subscript is a remider that it acts o the y-variables of p. We also kow that u t = p t (x,t y,0) f (y)dy. (We ca differetiate uder the itegral provided p t exists ad is locally i L 1. As i the case for Browia motio above, this wo t hold at t = 0, but we ca use the same trick to get aroud it so we just assume it holds here.) Sice the two calculatios hold for all test fuctios f, we have that p t = Ay p(y,t x,0) (weakly). Itegratig over the iitial desity ρ 0 (x) gives Forward Kolmogov Equatio. ρ t = A ρ, ρ(0,y) = ρ 0 (y). (15) 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, (15) must be iterpreted i weak form, for example whe the probability measure is restricted to a submaifold so it cotais δ-fuctios. Refereces Leo Briema. Probability. SIAM, Rick Durrett. Probability: Theory ad Examples. Thomso, 3rd editio, G. Grimmett ad D. Stirzaker. Probability ad Radom Processes. Oxford Uiversity Press, I. Karatzas ad S. E. Shreve. Browia Motio ad Stochastic Calculus. Spriger, L. B. Koralov ad Y. G. Siai. Theory of Probability ad Radom Processes. Spriger, G. A. Pavliotis. Stochastic Processes ad Applicatios. Spriger,

Lecture 7: Brownian motion

Lecture 7: Brownian motion Mirada Holmes-Cerfo Applied Stochastic Aalysis, Sprig 2017 Lecture 7: Browia motio Readigs Recommeded: Pavliotis (2014) sectio 1.3, 2.1-2.3 Optioal: Grimmett ad Stirzaker (2001) 8.5, 8.6, 9.6, 13.1-13.3

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Appendix to: Hypothesis Testing for Multiple Mean and Correlation Curves with Functional Data

Appendix to: Hypothesis Testing for Multiple Mean and Correlation Curves with Functional Data Appedix to: Hypothesis Testig for Multiple Mea ad Correlatio Curves with Fuctioal Data Ao Yua 1, Hog-Bi Fag 1, Haiou Li 1, Coli O. Wu, Mig T. Ta 1, 1 Departmet of Biostatistics, Bioiformatics ad Biomathematics,

More information

MATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS

MATH4822E FOURIER ANALYSIS AND ITS APPLICATIONS MATH48E FOURIER ANALYSIS AND ITS APPLICATIONS 7.. Cesàro summability. 7. Summability methods Arithmetic meas. The followig idea is due to the Italia geometer Eresto Cesàro (859-96). He shows that eve if

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

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

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

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

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

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

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

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and

MATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f

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

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology

Advanced Analysis. Min Yan Department of Mathematics Hong Kong University of Science and Technology Advaced Aalysis Mi Ya Departmet of Mathematics Hog Kog Uiversity of Sciece ad Techology September 3, 009 Cotets Limit ad Cotiuity 7 Limit of Sequece 8 Defiitio 8 Property 3 3 Ifiity ad Ifiitesimal 8 4

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

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

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

Lecture 6: Spectral decompositions of stochastic processes

Lecture 6: Spectral decompositions of stochastic processes Lecture 6: Spectral decompositios of stochastic processes Readigs Recommeded: Grimmett ad Stirzaker (2001) Chapter 9. Chori ad Hald (2009) Chapter 6 Pavliotis (2014), 1.2 Optioal: Yaglom (1962), Ch. 1,

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

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

Section 5.5. Infinite Series: The Ratio Test

Section 5.5. Infinite Series: The Ratio Test Differece Equatios to Differetial Equatios Sectio 5.5 Ifiite Series: The Ratio Test I the last sectio we saw that we could demostrate the covergece of a series a, where a 0 for all, by showig that a approaches

More information

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.

5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0. 40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig

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

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

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

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

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

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

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

MAS111 Convergence and Continuity

MAS111 Convergence and Continuity MAS Covergece ad Cotiuity Key Objectives At the ed of the course, studets should kow the followig topics ad be able to apply the basic priciples ad theorems therei to solvig various problems cocerig covergece

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

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

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

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

This section is optional.

This section is optional. 4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore

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

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

The Riemann Zeta Function

The Riemann Zeta Function Physics 6A Witer 6 The Riema Zeta Fuctio I this ote, I will sketch some of the mai properties of the Riema zeta fuctio, ζ(x). For x >, we defie ζ(x) =, x >. () x = For x, this sum diverges. However, we

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

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

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

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n Review of Power Series, Power Series Solutios A power series i x - a is a ifiite series of the form c (x a) =c +c (x a)+(x a) +... We also call this a power series cetered at a. Ex. (x+) is cetered at

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

b i u x i U a i j u x i u x j

b i u x i U a i j u x i u x j M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here

More information

Honors Calculus Homework 13 Solutions, due 12/8/5

Honors Calculus Homework 13 Solutions, due 12/8/5 Hoors Calculus Homework Solutios, due /8/5 Questio Let a regio R i the plae be bouded by the curves y = 5 ad = 5y y. Sketch the regio R. The two curves meet where both equatios hold at oce, so where: y

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

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

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

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

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

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

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

Riesz-Fischer Sequences and Lower Frame Bounds

Riesz-Fischer Sequences and Lower Frame Bounds Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..

More information

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we

More information

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define 5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o

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

Chapter 10 Advanced Topics in Random Processes

Chapter 10 Advanced Topics in Random Processes ery Stark ad Joh W. Woods, Probability, Statistics, ad Radom Variables for Egieers, 4th ed., Pearso Educatio Ic.,. ISBN 978--3-33-6 Chapter Advaced opics i Radom Processes Sectios. Mea-Square (m.s.) Calculus

More information

Introduction to Probability. Ariel Yadin

Introduction to Probability. Ariel Yadin Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways

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

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

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

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

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

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

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

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

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