Lecture 3: Randomly Stopped Processes

Size: px
Start display at page:

Download "Lecture 3: Randomly Stopped Processes"

Transcription

1 STAT 498: Selected Topcs Stochastc Processes Wter 2018 Lecture 3: Radomly Stopped Processes Lecturer: Fag Ha Ja 29 Dsclamer: These otes have ot bee subjected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde ths class oly wth the permsso of the Lecturer. Ths chapter s, aga, a rearragemet of results PG Wald s Equatos For troducg Wald s marvelous research o radomly stopped processes, we have to frst formally troduce the cocept of stoppg tme. Defto 1 Stoppg tme. Let F := σx 1,..., X represet the sgma-feld geerated by the jot dstrbuto of X 1,..., X or other words, all formato or varato geerated by X 1,..., X. We say a radom varable T takg values 1, 2,... to be a stoppg tme adapted to F f for every = 1, 2,..., T = F. Wth the defto of stoppg tme md, we are ow ready to preset Wald s equato, a corerstoe of the theory of sequetal aalyss. Theorem 2. Let X be a sequece of..d. radom varables adapted to F := σx 1,..., X, wth EX 1 = µ, µ <. Let T be a stoppg tme adapted to F. Set S = X. The Moreover, f EX 1 = 0 ad EX 2 1 <, the Wald s frst equato ES T = µet, wheever ET <. Wald s secod equato ES 2 T = EX 2 1 ET, wheever ET <. Proof. 1 We prove the frst equalty. By workg o the sequece X µ stead, we may assume µ = 0. Let X = X + X, wth the coveto that X + = X1X 0 ad X = X1X < 0. The EX 1 = 0 mples that EX + 1 = EX 1 <. Notcg that 1T = 1 1T 1 F 1, we have X s depedet of 1T, whch yelds T E X + = E X + 1T = EX + 1T = EX + P T = EX+ E 1T = EX 1 + ET. Smlarly we obta E T X = EX1 ET. Lettg go to fty ad usg the mootoe covergece theorem, we further obta T T E X + = ET EX 1 + ad E X = ET EX1. 3-1

2 3-2 Lecture 3: Radomly Stopped Processes Accordgly, T Wald s secod equato ES T = E X + T X = ET EX+ 1 X 1 = ET EX 1. 2 We the move o to prove the secod equalty. Realzg that S T = X 1T, we have We hece have ES 2 T = EX 2 1T = EX 2 P T = EX1 2 ET. lm ES2 T = EX1 2 ET < provded EX 2 1 ad ET s smaller tha fty. Some stadard argumets yeld lm ES 2 T = ES2 T ad hece fsh the proof. Remark 3. Do we really eed..d.-ess, or just some frst or up to secod order statoary requremet? Oe terestg observato stemmg from Wald s equato s the followg decouplg theorem, whch opes a gate to a ew set of techques that wll be the focus of the ext few sectos. Theorem 4. Let X be a sequece of..d. r.v. s wth EX 1 = µ wth µ <. Let T be a stoppg tme adapted to F. Let X be a depedet copy of X ad also depedet of T. Set S = X 1 + +X ad S = X X. The ES T = E S T, wheever ET <. Moreover, f EX 1 = 0 ad EX 2 1 <, the ES 2 T = E S 2 T, wheever ET <. Remark 5. Of ote, S T ad S T could be completely dfferet. For example, cosder the smplest radom walk wth P X = 1 = P X = 1 = 1/2 ad T := f : S = a or S = b for some postve tegers a, b. We the have S T must be ether a or b, whle S T s ot ecessarly to be so. Before dvg to more detals aroud S T ad ultmately T tself, t s better to frst uderstad the requremet ET <. The followg theorem gves such a aalyss for the frst passage crossg tme. Theorem 6. Let X be..d. wth P X 1 = 0 < 1. Defe T a,b = f 1 : S a, b wth T a,b = ff S a, b for all. The, there exsts a costat γ 0, 1 such that whch mmedately gves ET a,b <. P T a,b > γ, Proof. WLOG, let s assume there exst ɛ, δ such that δ > 0, ɛ 0, 1 ad P X 1 δ ɛ > 0. Take r > b a/δ. The P S r > b a P X 1 δ,..., X r δ, S r > b a P X 1 δ,..., X r δ, rδ > b a ɛ r.

3 Lecture 3: Radomly Stopped Processes 3-3 Accordgly, P T a,b > r = P T a,b > r, 1 ɛ r. mr P = m=1 =m 1r+1 mr P =m 1r+1 mr =m 1r+1 X b a, m = 1,..., X b a, m = 1,..., X b a Ths completes the proof va choosg γ = 1 ɛ r. 3.2 Trucato method The ultmate goal of ths secto s to prove the followg ear-weakest set of codtos o the stoppg tme T ad the dstrbuto X 1 uder whch Wald s frst equato holds. Theorem 7. Let X be a sequece of..d. r.v. s. Assume that EX 1 = 0 mplyg E X 1 <. The ES T = 0 f EK X T < Itroducto to K-fucto bouds Gve a radom varable X 0 symmetrc recallg that symmetrcty s usually ot a requremet such that E X <, the K-fucto K X y s mplctly defed as the soluto of the followg equato: K X y 2 = ye[x 2 X K X y]. K X y s exstece ad uqueess s guarateed by the fact that the fucto E[X 2 /t 2 X /t] s strcly decreasg ad cotuous at the rage t 0,, wth values ragg from to 0. The followg proposto hts oe tuto o troducg the K-fucto. Proposto 8. We have E S 2K X. Proof. By defto, we have K X y 2 = yex 2 1 X KX y + yk X ye X 1 X >KX y, yeldg ad We the obta K X 2 EXX1 2 X KX E X 1 X >KX K X. E S E X 1 X K X + E X 1 X >K X [EX 2 1 X KX ] 1/2 + E X 1 X >KX 2K X,

4 3-4 Lecture 3: Radomly Stopped Processes where the secod equalty uses the Holder s equalty ad symmetrcty of X, whch mples EX 1 X K X s cetered. The followg boud shows that K X s a sharp cotrol o E S. Proposto 9. If X, X are..d. symmetrc r.v. s wth L 1 orm exstg. The, for ay = 1, 2,..., 1 4e K X E S 2K X. Proof. We have already proved the upper boud, ad hece are focused o the lower boud ths proof. By defto of the K-fucto, we have ether EX 2 1 X KX 1 2 K X 2 or E X 1 X >KX 1 2 K X. 1 If the latter holds, by defto of the K fucto, whch mples P X > K X = P [X 2 X K X > K X 2 ] E[X2 X K X ] K X 2 = 1, E S E X 1#: X >K X =1 [ = E X 1 1 X1 >K X [ = E =2 1 X K X =2 1 X K X ] ] E X 1 X >KX 1 1 1E X 1 X >KX > e 1 E X 1 X >KX. 2 If EX 2 1 X KX 1 2 K X 2. Settg Y := X 1 X K X, remdg Y 2 ad depedece, E Y 4 = EY <j EY 2 EYj 2 K X 2 EY 2 + 3[ EY 2 ] 2 = K X 2 E Y 2 + 3[E Y 2 ] 2. Holder s equalty wth 1/p = 2/3 ad 1/q = 1/3 gves E [ Y 2 = E Y 2/3 Y 4/3] [ E ] 2/3 [ Y E Y 4] 1/3. Substtutg the above equalty to the prevous oe, we obta E Y Usg the fact that 1 2 K X 2 EY 2 E Y [E Y 2 ] 3/2 [K X 2 E Y 2 + 3[E Y 2 ] 2 ] 1/2. K X 2, we further have [K X 2 /2] 3/2 [K X 4 /2 + 3K X 4 /2] 1/2 = 1 10 K X, K X 2, by symmetry

5 Lecture 3: Radomly Stopped Processes 3-5 To fsh the proof, we employ the followg geometry equalty Lemma PG1999 whch wll be left as a HW: Lemma 10. If X are depedet symmetrc r.v. s. The for all measurable sets A symmetrc about the org ad for all t > 0, P X 1 X A > t 2P S > t, yeldg for all p > 0, E X 1 X A p 2E S p. Ths completes the proof. We ed ths secto wth the followg proposto, whose proof s left as HW. Proposto 11. We have, wheever E X <, as y, K X y wll mootocally crease to fty; K X y 2 /y wll mootocally crease to EX 2 ; ad K X y/y wll mootocally decrease to Proof of Theorem 7 We are ow ready to state the proof of the ma theorem ths chapter. Our am s to show It s because, f the, we have E max T S cek X T. 3.1 E sup S T cek X T <, < whch, combed wth the domated covergece theorem, gves ES T = E lm S T = lm ES T, where each term the last term, by the proof of Wald s frst equato, wll always equal to 0. Step 1. For provg Equato 3.1, we frst defe the followg two symbols: The followg observatos are mmedate: κ T := mk : 2 k > T ad T := 2 κ T 1. 2 κ T 1 T, T T, 1T 2 k = 1T 2 k+1 1, ad 1κ T 1 k = 1T 2 k, 3.2 where the last equalty s due to 1κ T 1 k = 12 κ T 2 k+1 = 12 κ T 1 2 k+1 1 = 1T 2 k+1 1 = 1T 2 k. Step 2. We are ow usg two famous martgale theorems, whose proofs are left to the readers. Theorem 12. If M s a martgale, the the stopped process M T s also a martgale wth regard to the same fltrato.

6 3-6 Lecture 3: Radomly Stopped Processes Theorem 13 Burkholder-Davs-Gudy equalty. Assume X to be a martgale dfferece sequece, the for ay p 1, E max S p/2. k p E X 2 k [] Usg the above two theorems, takg p = 1 BDG equalty, we ow have E max S = E sup S T = E sup T 1/2 T 1/2. X 1T ce X 2 1T = ce X 2 Step 3. Ths step cotas the ma body of the proof. We ow are usg a smlar sequece-splttg techque as what we have see the proof of Erdos equalty. T ce X 2 1/2 = ce 1/2 X 2 1T 2 k <2 k+1 1/2 c E X 2 1T 2 k <2 k+1 1/21T c E 2 k = c 2 k <2 k+1 X 2 E 2 k <2 k+1 X 2 1/2P T 2 k, where the last equalty s due to that T s a stoppg tme ad T 2 k F 2k 1 s depedet of 2 k <2 k+1 X2. To cotue the proof, we eed the followg verso of Khch s equalty amed as Marckewcz equalty, whose proof wll be left as a HW. Lemma 14 Marckewcz equalty. Gve p 1, there exst costats c p, C p oly depedg o p such that, f Y are cetered ad depedet ad L p, the c 1 p E Y 2 p/2 p E Y Cp E p/2. Y 2 By Marckewcz equalty wth p = 1, we ow have 1/2 E X 2 c1 E X = c 1 E S 2 k, 2 k <2 k+1 2 k <2 k+1

7 Lecture 3: Radomly Stopped Processes 3-7 whch yelds T ce X 2 1/2 c P T 2 k E S 2 k c ce ce ce P T 2 k K X 2 k 1T 2 k K X 2 k 1T 2 k K X 2 k 1κ T 1 kk X 2 k κ T 1 ce 2 k/2 K X 2 k 2 k/2. Usg Proposto 11, we have 2 k/2 K X 2 k s mootocally creasg, so that κ T 1 ce Ths the fshes the proof. κ T 1 2 k/2 K X 2 k 2 k/2 ce 2 κ T 1/2 K X 2 κ T 1 2 k/2 κ T 1 = ce2 κ T 1/2 K X 2 κ T 1 cek X 2 κ T 1 2 κ T 1 2 cek X 2 κ T 1 cek X T. 2 κ T k/2 3.3 Radomly stopped sums: the grad decouplg The proof of Theorem 7 rests o provg that E max T S cek X T, where the LHS s a expectato o both T ad X 1,..., X, whle the RHS volves a expectato oly o T thk about the dfferece. I other words, vew of Proposto 9, what we really proved s that E max S ce max S, T T where T s detcally dstrbuted as T whle depedet of X 1,..., X. observed studyg Wald s equatos. Ths s exactly what we have

8 3-8 Lecture 3: Radomly Stopped Processes The grad theorem of ths chapter s the followg oe, whch geeralzes the above argumet to a bgger famly of fuctos: A α := Φ : R + R +, Φ0 = 0, Φ odecreasg, cotuous, ad Φcx c α Φx for all c 2, x 0. Theorem 15. Fx ay α > 0. Let Φ A α. Let X 1, X 2,... be depedet ot ecessarly detcally dstrbuted radom varables. Set S = X ad let T be a stoppg tme adapted to F := σx 1,..., X. The there exst costats c α, C α oly depedg o α such that c α Ea T,Φ E max [T ] Φ S C α Ea T,Φ, 3.3 where I other words, we have a,φ := E max k [] Φ S k. c α E max Φ S E max Φ S C α E max Φ S. [ T ] [T ] [ T ] The proof of the lower boud Equato 3.3 s extremely volved, ad wo t be covered ths class. Our ma focus, stead, s o provg the upper boud. For ths, let s frst troduce some otato: S m,] := max S j S m = max X m X j ; m<j m<j S := S 0,] = max j S j ; X := max j [] X j ; y = := sup : a δy; a := E max j [] Φ S j. Note that ad a are fxed umbers. Fxg y > 0, we wrte T y = mm [T ] : ΦS m y wth the coveto that T y = f such a m does ot exst. Proof. The proof s separated to three steps. Step 1. We frst trasfer the orgal problem to somethg easer, volvg oly XT what we have see H-J equalty. Ths s due to the followg lemma. Lemma 16. We have P ΦS T βy, ΦX T a T < δy 6 α δ β 3 α 1 + δ P ΦS T y ad a T, smlar to wheever δ > 0 ad β > 3 α 1 + δ. Proof. We frst prove the frst probablty boud. The followg several observatos are mmedate. 1 For ay a, b, c 0, we have Φa + b + c Φ3 maxa, b, c Φ3a + Φ3b + Φ3c 3 α Φa + Φb + Φc. 2 O the set ΦS T βy, β > 1 mples that T y T.

9 Lecture 3: Radomly Stopped Processes O the set T y T, ST = max S j max S j j T y T y<j T S Ty max S j S Ty + S Ty T y<j T max S j S Ty + S T Ty 1 + X Ty. y<j T y 4 Puttg the above three observatos together, we have, o the set ΦS T βy, sce β > 3α 1 + δ > 1, we have T y T, ad hece whch yelds S T max S j S Ty + S T Ty 1 + X Ty = ST y,t ] + S T y<j T y y 1 + X Ty, ΦST 3 α ΦST y,t ] + Φ S T y 1 + Φ X Ty. 5 Usg the defto of T y, we have ΦS T y 1 y. 6 Usg the defto of, we have a T δy mples T. 7 Combg 4-6 yelds P ΦST βy, ΦXT a T < δy [ P 3 α ΦST y,t ] + Φ S T y 1 + Φ X Ty βy, ΦXT < δy, T ] P [3 α y + δy + ΦSTy,T ] βy, ΦX T < δy, T ] [ ] P 3 α ΦST y,t ] yβ 3α 1 + δ 3 α y 1 β 3 α 1 + δ 1 EΦS T y,t ]. 8 Gve 7, what s left s to upper boud EΦST y,t ]. For ths, we have 1 EΦST y,t ] = EΦSj,T ] 1T y = j, T > j = Combg 7 ad 8, we have EΦS j, ] 1T y = j, T > j EΦS j, ] P T y = j, T > j by defto of T ad T y EΦ2S P T y = j, T > j usg S j, ] 2S 2 α EΦS P T y < T 2 α δyp ΦS T y usg the defto of ad T y. P ΦS T βy, ΦX T a T < δy 6 α δy yβ 3 α 1 + δ P ΦS T y,

10 3-10 Lecture 3: Radomly Stopped Processes ad completes the proof. Step 2. For boudg EΦST usg Lemma 16, we eed the followg good-lambda equalty troduced by Burkholder ad Gudy, whose proof s left as a HW. Lemma 17 Good-lambda equalty. Let U ad V be two o-egatve radom varables, ad let ɛ be a postve umber. Suppose there exst postve reals β, γ, δ such that β 1 > ɛ ad The P U βy, V < δy ɛp U y for all y > 0. EU β 1 ɛ 1 δ 1 EV. Usg Lemma 17, settg ɛ = 6 α δ β 3 α 1 + δ wth βɛ < 1, we obta EΦST δ 1 β 1 ɛ 1 E ΦXT a T δ 1 β 1 ɛ 1 EΦXT + Ea T. It remas to boud EΦX T by Ea T. Step 3. We boud EΦXT va the followg lemma. Lemma 18. Let d, e be two sequeces of real radom varables adapted to the same creasg sequece of σ-felds F. Assume the two sequeces are taget, or other words, that for all, P d F 1 = P e F 1. The, for all t > 0, P sup d j > t 2P sup e j > t. Proof. Let := f : e > t. The P sup d j > t = P sup d j > t, = + P sup = E1 sup d j > t1 = + P E E = = sup 1d j > t1 = + P < 1d j > t1 j + P < d j > t, < d j > t, < E E1d j > t1 j F j 1 + P < E 1 je1d j > t F j 1 + P <

11 Lecture 3: Radomly Stopped Processes 3-11 where the last equalty uses the fact that 1 j = 1 1 < j 1 s adapted to F j 1. We ca the cotue to wrte P sup d j > t = E 1 je1e j > t F j 1 + P < = E 1e j > t + P < = E1e > t + P < E1 sup e j > t + P 2P. Ths completes the proof of the lemma. sup e j > t Let d = Φ X 1T, e = Φ X 1T, ad sup j< F = σx 1,..., X, X 1,..., X, e j > t where X s a depedet copy of X. It s the clear that d ad e are taget sce, gve F 1, 1T s a costat the oly addtoal radomess to d ad e comes through X ad X, whch are..d.. Furthermore, we have ΦX T = sup Φ X 1T We the apply Lemma 18 to obta, for ay t 0, Itegratg over t, we have EΦXT 2EΦ X T 2EΦ max S S 1 T 2 α+1 EΦ max S = 2 α+1 Ea T. T Ths completes the whole proof. ad P ΦX T > t 2P Φ X T > t. Φ X T = sup Φ X.1T 2EΦ max S + max S 1 2EΦ2 max S T T T 3.4 From dscrete to cotuous: Embeddg theorem Ths secto wll preset getly the embeddg theorem o how to coect dscrete radom processes to cotuous oes. The followg s a exteso to Theorem 15. Theorem 19. Fx α > 0 ad let Φ A α. Let N t t 0 be a real-valued process cotuous o the rght wth lmts from the left wth depedet cremets. Let T be a stoppg tme adapted to σn s, s t. The c α Ea T E sup Φ N s C α Ea T, 0 s T where a t := E sup Φ N s. 0 s t

12 3-12 Lecture 3: Radomly Stopped Processes Proof. For a fxed t > 0, we take a subdvso of [0, t], τ = s : 0 such that 0 = s 0 < s 1 < < s 1 < s = t, ad max s +1 s 0 as. For N we take N s j = j N s N s 1 + N s 0. By defto, N s N s 1 s a dscrete tme process wth depedet cremets. We choose τ N such that τ +1 cotas τ. Settg T ω = s +1 o s < T t s +1 makes T a stoppg tme wth respect to F s 0 where F s := σn u : u s. Also, T 0 s a decreasg sequece covergg to T t. Theorem 15 the yelds c α E sup Φ Ñs E sup Φ N s C α E sup Φ Ñs. s τ,s T s τ,s T s τ,s T The rght cotuty assumpto o N t, t 0 ad the Lebesgue DCT the mples Lastly, usg Lebesgue MCT fshes the proof. c α E sup Φ Ñs E sup Φ N s C α E sup Φ Ñs. s T t s T t s T t The ext s a exteso of Levy-type equalty to cotuous tme processes, whose proof follows the same techque as used above. Proposto 20 Levy-type equalty for cotuous tme processes. Let N t, t 0, N 0 = 0, be a realvalued procress cotuous the rght wth lmts from the left wth cremets that are statoary ad depedet. The, for all y 0, Proof. For a fxed t, let wth τ = s : 0. Set P sup N s > y s t 9P 30 N t > y. N s j = s = 2 t j N s N s 1 + N s 0. Use the Levy-type equalty, Theorem 6 Chapter 2, for the above sequece of..d. cremets we obta for fxed 1 ad all y > 0, P N s > y 9P 30 N t > y. sup s τ,s t The result follows usg the DCT by lettg. The followg s a combato of the prevous two theorems Theorem 21. Let N t, t 0, N 0 = 0, be a real-valued process cotuous o the rght wth lmts from the left wth statoary ad depedet cremets. Let T be a stoppg tme adapted to σn s, s t. Fx α > 0. The, for ay Φ A α, there exst costat c α, C α depedg oly o α s.t. c α EΦ ÑT E sup Φ N s C α EΦ ÑT. 0 s T

13 Lecture 3: Radomly Stopped Processes 3-13 Proof. The left s a trval boud. The left s by codtog argumet ad the above proposto: E sup t T Ths completes the proof. Φ N t C α E sup Φ Ñt 9C α EΦ30 ÑT 9C α 30 α EΦ ÑT. t T The above theorem mmedately mples the followg corollary, whch s kow as the Burkholder-Gudy equalty. Corollary 22. Let B t, t 0 be a stadard Browa moto ad T a stoppg tme adapted to σb s, s > 0. The for all p > 0, c p E B 1 p ET p/2 E sup B t p C 1 C p 2 E B 1 p ET p/2. t T Proof. Usg Theorem 21 ad otcg that fsh the proof. E B T p = E T 1/2 B1 p = ET p/2 E B 1 p

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

Econometric Methods. Review of Estimation

Econometric Methods. Review of Estimation Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators

More information

Non-uniform Turán-type problems

Non-uniform Turán-type problems Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at

More information

1 Solution to Problem 6.40

1 Solution to Problem 6.40 1 Soluto to Problem 6.40 (a We wll wrte T τ (X 1,...,X where the X s are..d. wth PDF f(x µ, σ 1 ( x µ σ g, σ where the locato parameter µ s ay real umber ad the scale parameter σ s > 0. Lettg Z X µ σ we

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted

More information

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d 9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,

More information

Parameter, Statistic and Random Samples

Parameter, Statistic and Random Samples Parameter, Statstc ad Radom Samples A parameter s a umber that descrbes the populato. It s a fxed umber, but practce we do ot kow ts value. A statstc s a fucto of the sample data,.e., t s a quatty whose

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

Lecture 02: Bounding tail distributions of a random variable

Lecture 02: Bounding tail distributions of a random variable CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome

More information

Functions of Random Variables

Functions of Random Variables Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,

More information

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015 Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts

More information

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions. Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos

More information

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall

More information

Extreme Value Theory: An Introduction

Extreme Value Theory: An Introduction (correcto d Extreme Value Theory: A Itroducto by Laures de Haa ad Aa Ferrera Wth ths webpage the authors ted to form the readers of errors or mstakes foud the book after publcato. We also gve extesos for

More information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

Lecture 4 Sep 9, 2015

Lecture 4 Sep 9, 2015 CS 388R: Radomzed Algorthms Fall 205 Prof. Erc Prce Lecture 4 Sep 9, 205 Scrbe: Xagru Huag & Chad Voegele Overvew I prevous lectures, we troduced some basc probablty, the Cheroff boud, the coupo collector

More information

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)

. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1) Chapter 7 Fuctos o Bouded Varato. Subject: Real Aalyss Level: M.Sc. Source: Syed Gul Shah (Charma, Departmet o Mathematcs, US Sargodha Collected & Composed by: Atq ur Rehma (atq@mathcty.org, http://www.mathcty.org

More information

D KL (P Q) := p i ln p i q i

D KL (P Q) := p i ln p i q i Cheroff-Bouds 1 The Geeral Boud Let P 1,, m ) ad Q q 1,, q m ) be two dstrbutos o m elemets, e,, q 0, for 1,, m, ad m 1 m 1 q 1 The Kullback-Lebler dvergece or relatve etroy of P ad Q s defed as m D KL

More information

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018 Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of

More information

The Mathematical Appendix

The Mathematical Appendix The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.

More information

5 Short Proofs of Simplified Stirling s Approximation

5 Short Proofs of Simplified Stirling s Approximation 5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:

More information

Large and Moderate Deviation Principles for Kernel Distribution Estimator

Large and Moderate Deviation Principles for Kernel Distribution Estimator Iteratoal Mathematcal Forum, Vol. 9, 2014, o. 18, 871-890 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/mf.2014.4488 Large ad Moderate Devato Prcples for Kerel Dstrbuto Estmator Yousr Slaou Uversté

More information

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971)) art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the

More information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat

More information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

Special Instructions / Useful Data

Special Instructions / Useful Data JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth

More information

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n .. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show

More information

Law of Large Numbers

Law of Large Numbers Toss a co tmes. Law of Large Numbers Suppose 0 f f th th toss came up H toss came up T s are Beroull radom varables wth p ½ ad E( ) ½. The proporto of heads s. Itutvely approaches ½ as. week 2 Markov s

More information

The Occupancy and Coupon Collector problems

The Occupancy and Coupon Collector problems Chapter 4 The Occupacy ad Coupo Collector problems By Sarel Har-Peled, Jauary 9, 08 4 Prelmares [ Defto 4 Varace ad Stadard Devato For a radom varable X, let V E [ X [ µ X deote the varace of X, where

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte

More information

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several

More information

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation. Whe solvg a vetory repleshmet problem usg a MDP model, kowg that the optmal polcy s of the form (s,s) ca reduce the computatoal burde. That s, f t s optmal to replesh the vetory whe the vetory level s,

More information

TESTS BASED ON MAXIMUM LIKELIHOOD

TESTS BASED ON MAXIMUM LIKELIHOOD ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

Beam Warming Second-Order Upwind Method

Beam Warming Second-Order Upwind Method Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet

More information

Complete Convergence for Weighted Sums of Arrays of Rowwise Asymptotically Almost Negative Associated Random Variables

Complete Convergence for Weighted Sums of Arrays of Rowwise Asymptotically Almost Negative Associated Random Variables A^VÇÚO 1 32 ò 1 5 Ï 2016 c 10 Chese Joural of Appled Probablty ad Statstcs Oct., 2016, Vol. 32, No. 5, pp. 489-498 do: 10.3969/j.ss.1001-4268.2016.05.005 Complete Covergece for Weghted Sums of Arrays of

More information

CHAPTER 4 RADICAL EXPRESSIONS

CHAPTER 4 RADICAL EXPRESSIONS 6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube

More information

Point Estimation: definition of estimators

Point Estimation: definition of estimators Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Exam: ECON430 Statstcs Date of exam: Frday, December 8, 07 Grades are gve: Jauary 4, 08 Tme for exam: 0900 am 00 oo The problem set covers 5 pages Resources allowed:

More information

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers

More information

3. Basic Concepts: Consequences and Properties

3. Basic Concepts: Consequences and Properties : 3. Basc Cocepts: Cosequeces ad Propertes Markku Jutt Overvew More advaced cosequeces ad propertes of the basc cocepts troduced the prevous lecture are derved. Source The materal s maly based o Sectos.6.8

More information

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ  1 STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Third handout: On the Gini Index

Third handout: On the Gini Index Thrd hadout: O the dex Corrado, a tala statstca, proposed (, 9, 96) to measure absolute equalt va the mea dfferece whch s defed as ( / ) where refers to the total umber of dvduals socet. Assume that. The

More information

Laboratory I.10 It All Adds Up

Laboratory I.10 It All Adds Up Laboratory I. It All Adds Up Goals The studet wll work wth Rema sums ad evaluate them usg Derve. The studet wll see applcatos of tegrals as accumulatos of chages. The studet wll revew curve fttg sklls.

More information

Supplementary Material for Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices

Supplementary Material for Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices Joata Scarlett ad Volka Cever Supplemetary Materal for Lmts o Sparse Support Recovery va Lear Sketcg wt Radom Expader Matrces (AISTATS 26, Joata Scarlett ad Volka Cever) Note tat all ctatos ere are to

More information

Exchangeable Sequences, Laws of Large Numbers, and the Mortgage Crisis.

Exchangeable Sequences, Laws of Large Numbers, and the Mortgage Crisis. Exchageable Sequeces, Laws of Large Numbers, ad the Mortgage Crss. Myug Joo Sog Advsor: Prof. Ja Madel May 2009 Itroducto The law of large umbers for..d. sequece gves covergece of sample meas to a costat,.e.,

More information

Class 13,14 June 17, 19, 2015

Class 13,14 June 17, 19, 2015 Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral

More information

Lecture Notes to Rice Chapter 5

Lecture Notes to Rice Chapter 5 ECON 430 Revsed Sept. 06 Lecture Notes to Rce Chapter 5 By H. Goldste. Chapter 5 gves a troducto to probablstc approxmato methods, but s suffcet for the eeds of a adequate study of ecoometrcs. The commo

More information

Qualifying Exam Statistical Theory Problem Solutions August 2005

Qualifying Exam Statistical Theory Problem Solutions August 2005 Qualfyg Exam Statstcal Theory Problem Solutos August 5. Let X, X,..., X be d uform U(,),

More information

MEASURES OF DISPERSION

MEASURES OF DISPERSION MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda

More information

Ito s Stochastic Calculus

Ito s Stochastic Calculus Chapter 6 Ito s Stochastc Calculus 6.1 Itroducto I Bacheler s frst applcatos of the Weer process o the modelg the fluctuato of asset prces, the prce of a asset at tme t, X t, has a ftesmal prce cremet

More information

Lecture 07: Poles and Zeros

Lecture 07: Poles and Zeros Lecture 07: Poles ad Zeros Defto of poles ad zeros The trasfer fucto provdes a bass for determg mportat system respose characterstcs wthout solvg the complete dfferetal equato. As defed, the trasfer fucto

More information

,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ.

,m = 1,...,n; 2 ; p m (1 p) n m,m = 0,...,n; E[X] = np; n! e λ,n 0; E[X] = λ. CS70: Lecture 21. Revew: Dstrbutos Revew: Idepedece Varace; Iequaltes; WLLN 1. Revew: Dstrbutos 2. Revew: Idepedece 3. Varace 4. Iequaltes Markov Chebyshev 5. Weak Law of Large Numbers U[1,...,] : Pr[X

More information

1 Lyapunov Stability Theory

1 Lyapunov Stability Theory Lyapuov Stablty heory I ths secto we cosder proofs of stablty of equlbra of autoomous systems. hs s stadard theory for olear systems, ad oe of the most mportat tools the aalyss of olear systems. It may

More information

Lecture 9: Tolerant Testing

Lecture 9: Tolerant Testing Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have

More information

International Journal of Mathematical Archive-5(8), 2014, Available online through ISSN

International Journal of Mathematical Archive-5(8), 2014, Available online through   ISSN Iteratoal Joural of Mathematcal Archve-5(8) 204 25-29 Avalable ole through www.jma.fo ISSN 2229 5046 COMMON FIXED POINT OF GENERALIZED CONTRACTION MAPPING IN FUZZY METRIC SPACES Hamd Mottagh Golsha* ad

More information

Multivariate Transformation of Variables and Maximum Likelihood Estimation

Multivariate Transformation of Variables and Maximum Likelihood Estimation Marquette Uversty Multvarate Trasformato of Varables ad Maxmum Lkelhood Estmato Dael B. Rowe, Ph.D. Assocate Professor Departmet of Mathematcs, Statstcs, ad Computer Scece Copyrght 03 by Marquette Uversty

More information

Algorithms Theory, Solution for Assignment 2

Algorithms Theory, Solution for Assignment 2 Juor-Prof. Dr. Robert Elsässer, Marco Muñz, Phllp Hedegger WS 2009/200 Algorthms Theory, Soluto for Assgmet 2 http://lak.formatk.u-freburg.de/lak_teachg/ws09_0/algo090.php Exercse 2. - Fast Fourer Trasform

More information

Lecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions

Lecture 16: Backpropogation Algorithm Neural Networks with smooth activation functions CO-511: Learg Theory prg 2017 Lecturer: Ro Lv Lecture 16: Bacpropogato Algorthm Dsclamer: These otes have ot bee subected to the usual scruty reserved for formal publcatos. They may be dstrbuted outsde

More information

Almost Sure Convergence of Pair-wise NQD Random Sequence

Almost Sure Convergence of Pair-wise NQD Random Sequence www.ccseet.org/mas Moder Appled Scece Vol. 4 o. ; December 00 Almost Sure Covergece of Par-wse QD Radom Sequece Yachu Wu College of Scece Gul Uversty of Techology Gul 54004 Cha Tel: 86-37-377-6466 E-mal:

More information

Dimensionality Reduction and Learning

Dimensionality Reduction and Learning CMSC 35900 (Sprg 009) Large Scale Learg Lecture: 3 Dmesoalty Reducto ad Learg Istructors: Sham Kakade ad Greg Shakharovch L Supervsed Methods ad Dmesoalty Reducto The theme of these two lectures s that

More information

Research Article Some Strong Limit Theorems for Weighted Product Sums of ρ-mixing Sequences of Random Variables

Research Article Some Strong Limit Theorems for Weighted Product Sums of ρ-mixing Sequences of Random Variables Hdaw Publshg Corporato Joural of Iequaltes ad Applcatos Volume 2009, Artcle ID 174768, 10 pages do:10.1155/2009/174768 Research Artcle Some Strog Lmt Theorems for Weghted Product Sums of ρ-mxg Sequeces

More information

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers. PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg

More information

Lecture Notes Types of economic variables

Lecture Notes Types of economic variables Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte

More information

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The

More information

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?

More information

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS

UNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method

More information

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 THE ROYAL STATISTICAL SOCIETY 06 EAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 The Socety s provdg these solutos to assst cadtes preparg for the examatos 07. The solutos are teded as learg ads ad should

More information

18.657: Mathematics of Machine Learning

18.657: Mathematics of Machine Learning 8.657: Mathematcs of Mache Learg Lecturer: Phlppe Rgollet Lecture 3 Scrbe: James Hrst Sep. 6, 205.5 Learg wth a fte dctoary Recall from the ed of last lecture our setup: We are workg wth a fte dctoary

More information

A NEW LOG-NORMAL DISTRIBUTION

A NEW LOG-NORMAL DISTRIBUTION Joural of Statstcs: Advaces Theory ad Applcatos Volume 6, Number, 06, Pages 93-04 Avalable at http://scetfcadvaces.co. DOI: http://dx.do.org/0.864/jsata_700705 A NEW LOG-NORMAL DISTRIBUTION Departmet of

More information

arxiv:math/ v1 [math.gm] 8 Dec 2005

arxiv:math/ v1 [math.gm] 8 Dec 2005 arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

Marcinkiewicz strong laws for linear statistics of ρ -mixing sequences of random variables

Marcinkiewicz strong laws for linear statistics of ρ -mixing sequences of random variables Aas da Academa Braslera de Cêcas 2006 784: 65-62 Aals of the Brazla Academy of Sceces ISSN 000-3765 www.scelo.br/aabc Marckewcz strog laws for lear statstcs of ρ -mxg sequeces of radom varables GUANG-HUI

More information

Some Different Perspectives on Linear Least Squares

Some Different Perspectives on Linear Least Squares Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,

More information

ENGI 3423 Simple Linear Regression Page 12-01

ENGI 3423 Simple Linear Regression Page 12-01 ENGI 343 mple Lear Regresso Page - mple Lear Regresso ometmes a expermet s set up where the expermeter has cotrol over the values of oe or more varables X ad measures the resultg values of aother varable

More information

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout

More information

INTEGRATION THEORY AND FUNCTIONAL ANALYSIS MM-501

INTEGRATION THEORY AND FUNCTIONAL ANALYSIS MM-501 INTEGRATION THEORY AND FUNCTIONAL ANALYSIS M.A./M.Sc. Mathematcs (Fal) MM-50 Drectorate of Dstace Educato Maharsh Dayaad Uversty ROHTAK 4 00 Copyrght 004, Maharsh Dayaad Uversty, ROHTAK All Rghts Reserved.

More information

Algorithms Design & Analysis. Hash Tables

Algorithms Design & Analysis. Hash Tables Algorthms Desg & Aalyss Hash Tables Recap Lower boud Order statstcs 2 Today s topcs Drect-accessble table Hash tables Hash fuctos Uversal hashg Perfect Hashg Ope addressg 3 Symbol-table problem Symbol

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur

More information

THE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION

THE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION Joural of Scece ad Arts Year 12, No. 3(2), pp. 297-32, 212 ORIGINAL AER THE ROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION DOREL MIHET 1, CLAUDIA ZAHARIA 1 Mauscrpt receved: 3.6.212; Accepted

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

PPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104

PPCP: The Proofs. 1 Notations and Assumptions. Maxim Likhachev Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 PPCP: The Proofs Maxm Lkhachev Computer ad Iformato Scece Uversty of Pesylvaa Phladelpha, PA 19104 maxml@seas.upe.edu Athoy Stetz The Robotcs Isttute Carege Mello Uversty Pttsburgh, PA 15213 axs@rec.r.cmu.edu

More information

Unimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods

Unimodality Tests for Global Optimization of Single Variable Functions Using Statistical Methods Malaysa Umodalty Joural Tests of Mathematcal for Global Optmzato Sceces (): of 05 Sgle - 5 Varable (007) Fuctos Usg Statstcal Methods Umodalty Tests for Global Optmzato of Sgle Varable Fuctos Usg Statstcal

More information

Lecture Note to Rice Chapter 8

Lecture Note to Rice Chapter 8 ECON 430 HG revsed Nov 06 Lecture Note to Rce Chapter 8 Radom matrces Let Y, =,,, m, =,,, be radom varables (r.v. s). The matrx Y Y Y Y Y Y Y Y Y Y = m m m s called a radom matrx ( wth a ot m-dmesoal dstrbuto,

More information

Lebesgue Measure of Generalized Cantor Set

Lebesgue Measure of Generalized Cantor Set Aals of Pure ad Appled Mathematcs Vol., No.,, -8 ISSN: -8X P), -888ole) Publshed o 8 May www.researchmathsc.org Aals of Lebesgue Measure of Geeralzed ator Set Md. Jahurul Islam ad Md. Shahdul Islam Departmet

More information

Analysis of Variance with Weibull Data

Analysis of Variance with Weibull Data Aalyss of Varace wth Webull Data Lahaa Watthaacheewaul Abstract I statstcal data aalyss by aalyss of varace, the usual basc assumptos are that the model s addtve ad the errors are radomly, depedetly, ad

More information

MATH 247/Winter Notes on the adjoint and on normal operators.

MATH 247/Winter Notes on the adjoint and on normal operators. MATH 47/Wter 00 Notes o the adjot ad o ormal operators I these otes, V s a fte dmesoal er product space over, wth gve er * product uv, T, S, T, are lear operators o V U, W are subspaces of V Whe we say

More information

6.867 Machine Learning

6.867 Machine Learning 6.867 Mache Learg Problem set Due Frday, September 9, rectato Please address all questos ad commets about ths problem set to 6.867-staff@a.mt.edu. You do ot eed to use MATLAB for ths problem set though

More information

Extend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables

Extend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables ppled Mathematcal Sceces, Vol 4, 00, o 3, 637-64 xted the Borel-Catell Lemma to Sequeces of No-Idepedet Radom Varables olah Der Departmet of Statstc, Scece ad Research Campus zad Uversty of Tehra-Ira der53@gmalcom

More information