Partial match queries: a limit process
|
|
- May Bridget Barnett
- 5 years ago
- Views:
Transcription
1 Partial match queries: a limit process Nicolas Brouti Ralph Neiiger Heig Sulzbach Partial match queries: a limit process 1 / 17
2 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
3 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
4 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
5 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
6 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
7 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
8 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
9 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
10 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
11 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
12 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
13 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
14 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
15 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
16 Searchig geometric data ad quadtrees 1 Partial match queries: a limit process / 17
17 Model ad Previous results Poit set = {(U i, V i ), i 1} iid uiform i [0, 1] C (s) the umber of lies itersectig {x = s} i a quadtree of size Theorem (Flajolet, Goet, Puech ad Robso (199)) For ξ uiform idepedet of {(U i, V i ), i 1} E [C (ξ)] κ β where κ = Γ(β + ) 17 Γ(β + 1), β = Theorem (Cher ad Hwag (00)) For ξ uiform idepedet of {(U i, V i ), i 1} E [C (ξ)] = κ β 1 + O( β 1 ) Partial match queries: a limit process / 17
18 Idea of the method / heuristic for the costats Recursive decompositio We have Y d = max{u 1, U } ad (I, J) = Mult(Bi( 1, Y ); V, (1 V )) the C (ξ) d = 1 + C I (ξ ) + C J (ξ ) ξ (U, V ) E[C (ξ)] E[C YV (ξ )] Y Pluggig E[C (ξ)] = κ β yields 1 = E[Y β V β ] = E[Y β ] E[V β ] = (β + )(β + 1) β = 17 About the variace Var (C (ξ)) Eve whe coditioig o the first poit, the two terms are still depedet o the query lie Partial match queries: a limit process / 17
19 The cost at a fixed query lie Idea: if the query lie is fixed at s (0, 1), the we do have idepedece however, its relative positio chages i the subproblems cosider the etire process (C (s), s (0, 1)) Theorem (Flajolet, Labelle, Laforest ad Salvy 1995) E [C (0)] = Θ( 1 ) = o( β ) Theorem (Curie ad Joseph (011)) For every fixed s (0, 1), oe has E [C (s)] K 1 (s(1 s)) β/ β, K 1 = Γ(β + )Γ(β + ) Γ(β + 1) Γ(β/ + 1). Partial match queries: a limit process 5 / 17
20 Mai result Theorem There exists a radom cotiuous fuctio Z such that, as, ( ) C(s) d, s [0, 1] (Z (s), s [0, 1]). (1) K 1 β This covergece i distributio holds i the Baach space (D[0, 1], ) of right-cotiuous fuctios with left limits (càdlàg) equipped with the supremum orm. Propositio The distributio of the radom fuctio Z i (1) is a fixed poit of the followig equatio [ ( ) ( )] Z (s) =1 d s s {s<u} (UV ) β Z (1) + (U(1 V )) β Z () U U [ ( ) ( )] s U s U + 1 {s U} ((1 U)V ) β Z () + ((1 U)(1 V )) β Z (), 1 U 1 U where U ad V are idepedet [0, 1]-uiform radom variables ad Z (i), i = 1,..., are idepedet copies of the process Z, which are also idepedet of U ad V. Furthermore, Z i (1) is the oly solutio such that E[Z (s)] = (s(1 s)) β/ for all s [0, 1] ad E[ Z ] <. Partial match queries: a limit process 6 / 17
21 What does it look like = Partial match queries: a limit process 7 / 17
22 Momets ad supremum Theorem We have for all s (0, 1), as, ( Var (C (s)) B(β + 1, β + 1) β + 1 ) (1 β) 1 (s(1 s)) β β. Here, B(a, b) := 1 0 x a 1 (1 x) b 1 dx deotes the Euleria beta itegral (a, b > 0). Theorem Let S = sup s [0,1] C (s). The, as, β d d S S = sup Z (s) ad E[S ] β E[S], Var(S ) β Var(S). s [0,1] Partial match queries: a limit process 8 / 17
23 Covergece i distributio by cotractio I. Cost of the costructio of the quadtree / path legth P = D i with D i the depth of the i-th iserted poit i=1 I r the umber of poits iside the r-th child cell Q r the volume or the r-th child cell 1 We have d P α log P = P I r + 1 ad write X = r=1 (I 1,..., I ) d = Mult( 1; UV, U(1 V ), (1 U)(1 V ), (1 U)V ). Shiftig ad rescalig we obtai: P α log } {{ } X ( I r ) = P I r αi r log I r I r + 1 α log ( I r + α r=1 }{{} r=1 A r ) ( I r ) log } {{ } b Partial match queries: a limit process 9 / 17
24 Covergece i distributio by cotractio II. Geeral problem: d A recursive family of equatios X = r=1 Ar X r I r + b with (A 1,..., A, I1,..., I, b) idepedet of ((X 1 ),..., (X )) (X r, 1) iid copies of (X) The equatio coverges to a limit equatio: A r = Ir Leb(Qr ) b = 1 α log X d = r=1 ( I r ) ( + α I r ) log 1 + α Leb(Q r ) log Leb(Q r ) r=1 r=1 Leb(Q r ) X r α Leb(Q r ) log Leb(Q r ) () r=1 Formalizatio: See the right-had side of () as a trasfer map o probability meas. d (φ, ϕ) = if{ X Y : L (X) = φ, L (Y ) = ϕ} o M = {probability measures µ : x dµ < } o cotractio (ca shift!) o M 0 = {µ M : xdµ = 0} cotractio Partial match queries: a limit process 10 / 17
25 Covergece for partial match processes s (U, V ) (I (1),..., I () ) d = Mult( 1;UV, U(1 V ), (1 U)(1 V ), (1 U)V ) 1 C (s) d = {s<u} [ C (1) I (1) + 1 {s U} [ C () I () ( s U ( 1 s 1 U ) + C () I () ( )] s U ( )] 1 s 1 U ) + C () I () Partial match queries: a limit process 11 / 17
26 Covergece for partial match processes s (U, V ) (I (1),..., I () ) d = Mult( 1;UV, U(1 V ), (1 U)(1 V ), (1 U)V ) 1 C (s) d = {s<u} [ C (1) I (1) + 1 {s U} [ C () I () ( s U ( 1 s 1 U ) + C () I () ( )] s U ( )] 1 s 1 U ) + C () I () Heuristic: If β C ( ) coverges, we should have β C ( ) Z ( ) satisfyig [ ( ) ( )] Z (s) =1 d s s {s<u} (UV ) β Z (1) + (U(1 V )) β Z () U U [ ( ) ( )] s U s U + 1 {s U} ((1 U)V ) β Z () + ((1 U)(1 V )) β Z () 1 U 1 U Partial match queries: a limit process 11 / 17
27 Covergece i D[0, 1] by cotractio argumets I. Let (X ) be D[0, 1]-valued radom variables with where X d = K r=1 A (r) X (r) + b, 1, I (r) Neiiger ad Sulzbach (011+) (A (1),..., A (K ) ) are radom liear ad cotiuous operators o D[0, 1] b is a D[0, 1]-valued radom variable I (1),..., I (K ) are radom itegers betwee 0 ad 1 (X (1) ),..., (X (K ) ) are distributed like (X ) (A (1),..., A (K ), b, I (1),..., I (K ) ), (X (1) ),..., (X (K ) ) are idepedet Partial match queries: a limit process 1 / 17
28 Covergece i D[0, 1] by cotractio argumets I. Let (X ) be D[0, 1]-valued radom variables with where X d = K r=1 A (r) X (r) + b, 1, I (r) Neiiger ad Sulzbach (011+) (A (1),..., A (K ) ) are radom liear ad cotiuous operators o D[0, 1] b is a D[0, 1]-valued radom variable I (1),..., I (K ) are radom itegers betwee 0 ad 1 (X (1) ),..., (X (K ) ) are distributed like (X ) (A (1),..., A (K ), b, I (1),..., I (K ) ), (X (1) ),..., (X (K ) ) are idepedet Example: here, because of the rescalig, we have ( A (1) I (1) ) β ( ) : f 1 { U} f U Partial match queries: a limit process 1 / 17
29 Covergece i D[0, 1] by cotractio argumets II. For a radom liear operator A write A := E[ A op] 1/ with A op := sup A(x) x =1 Neiiger ad Sulzbach (011+) (A1) CONVERGENCE AND CONTRACTION. we have A (r), b < for all r = 1,..., K ad 0 there exist radom operators A (1),..., A (K ) o D[0, 1] ad a D[0, 1]-valued radom variable b such that K ( ) b b + A (r) A (r) + 1 {I (r) r=1 0 }A(r) R() R() 0 for all l N, [ ] E 1 (r) {I {0,...,l} {}} A(r) op 0 [ K ] L = lim sup E A () r R(I () r ) op < 1. R() r=1 (A) EXISTENCE AND EQUALITY OF MOMENTS. E[ X ] < for all ad E[X 1 (t)] = E[X (t)] for all 1, N 0, t [0, 1]. Partial match queries: a limit process 1 / 17
30 Covergece i D[0, 1] by cotractio argumets III. Neiiger ad Sulzbach (011+) (A) EXISTENCE OF A CONTINUOUS SOLUTION. There exists a solutio X of the fixed-poit equatio K X = d A r X (r) + b r=1 with cotiuous paths, E[ X ] < ad E[X(t)] = E[X 1 (t)] for all t [0, 1]. (A) PERTURBATION CONDITION. X = W + h where h h 0 with h D[0, 1] ad radom variables W i D[0, 1] such that there exists a sequece (r ) with, as, P (W / D r [0, 1]) 0. Here, D r [0, 1] D[0, 1] deotes the set of fuctios o the uit iterval, for which there is a decompositio of [0, 1] ito itervals of legth as least r o which they are costat. (A5) RATE OF CONVERGENCE. R() = o ( log m (1/r ) ). Partial match queries: a limit process 1 / 17
31 Existece of a cotiuous solutio Defie a complete tree T = 0 {1,,, } with (U u, V u), u T, iid uiform o [0, 1] a startig fuctio h(s) = (s(1 s)) β/ a iteratio/mixig operator G : [0, 1] C[0, 1] C[0, 1] G(x, y; f 1, f, f, f )(s) = [ ( s ) ( s )] 1 {s<x} (xy) β f 1 + (x(1 y)) β f x x [ ( ) ( )] s x s x + 1 {s x} ((1 x)y) β f + ((1 x)(1 y)) β f 1 x 1 x For every ode u T, let Lemma Z u 0 = h Z u +1 = G(Uu, Vu; Z u1, Z u, Z u, Z u ) Z = Z, 0, is a o-egative martigale Partial match queries: a limit process 15 / 17
32 Existece of a cotiuous solutio Defie a complete tree T = 0 {1,,, } with (U u, V u), u T, iid uiform o [0, 1] a startig fuctio h(s) = (s(1 s)) β/ a iteratio/mixig operator G : [0, 1] C[0, 1] C[0, 1] G(x, y; f 1, f, f, f )(s) = [ ( s ) ( s )] 1 {s<x} (xy) β f 1 + (x(1 y)) β f x x [ ( ) ( )] s x s x + 1 {s x} ((1 x)y) β f + ((1 x)(1 y)) β f 1 x 1 x For every ode u T, let Lemma Z u 0 = h Z u +1 = G(Uu, Vu; Z u1, Z u, Z u, Z u ) Z = Z, 0, is a o-egative martigale Partial match queries: a limit process 15 / 17
33 Existece of a cotiuous solutio Defie a complete tree T = 0 {1,,, } with (U u, V u), u T, iid uiform o [0, 1] a startig fuctio h(s) = (s(1 s)) β/ a iteratio/mixig operator G : [0, 1] C[0, 1] C[0, 1] G(x, y; f 1, f, f, f )(s) = [ ( s ) ( s )] 1 {s<x} (xy) β f 1 + (x(1 y)) β f x x [ ( ) ( )] s x s x + 1 {s x} ((1 x)y) β f + ((1 x)(1 y)) β f 1 x 1 x For every ode u T, let Lemma Z u 0 = h Z u +1 = G(Uu, Vu; Z u1, Z u, Z u, Z u ) Z = Z, 0, is a o-egative martigale Partial match queries: a limit process 15 / 17
34 Uiform covergece of the mea Propositio There exists ε > 0 such that sup t β E[P t (s)] µ 1 (s) = O(t ε ). s [0,1] sup t β E[P t (s)] µ 1 (s) sup s [0,1] s δ t β E[P t (s)] µ 1 (s) + sup t β E[P t (s)] µ 1 (s). s (δ,1/] Propositio (Almost mootoicity) For ay s < 1/ ad ε [0, 1 s), we have [ ( )] s + ε E[P t (s)] E P t(1+ε). 1 + ε s ɛ 0 1 Partial match queries: a limit process 16 / 17
35 Thak you! Partial match queries: a limit process 17 / 17
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 informationThis 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 informationST5215: Advanced Statistical Theory
ST525: Advaced Statistical Theory Departmet of Statistics & Applied Probability Tuesday, September 7, 2 ST525: Advaced Statistical Theory Lecture : The law of large umbers The Law of Large Numbers The
More informationSUMMARY OF SEQUENCES AND SERIES
SUMMARY OF SEQUENCES AND SERIES Importat Defiitios, Results ad Theorems for Sequeces ad Series Defiitio. A sequece {a } has a limit L ad we write lim a = L if for every ɛ > 0, there is a correspodig iteger
More information1 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 informationConvergence 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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 3 9/11/2013. Large deviations Theory. Cramér s Theorem
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 3 9//203 Large deviatios Theory. Cramér s Theorem Cotet.. Cramér s Theorem. 2. Rate fuctio ad properties. 3. Chage of measure techique.
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationMASSACHUSETTS 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 information62. 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 informationNotes 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 information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationMath 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 informationDistribution 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 informationProbability and Random Processes
Probability ad Radom Processes Lecture 5 Probability ad radom variables The law of large umbers Mikael Skoglud, Probability ad radom processes 1/21 Why Measure Theoretic Probability? Stroger limit theorems
More information5 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 informationLECTURE 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 informationLecture 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 informationLecture 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 informationSolutions 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 informationLearning Theory: Lecture Notes
Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic
More information1.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 informationChapter 7 Isoperimetric problem
Chapter 7 Isoperimetric problem Recall that the isoperimetric problem (see the itroductio its coectio with ido s proble) is oe of the most classical problem of a shape optimizatio. It ca be formulated
More informationMathematical Statistics - MS
Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios
More informationProbability 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 informationHOMEWORK #10 SOLUTIONS
Math 33 - Aalysis I Sprig 29 HOMEWORK # SOLUTIONS () Prove that the fuctio f(x) = x 3 is (Riema) itegrable o [, ] ad show that x 3 dx = 4. (Without usig formulae for itegratio that you leart i previous
More informationIIT JAM Mathematical Statistics (MS) 2006 SECTION A
IIT JAM Mathematical Statistics (MS) 6 SECTION A. If a > for ad lim a / L >, the which of the followig series is ot coverget? (a) (b) (c) (d) (d) = = a = a = a a + / a lim a a / + = lim a / a / + = lim
More informationChapter 2 Transformations and Expectations
Chapter Trasformatios a Epectatios Chapter Distributios of Fuctios of a Raom Variable Problem: Let be a raom variable with cf F ( ) If we efie ay fuctio of, say g( ) g( ) is also a raom variable whose
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More informationChapter 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 information1 = δ2 (0, ), Y Y n nδ. , T n = Y Y n n. ( U n,k + X ) ( f U n,k + Y ) n 2n f U n,k + θ Y ) 2 E X1 2 X1
8. The cetral limit theorems 8.1. The cetral limit theorem for i.i.d. sequeces. ecall that C ( is N -separatig. Theorem 8.1. Let X 1, X,... be i.i.d. radom variables with EX 1 = ad EX 1 = σ (,. Suppose
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More information6. Uniform distribution mod 1
6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which
More informationSTAT Homework 2 - Solutions
STAT-36700 Homework - Solutios Fall 08 September 4, 08 This cotais solutios for Homework. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better isight.
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More informationAMS570 Lecture Notes #2
AMS570 Lecture Notes # Review of Probability (cotiued) Probability distributios. () Biomial distributio Biomial Experimet: ) It cosists of trials ) Each trial results i of possible outcomes, S or F 3)
More informationAdvanced 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 information7.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 informationReal Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)
Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is
More informationSequences 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 information32 estimating the cumulative distribution function
32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio
More informationMASSACHUSETTS 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 informationEcon 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.
Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio
More informationMATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1
MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The
More informationChapter 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 informationLecture 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 information1 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 informationLecture 2: Concentration Bounds
CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationAssignment 1 : Real Numbers, Sequences. for n 1. Show that (x n ) converges. Further, by observing that x n+2 + x n+1
Assigmet : Real Numbers, Sequeces. Let A be a o-empty subset of R ad α R. Show that α = supa if ad oly if α is ot a upper boud of A but α + is a upper boud of A for every N. 2. Let y (, ) ad x (, ). Evaluate
More informationMATH301 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 informationSequences and Limits
Chapter Sequeces ad Limits Let { a } be a sequece of real or complex umbers A ecessary ad sufficiet coditio for the sequece to coverge is that for ay ɛ > 0 there exists a iteger N > 0 such that a p a q
More informationLECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS
PRIL 7, 9 where LECTURE LINER PROCESSES III: SYMPTOTIC RESULTS (Phillips ad Solo (99) ad Phillips Lecture Notes o Statioary ad Nostatioary Time Series) I this lecture, we discuss the LLN ad CLT for a liear
More informationChapter 2 The Monte Carlo Method
Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful
More informationMTH Assignment 1 : Real Numbers, Sequences
MTH -26 Assigmet : Real Numbers, Sequeces. Fid the supremum of the set { m m+ : N, m Z}. 2. Let A be a o-empty subset of R ad α R. Show that α = supa if ad oly if α is ot a upper boud of A but α + is a
More informationLecture 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 informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationDefinition 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 informationNotes 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 informationSingular 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 information2. The volume of the solid of revolution generated by revolving the area bounded by the
IIT JAM Mathematical Statistics (MS) Solved Paper. A eigevector of the matrix M= ( ) is (a) ( ) (b) ( ) (c) ( ) (d) ( ) Solutio: (a) Eigevalue of M = ( ) is. x So, let x = ( y) be the eigevector. z (M
More informationANSWERS TO MIDTERM EXAM # 2
MATH 03, FALL 003 ANSWERS TO MIDTERM EXAM # PENN STATE UNIVERSITY Problem 1 (18 pts). State ad prove the Itermediate Value Theorem. Solutio See class otes or Theorem 5.6.1 from our textbook. Problem (18
More informationMath 341 Lecture #31 6.5: Power Series
Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series
More information7.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 informationDetailed proofs of Propositions 3.1 and 3.2
Detailed proofs of Propositios 3. ad 3. Proof of Propositio 3. NB: itegratio sets are geerally omitted for itegrals defied over a uit hypercube [0, s with ay s d. We first give four lemmas. The proof of
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationCHAPTER 1 SEQUENCES AND INFINITE SERIES
CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig
More informationECE 901 Lecture 12: Complexity Regularization and the Squared Loss
ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality
More informationLecture 20: Multivariate convergence and the Central Limit Theorem
Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece
More informationSome Basic Probability Concepts. 2.1 Experiments, Outcomes and Random Variables
Some Basic Probability Cocepts 2. Experimets, Outcomes ad Radom Variables A radom variable is a variable whose value is ukow util it is observed. The value of a radom variable results from a experimet;
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationNotes 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 informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationWe 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 informationIntroduction 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 informationIntroduction 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 informationAssignment 5: Solutions
McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece
More informationMAS111 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 informationComplex Analysis Spring 2001 Homework I Solution
Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle
More informationPRELIM PROBLEM SOLUTIONS
PRELIM PROBLEM SOLUTIONS THE GRAD STUDENTS + KEN Cotets. Complex Aalysis Practice Problems 2. 2. Real Aalysis Practice Problems 2. 4 3. Algebra Practice Problems 2. 8. Complex Aalysis Practice Problems
More informationEE 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 informationf(x)g(x) dx is an inner product on D.
Ark9: Exercises for MAT2400 Fourier series The exercises o this sheet cover the sectios 4.9 to 4.13. They are iteded for the groups o Thursday, April 12 ad Friday, March 30 ad April 13. NB: No group o
More information1 Lecture 2: Sequence, Series and power series (8/14/2012)
Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim
More informationSTAT 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 informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationlim 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 informationArchimedes - numbers for counting, otherwise lengths, areas, etc. Kepler - geometry for planetary motion
Topics i Aalysis 3460:589 Summer 007 Itroductio Ree descartes - aalysis (breaig dow) ad sythesis Sciece as models of ature : explaatory, parsimoious, predictive Most predictios require umerical values,
More informationMa 530 Infinite Series I
Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li
More informationMachine Learning Brett Bernstein
Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio
More informationCS/ECE 715 Spring 2004 Homework 5 (Due date: March 16)
CS/ECE 75 Sprig 004 Homework 5 (Due date: March 6) Problem 0 (For fu). M/G/ Queue with Radom-Sized Batch Arrivals. Cosider the M/G/ system with the differece that customers are arrivig i batches accordig
More informationSolutions to Final Exam Review Problems
. Let f(x) 4+x. Solutios to Fial Exam Review Problems Math 5C, Witer 2007 (a) Fid the Maclauri series for f(x), ad compute its radius of covergece. Solutio. f(x) 4( ( x/4)) ( x/4) ( ) 4 4 + x. Sice the
More informationFall 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 informationECE534, Spring 2018: Final Exam
ECE534, Srig 2018: Fial Exam Problem 1 Let X N (0, 1) ad Y N (0, 1) be ideedet radom variables. variables V = X + Y ad W = X 2Y. Defie the radom (a) Are V, W joitly Gaussia? Justify your aswer. (b) Comute
More informationf(w) w z =R z a 0 a n a nz n Liouville s theorem, we see that Q is constant, which implies that P is constant, which is a contradiction.
Theorem 3.6.4. [Liouville s Theorem] Every bouded etire fuctio is costat. Proof. Let f be a etire fuctio. Suppose that there is M R such that M for ay z C. The for ay z C ad R > 0 f (z) f(w) 2πi (w z)
More information2.1. Convergence in distribution and characteristic functions.
3 Chapter 2. Cetral Limit Theorem. Cetral limit theorem, or DeMoivre-Laplace Theorem, which also implies the wea law of large umbers, is the most importat theorem i probability theory ad statistics. For
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More information