LIMIT THEOREMS FOR WEIGHTED SUMS OF INFINITE VARIANCE RANDOM VARIABLES ATTRACTED TO INTEGRALS OF LINEAR FRACTIONAL STABLE MOTIONS
|
|
- Dale Logan
- 5 years ago
- Views:
Transcription
1 LIMIT THEOREMS FOR WEIGHTED SUMS OF INFINITE VARIANCE RANDOM VARIABLES ATTRACTED TO INTEGRALS OF LINEAR FRACTIONAL STABLE MOTIONS MAKOTO MAEJIMA (KEIO UNIVERSITY) AND SAKURAKO SUZUKI (OCHANOMIZU UNIVERSITY) (Ruig head : Limit theorems for weighted sums) Abstract. Let {ξ j } be a sequece of radom variables which belog to the domai of attractio of a liear fractioal stable motio { H,α (t)} with ifiite variace. We study the covergece of weighted sums I (f) := A f(j/)ξ j with a suitable scalig A, to I(f) := f(u)d H,α(u) i distributio uder suitable assumptios o a class of determiistic fuctios f. We also show that if {f t, t 0} are the kerel fuctios from the movig average represetatio of a liear fractioal stable motio with aother idex H, the {I (f t )} coverges to a liear fractioal stable motio { H+H 1/α,α(t)}. Keywords: liear fractioal stable motio, itegral with respect to liear fractioal stable motio, slowly varyig fuctio, weighted sum. 1. Itroductio We call {X(t), t 0} a Lévy process if it has idepedet ad statioary icremets, X(0) = 0 a.s., it is stochastically cotiuous at ay t, ad almost all sample paths are right cotiuous ad have left limits. I this paper, we eed the Lévy process with time parameter ruig o R. Let {X (t), t 0} be a idepedet copy of {X(t), t 0} ad exted {X(t)} i such a way that X(t) = X ( t + 0) for t < 0. If, furthermore, the distributio of X(1) is symmetric α-stable, 0 < α 2, i the sese that E[exp iθx(1)] = exp{ c θ α }, θ R, for some c > 0, we call {X(t)} a symmetric α-stable Lévy process, ad deote it by {Z α (t), t R} throughout this paper. For simplicity, we always assume c = 1. Whe α = 2, it is othig but the stadard Browia motio up to a multiplicative costat. For 0 < H < 1 ad 0 < α 2 such that H 1, defie a liear fractioal stable α motio { H,α (t), t R} by { } H,α (t) = (t s) H 1/α + ( s) H 1/α + dz α (s), where x + = max(x, 0) ad 0 s = 0 eve for s 0. Whe α = 2, it is the fractioal Browia motio (fbm). I this paper, we are cocered with the case α < 2. Thus we always assume that H > 1/α, because if H < 1/α, almost all sample paths 1
2 of H,α (t) are owhere bouded ([5]), which is ot a iterestig case. Note that H > 1/α implies α > 1, sice H < 1. Let {X j } be idepedet ad idetically distributed radom variables such that (1.1) 1 1/α j=1 X j d Z α (1) as, d where deotes covergece i distributio. Sice α > 1, {X j } have the fiite first momet, ad we assume E[X j ] = 0. Defie a sequece of strogly depedet radom variables {ξ j } by ξ j = k Z c k X j k, j Z, where {c j } are suitably chose depedig o the problem. We wat to fid the class of f s ad coditios for the covergece of ( ) j I (f) := A f ξ j with a suitable scalig A to I(f) := f(u)d H,α (u) i distributio as. This problem was studied by Pipiras ad Taqqu [6] for the case α = 2. They gave sufficiet coditios for the covergece (1.2) 1 f H ( j ) ξ j R f(u)db H (u) i distributio as, where B H is a fbm with idex H (1/2, 1). They also cosidered the followig problem i [6]. If {f t, t 0} are the kerel fuctios from the movig average represetatio of fbm with aother idex H, the the limit {I(f t )} i the sese of covergece of fiite-dimesioal distributios is a fbm with idex H + H 1/2. The purpose of this paper is to study the limit theorems of Pipiras ad Taqqu [6] i the case α < 2. For it, we take liear fractioal stable motios { H,α (t)} istead of {B H (t)}. The rest of the paper is orgaized as follows. I Sectio 2, we propose a class of determiistic fuctios f for which stochastic itegrals with respect to liear fractioal stable motios are well-defied (also see [3]). I Sectio 3, we preset our first theorem of type (1.2) ad the proof is give. I Sectio 4, we also show that if {f t, t 0} are the kerel fuctios from the movig average represetatio of a liear fractioal stable motio with aother idex H, the {I (f t ), t 0} coverges to a liear fractioal stable motio C H+H 1/α,α(t) with some C > 0, i the sese of fiite-dimesioal distributios. 2
3 2. Stochastic itegrals Throughout the paper we deote by f g the usual covolutio: (f g)(s) = f(s u)g(u) du for measurable fuctios f ad g. I this sectio we defie stochastic itegrals with respect to d H,α. The followig fact has bee poited out already i [3] by oe of the authors of the preset paper with other coauthors. Sice the paper [3] was ot published, we explai it here with the permissio of two coauthors. I the followig, we put β = H 1/α for otatioal coveiece, ad thus β satisfies 0 < β < 1 1/α. The H,α (t) is writte as (2.1) H,α (t) = Defie, for γ > 0, The, sice (t s) β + ( s) β + = β ρ γ (x) := (see [6]), (2.1) ca be rewritte as (2.2) H,α (t) = s {(t s) β + ( s) β +} dz α (s). { 0, x 0, γ x γ 1, x < 0. 1 [0,t) (u)(u s) β 1 du = (1 [0,t) ρ β )(s) (1 [0,t) ρ β )(s) dz α (s). O the other had, for the simple fuctio of the form f(u) = f k 1 [uk,u k+1 )(u), f k R, u k < u k+1, k = 1,...,, k=1 we should defie f(u)d H,α (u) = f k ( H,α (u k+1 ) H,α (u k )). k=1 However, by (2.2), the right-had side ca be rewritte as (f ρ β )(s) dz α (s). Thus we arrive at the followig defiitio of I(f). Defiitio 2.1. Let For f Λ α,β, we defie (2.3) I(f) = Λ α,β = {f : f ρ β L α }. f(u)d H,α (u) := (f ρ β )(s) dz α (s). 3
4 Clearly, I(f) is liear with respect to f. Here, otice that the right-had side of (2.3) is well-defied thaks to the assumptio that f ρ β L α, ad it holds E [ e iθ I(f)] = exp { θ α f ρ β α Lα}, θ R. We ext study the class Λ α,β. By the Hausdorff-Youg iequality, we immediately have Lemma 2.2. Let p 1. (i) If f L 1 L p, g L 1 ad h L p, the f (g + h) L p f L p g L 1 + f L 1 h L p. (ii) If f f i L 1 L p, g g i L 1 ad h h i L p, the f (g + h ) f (g + h) i L p. Now let α ad β be as before. Recall that 1 < α < 2 ad 0 < β < 1 1 α. Theorem 2.3. Let p > 1. (Note that the case p = α is icluded.) The, there exists 1 β C = C(β, p) < such that for every f L p L 1, (2.4) f ρ β L p f L p + C f L 1, ad, therefore, (takig p = α), we have L p L 1 Λ α,β. Proof. Let g(x) = ρ β (x)1 ( 1,0) (x) ad h(x) = ρ β (x)1 (, 1] (x). The β 1 > 1 ad p(β 1) < 1 imply g L 1 ad h L p, respectively. I fact, g L 1 = 1. Therefore, applyig the previous Lemma, we have f ρ β L p f L p + f L 1 h L p, which is (2.4). The followig corollaries follow easily from Theorem 2.3. Corollary 2.4. Let f(x), x R, be a measurable fuctio vaishig outside a compact set. If there exist costats C > 0, a R, 1 < γ < 0 such that α the f Λ α,β. f(x) C x a γ, x R, Corollary 2.5. If f(x), x R, is a bouded, itegrable fuctio, the f Λ α,β. Now we discuss aother importat fuctio belogig to Λ α,β. This fuctio will be treated agai i Sectio 4. We also metio the fact (Theorem 2.6), which is ot used i this sectio but will be used i Sectio 4. 4
5 For γ R ad t R, we put { (t u) γ + ( u) γ f t,γ (u) = +, γ 0, 1 (0,t] (u), γ = 0, u R. Recall that this fuctio appeared i (2.1): (2.5) H,α (t) = f (u) dz α (u), β = H 1/α(> 0). If 1 α < γ < 0, the applyig Corollaries 2.4 ad 2.5 to f t,γ1 [ A,A] ad f t,γ 1 [ A,A] c, respectively, we see that f t,γ Λ α,β, ad hece its stochastic itegral is defied ad ca be calculated explicitly as follows. Theorem 2.6. If 1 α < γ < 0, the f t,γ Λ α,β ad it holds that where B(, ) is the usual beta fuctio. Proof. By a direct calculatio we see that f t,γ (u)d H,α (u) = β B(γ + 1, β) H+γ,α (t), (2.6) f t,γ ρ β = β B(γ + 1, β) f +γ, provided that β 1 < γ < 0. Therefore, it is easy to see that f t,γ ρ β L α. Also, by the defiitio of the stochastic itegral, we ca deduce that f t,γ (u)d H,α (u) = (f t,γ ρ β )(u) dz α (u) = β B(γ +1, β) f +γ (u) dz α (u). The first equality is the defiitio ad the secod follows from (2.6). However, the extreme right-had side equals β B(γ + 1, β) H+γ,α (t) by (2.5). 3. Covergece to stochastic itegrals Our first result i the preset paper is the followig. Theorem 3.1. Let 1 < α < 2 ad 1/α < H < 1. Recall that we put β = H 1, α let c j = βj β 1 L(j), j = 1, 2, 3,..., for some slowly varyig fuctio L(x), x > 0, ad defie ξ j = c k X j k, j Z, k=1 where {X j } j= is a sequece of idepedet idetically distributed radom variables itroduced i (1.1).The 1 ( ) j d f ξ H j f(u)d H,α (u) as L() for every piece-wise cotiuous fuctio f(x), x R, such that f(u) (1 + u ) (1+ɛ) for some ɛ > 0. 5
6 Here f(u) g(u) meas that there exists K > 0 satisfyig f(u) Kg(u) for all u R. Remark 3.2. Note that {c j } above satisfies that j=1 c j a < for some a < α. The the sequece of radom variables {ξ j } belogs to the domai of attractio of H,α (t), because it satisfies the coditios (a) ad (b) i the followig result, which is a kow result o the domai of attractio of the liear fractioal stable process H,α (t). See the theorem below. Therefore, if f is a simple fuctio with compact support, our assertio is already kow, although we do ot use it here, ad our purpose here is to exted it for more geeral fuctios. Theorem 3.3 ([4]). Let 1 < α 2, 1/α < H < 1 ad let {c j } j= be a sequece of real umbers such that j c j a < for some a < α. Suppose that there exists a L() which is slowly varyig at such that 1 (a) lim β L() c j = 1, j=1 (b) c j = O ( j β 1 L(j) ) as j. The [t] 1 f.d. ξ H j H,α (t) as, L() j=1 where f.d. meas covergece of all fiite dimesioal distributios. We ext proceed to the proof of Theorem 3.1. First, otice that ( ) j f ξ j = ( ) j f c k X j k = ( ) j f c j m X m. m Z j=m+1 Therefore, puttig k=1 (3.1) g (s) := we ca rewrite the sum as follows: 1 f H L() ( j j>[s] f ) ξ j = 1 ( ) j cj [s] β L(), ( j g 1/α ) X j. Thus the weighted sum of ξ j is represeted by that of X j. The covergece of the latter is already discussed ad our mai tool here is the followig theorem, which is essetially due to [4] although the coditios are modified a little. A similar result is also foud i Avram ad Taqqu [1]. Theorem 3.4 ([4]). Let {X j } be radom variables i (1.1) ad suppose that fuctios g, g 1, g 2,... defied o R satisfy the followig coditios: (A) g g a.e. as, where g (u) g(u) at u = u 0 meas that g (u ) g(u 0 ) wheever u u 0. 6
7 (B) g g as i L α+ɛ L α ɛ for some ɛ > 0, where g (u) = g ([u]/), u R, = 1, 2, 3,.... The we have 1 ( ) j d g 1/α X j g(u)dz α (u) as. We shall see that {g } i (3.1) satisfy the coditios (A) ad (B) with g = f ρ β. Let φ(x) = βx β 1 L(x), (x 0) so that c j = φ(j) (j N). Defie { c[ x] ρ () (x) = β 1 L(), x < 0, 0, x 0. The we have for x 0, ρ () (x) ρ β (x) as, where ρ β (x) is the same as before. Sice φ is regularly varyig, for ay ɛ > 0, there exists a C > 0 such that ( ) { β 1 (x ) ɛ ( ) } ɛ φ(x) x x φ(y) C + y y y for all sufficietly large x, y > 0. Sice it is harmless to chage the values of fiitely may c j s, we may, without loss of geerality, modify the value of φ(x) i a eighborhoods of the origi. Therefore, we may assume that ρ () (x) C ( ρ β+ɛ (x) + ρ β ɛ (x) ) holds for all x R ad all sufficietly large. Now we prepare the followig two lemmas to check that the above g satisfies the coditios (A) ad (B) i Theorem 3.4. Lemma 3.5. Let p > 1 1 β. (Note that the case p = α is icluded.) If ϕ ϕ i L p L 1, the (3.2) ϕ ρ () ϕ ρ β i L p. Proof. Let ρ () 1 = ρ () 1 ( 1,0). The ρ () 1 ρ β 1 ( 1,0), where the covergece is i L 1 because ρ () 1 (x) C x β 1 ɛ ad β > 0. Similarly, let ρ () 2 = ρ () 1 (, 1]. The ρ () 2 ρ β 1 (, 1], where the covergece is i L p because ρ () 2 (x) C x β 1+ɛ ad p(β 1 + ɛ) < 1. Therefore (3.2) follows from Lemma 2.2. Lemma 3.6. Let ϕ ad ϕ be measurable fuctios satisfyig (i) ϕ ϕ at all cotiuity poits of ϕ ad (ii) there exits a costat C > 0 ad a F L 1 such that ϕ (x) C ad ϕ (x) F (x). 7
8 The (3.3) ϕ ρ () ϕ ρ β a.e. Proof. Let ρ () 1 ad ρ () 2 be as i the proof of the previous lemma. If x x, the ϕ (x u) ρ () (u) ϕ(x u) ρ β (u), a.e. Therefore, because (ϕ ρ () 1 )(x ) = 0 1 ϕ (x u) ρ () (u) du 0 ϕ (x u) ρ () (u) C u β 1 ɛ, 1 < u < 0. (Choose ɛ > 0 so that β ɛ > 0.) Similarly, sice (ϕ ρ () 2 )(x ) = ϕ (u) ρ () 2 (x u) du 1 ϕ (u) ρ () 2 (x u) cost. F (u). (Notice that ρ () 2 is bouded). Thus we have which is (3.3). ϕ(x u) ρ β (u) du ϕ(u) (ρ β 1 (, 1] )(x u) du, (ϕ ρ () )(x ) = (ϕ ρ () 1 )(x ) + (ϕ ρ () 2 )(x ) (ϕ ρ β )(x), Now we are ready to prove Theorem 3.1. Sice for s R, ( ) j + [s] ( cj [s] (3.4) g (s) = g (s) = f β L() = f we ca rewrite as j=1 (3.5) g (s) = (f ρ () )([s]/) where f (x) = f([x]/). [x] ) ρ () (x) dx, It follows that f i Theorem 3.1 ad the above f satisfy the coditios of ϕ ad ϕ i Lemmas 3.5 ad 3.6. Furthermore, ϕ ρ () ad ϕ ρ β i the previous two lemmas ca be replaced with g = f ρ () ad g = f ρ β i Theorem 3.4, respectively. Therefore, by otig the followig propositio derived easily from Lemmas 3.5 ad 3.6, the proof of Theorem 3.1 is completed by Theorem 3.4. Propositio 3.7. Let g be the fuctios defied by (3.1). The, uder the coditios of Theorem 3.1, g f ρ β a.e. Furthermore, the covergece also holds i L α+ɛ L α ɛ for some ɛ > 0. 8
9 4. The case that the limit is aother liear fractioal stable motio I this sectio, we exted the followig kow story for fbm ([7]) to the case of the liear fractioal stable motio. It is show i [7] that if {f t, t 0} are the kerel fuctios from the movig average represetatio of a fbm with idex H, the the limit is a fbm with idex H + H 1. We ca ow ask what happes if we take 2 { H,α (t)} istead of {B H (t)}. The followig theorem gives us a aswer. Theorem 4.1. Let 1 < α < 2, 1/α < H < 1, 0 < H < 1/α, β = H 1/α ad f (u) = (t u) β + ( u) β +, u R. Suppose that the sequece {ξ j } satisfies the coditios of Theorem 3.1. The, the processes 1 ( ) j f H ξ j, t R L() coverge (up to costat) to the liear fractioal stable motio {βb(β +1, β) H+H 1/α,α(t), t R} i the sese of fiite-dimesioal distributios. Proof. Put ad Y (t) = Y (t) = 1 H L() f ( ) j ξ j, t R f (s)d H,α (s), t R. Sice 1 α < β < 0, it follows from Theorem 2.6 that f Λ α,β ad f (s)d H,α (s) = (f ρ β )(s)dz α (s) = βb(β + 1, β) H+H 1/α,α(t). We are goig to show that as, Y (t) coverges to Y (t) i the sese of fiitedimesioal distributios. By the Cramer-Wold method (a radom vector coverges i distributio if ad oly if all liear combiatios of its elemets do), it is eough to show that for each t R, Y (t) coverges to Y (t) i distributio. To prove it, otice that we ca rewrite the sum as follows: (4.1) where 1 H L() j=1 f ( j g,t (s) := j>[s] ) ξ j = 1 f ( j g 1/α,t ( ) j cj [s] β L(). ) X j, Moreover we ca rewrite as ( ) j + [s] ( cj [s] g,t (s) = f β L() = f [x] ) (4.2) ρ () (x) dx (4.3) = (f () ρ () )([s]/), 9
10 where f () (x) = f ([x]/). We shall show that g,t = f () ρ () satisfies the coditios (A) ad (B) i Theorem 3.4 with g = f ρ β i a similar way as before. However, this time, we caot apply Lemma 3.6, because f (u) is ot bouded. Thus we eed the followig lemma, which is a modificatio of Lemma 3.6. Lemma 4.2. Suppose ϕ ad ϕ are measurable fuctios such that (i) ϕ ϕ at all cotiuity poits of ϕ, ad (ii) there exits a costat C > 0 ad γ ( 1 < γ < 1/α) satisfyig { C x (4.4) ϕ (x) γ, t < x < 0, 0, otherwise. The ϕ ρ () ϕ ρ β a.e. Proof. Let ρ () 1, ρ () 2 be as i the proof of Lemma 3.5. By (i), if x x, the ϕ (x u)ρ () (u) ϕ(x u)ρ β (u), a.e. Therefore (ϕ ρ () 2 )(x ) = ϕ (u)ρ () 2 (x u)du because ϕ (u)ρ () 2 (x u) cost. u γ (γ > 1). (Notice that ρ () 2 is bouded.) Next we shall show (4.5) (ϕ ρ () 1 )(x ) = 0 1 ϕ (x u)ρ () (u)du ϕ(u)ρ β 1 (, 1] (x u)du 0 1 ϕ(x u)ρ β (u)du by dividig the itegral ito three cases: (1) 0 < x, (2) 1 > x ad (3) 1 < x < 0. Case (1) is easily verified, because ϕ (x u)ρ () (u) = 0. Case (2) is the same case as Lemma 3.6, sice ϕ is bouded o 1 < u < 0 ad it belogs to L 1 too. As to Case (3), let u = y be a itersectio poit of x u γ ad ρ () 1 (u), ad divide the itegral ito two parts as follows: 0 1 ϕ (x u)ρ () (u)du = Whe x u y, it follows that ( y 0 + x y ) ϕ (x u)ρ () (u)du = I 1 + I 2. ϕ (x u)ρ () (u) cost. x u γ (γ > 1) sice ρ () 1 is bouded. Whe y u 0, it follows that ϕ (x u)ρ () (u) cost. u β 1 ɛ (Note that β 1 ɛ > 1 ). Therefore Case (3) is verified. Thus we have (ϕ ρ () )(x ) = (ϕ ρ () 1 )(x ) + (ϕ ρ () 2 )(x ) (ϕ ρ β )(x). 10
11 The followig lemma plays the same role as Propositio 3.7 i the proof of Theorem 4.1. Therefore, oce we could prove Lemma 4.3, we ca complete the proof of Theorem 4.1. Lemma 4.3. Let g,t be the fuctios defied by (4.2). The, uder the coditios of Theorem 4.1, g,t f ρ β a.e. Furthermore, the covergece also holds i L α+ɛ L α ɛ for some ɛ > 0. Proof. We check that g,t = f () ρ () g = f ρ β i L α+ɛ L α ɛ ad i the sese of. To prove f () ρ () f ρ β i L α+ɛ L α ɛ, it is eough to show that f () f i L p L 1 by Lemma 3.5. Sice f () ( ) are icreasig fuctios, it follows that (4.6) f () (u) f (u). Furthermore, sice it follows that f L p L 1 ad we ca verify (4.7) lim f () (u) = f (u) a.e. ad we have that f () f L α+ɛ L α ɛ, by Lemma 3.5 as metioed. i L p L 1, which implies that f () ρ () f ρ β i Next, we prove the covergece i the sese of. For this purpose, it is eough to check that f () ad f satisfy coditios (i) ad (ii) i Lemma 3.6 or Lemma 4.2 with the replacemet of ϕ ad ϕ by f () ad f, respectively. As to coditio (i), it is trivial because f (u) is piece-wise cotiuous. As to coditio (ii), observe that f explodes aroud u = t ad u = 0. Suppose that t < 0. (I the case that t 0, the proof is similar, so that we omit the detail.) We ca divide f ito four parts: f (u) 1 (,2t) (u) + f (u) 1 [2t,t) (u) + f (u) 1 [t,0) (u) + f (u) 1 [0, ) (u) =: f 1 (u) + f 2 (u) + f 3 (u) + 0. It follows that f 2 (u) ad f 3 (u) satisfy the coditio (ii) i Lemma 4.2, sice β > γ. As to f 1 (u), ote that f (u) = O( u β 1 ) as u. Therefore f (u) is bouded ad f (u) F (u), where F L 1, because β < 0. Applyig Lemma 3.6, we have that g,t f ρ β a.e. ACKNOWLEDGEMENT The authors would like to thak Yuji Kasahara for his may valuable commets durig this work. They are also grateful to a associate editor for his/her helpful commets o the fial versio of the paper. 11
12 Refereces [1] Avram, F. ad Taqqu, M.S.: Weak covergece of movig averages with ifiite variace. I: Eberlei, E. ad Taqqu, M.S. (Eds.), Depedece i Probability ad Statistics. Birkauser, Bosto, (1986). [2] Bigham, N.H., Goldie, C.M. ad Teugels, J.L.: Regular Variatio. New York: Cambridge Uiv. Press [3] Irisawa, M., Maejima, M. ad Shimomura, S.: A limit theorem for weighted sums of ifiite variace radom variables with log-rage depedece, KSTS/RR-03/005, Dept. of Math., Keio Uiv [4] Kasahara, Y. ad Maejima, M.: Weighted sums of i.i.d. radom variables attracted to itegrals of stable processes. Probab. Th. Rel. Fields 78, (1988). [5] Maejima, M.: A self-similar process with owhere bouded sample paths. Z. Wahrscheilichkeitstheorie verw. Gebiete 65, (1983). [6] Pipiras, V. ad Taqqu, M.S.: Covergece of weighted sums of radom variables with log-rage depedece. Stoch. Proc. Appl. 90, (2000). [7] Samoroditsky, G. ad Taqqu, M.S.: Stable No-Gaussia Processes. Lodo: Chapma ad Hall (1994). Preset Addresses: MAKOTO MAEJIMA DEPARTMENT OF MATHEMATICS, KEIO UNIVERSITY, HIYOSHI, YOKOHAMA, JAPAN. maejima@math.keio.ac.jp SAKURAKO SUZUKI GRADUATE SCHOOL OF SCIENCE AND HUMANITIES, OCHANOMIZU UNIVERSITY, TOKYO, JAPAN. suzukisakurako@aol.com 12
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 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 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 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 informationLimit distributions for products of sums
Statistics & Probability Letters 62 (23) 93 Limit distributios for products of sums Yogcheg Qi Departmet of Mathematics ad Statistics, Uiversity of Miesota-Duluth, Campus Ceter 4, 7 Uiversity Drive, Duluth,
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 informationProduct 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 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 informationLecture 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 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 information6.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 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 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 information6a 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 informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More information1 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 informationBerry-Esseen bounds for self-normalized martingales
Berry-Essee bouds for self-ormalized martigales Xiequa Fa a, Qi-Ma Shao b a Ceter for Applied Mathematics, Tiaji Uiversity, Tiaji 30007, Chia b Departmet of Statistics, The Chiese Uiversity of Hog Kog,
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 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 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 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
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 informationEntropy 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 informationSeunghee 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 informationMeasure 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 informationOn the convergence rates of Gladyshev s Hurst index estimator
Noliear Aalysis: Modellig ad Cotrol, 2010, Vol 15, No 4, 445 450 O the covergece rates of Gladyshev s Hurst idex estimator K Kubilius 1, D Melichov 2 1 Istitute of Mathematics ad Iformatics, Vilius Uiversity
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 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 informationInfinite 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 informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationLecture 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 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 informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationMAT1026 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 informationApproximation by Superpositions of a Sigmoidal Function
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 22 (2003, No. 2, 463 470 Approximatio by Superpositios of a Sigmoidal Fuctio G. Lewicki ad G. Mario Abstract. We geeralize
More informationRandom Walks on Discrete and Continuous Circles. by Jeffrey S. Rosenthal School of Mathematics, University of Minnesota, Minneapolis, MN, U.S.A.
Radom Walks o Discrete ad Cotiuous Circles by Jeffrey S. Rosethal School of Mathematics, Uiversity of Miesota, Mieapolis, MN, U.S.A. 55455 (Appeared i Joural of Applied Probability 30 (1993), 780 789.)
More 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 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 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 informationAsymptotic distribution of products of sums of independent random variables
Proc. Idia Acad. Sci. Math. Sci. Vol. 3, No., May 03, pp. 83 9. c Idia Academy of Scieces Asymptotic distributio of products of sums of idepedet radom variables YANLING WANG, SUXIA YAO ad HONGXIA DU ollege
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 information2.2. Central limit theorem.
36.. Cetral limit theorem. The most ideal case of the CLT is that the radom variables are iid with fiite variace. Although it is a special case of the more geeral Lideberg-Feller CLT, it is most stadard
More informationSection 11.8: Power Series
Sectio 11.8: Power Series 1. Power Series I this sectio, we cosider geeralizig the cocept of a series. Recall that a series is a ifiite sum of umbers a. We ca talk about whether or ot it coverges ad i
More informationECE 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 informationSelf-normalized deviation inequalities with application to t-statistic
Self-ormalized deviatio iequalities with applicatio to t-statistic Xiequa Fa Ceter for Applied Mathematics, Tiaji Uiversity, 30007 Tiaji, Chia Abstract Let ξ i i 1 be a sequece of idepedet ad symmetric
More informationTR/46 OCTOBER THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION A. TALBOT
TR/46 OCTOBER 974 THE ZEROS OF PARTIAL SUMS OF A MACLAURIN EXPANSION by A. TALBOT .. Itroductio. A problem i approximatio theory o which I have recetly worked [] required for its solutio a proof that the
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More 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 informationThe Wasserstein distances
The Wasserstei distaces March 20, 2011 This documet presets the proof of the mai results we proved o Wasserstei distaces themselves (ad ot o curves i the Wasserstei space). I particular, triagle iequality
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 information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More 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 informationMi-Hwa Ko and Tae-Sung Kim
J. Korea Math. Soc. 42 2005), No. 5, pp. 949 957 ALMOST SURE CONVERGENCE FOR WEIGHTED SUMS OF NEGATIVELY ORTHANT DEPENDENT RANDOM VARIABLES Mi-Hwa Ko ad Tae-Sug Kim Abstract. For weighted sum of a sequece
More informationSequences. Notation. Convergence of a Sequence
Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it
More informationLinear Regression Demystified
Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to
More informationGamma Distribution and Gamma Approximation
Gamma Distributio ad Gamma Approimatio Xiaomig Zeg a Fuhua (Frak Cheg b a Xiame Uiversity, Xiame 365, Chia mzeg@jigia.mu.edu.c b Uiversity of Ketucky, Leigto, Ketucky 456-46, USA cheg@cs.uky.edu Abstract
More informationA 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 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 informationki, X(n) lj (n) = (ϱ (n) ij ) 1 i,j d.
APPLICATIONES MATHEMATICAE 22,2 (1994), pp. 193 200 M. WIŚNIEWSKI (Kielce) EXTREME ORDER STATISTICS IN AN EQUALLY CORRELATED GAUSSIAN ARRAY Abstract. This paper cotais the results cocerig the wea covergece
More informationAdditional Notes on Power Series
Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here
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 informationErratum to: An empirical central limit theorem for intermittent maps
Probab. Theory Relat. Fields (2013) 155:487 491 DOI 10.1007/s00440-011-0393-0 ERRATUM Erratum to: A empirical cetral limit theorem for itermittet maps J. Dedecker Published olie: 25 October 2011 Spriger-Verlag
More informationMath 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 informationRandom Matrices with Blocks of Intermediate Scale Strongly Correlated Band Matrices
Radom Matrices with Blocks of Itermediate Scale Strogly Correlated Bad Matrices Jiayi Tog Advisor: Dr. Todd Kemp May 30, 07 Departmet of Mathematics Uiversity of Califoria, Sa Diego Cotets Itroductio Notatio
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 informationMASSACHUSETTS 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 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 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 information4x 2. (n+1) x 3 n+1. = lim. 4x 2 n+1 n3 n. n 4x 2 = lim = 3
Exam Problems (x. Give the series (, fid the values of x for which this power series coverges. Also =0 state clearly what the radius of covergece is. We start by settig up the Ratio Test: x ( x x ( x x
More 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 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 informationChapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities
Chapter 5 Iequalities 5.1 The Markov ad Chebyshev iequalities As you have probably see o today s frot page: every perso i the upper teth percetile ears at least 1 times more tha the average salary. I other
More informationMASSACHUSETTS 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 informationMath 113 Exam 3 Practice
Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This
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 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 informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
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 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 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 informationTHE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES
THE STRONG LAW OF LARGE NUMBERS FOR STATIONARY SEQUENCES Debdeep Pati Idia Statistical Istitute, Kolkata Jue 26, 2006 Abstract The traditioal proof of the strog law of large umbers usig idepedet ad idetically
More informationMath 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 informationMath 113 Exam 4 Practice
Math Exam 4 Practice Exam 4 will cover.-.. 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
More informationIt 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 informationRiesz-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 informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationA NOTE ON SPECTRAL CONTINUITY. In Ho Jeon and In Hyoun Kim
Korea J. Math. 23 (2015), No. 4, pp. 601 605 http://dx.doi.org/10.11568/kjm.2015.23.4.601 A NOTE ON SPECTRAL CONTINUITY I Ho Jeo ad I Hyou Kim Abstract. I the preset ote, provided T L (H ) is biquasitriagular
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More 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 informationMATH4822E 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 informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationMath F15 Rahman
Math 2-009 F5 Rahma Week 0.9 Covergece of Taylor Series Sice we have so may examples for these sectios ad it s usually a simple matter of recallig the formula ad pluggig i for it, I ll simply provide the
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 informationBIRKHOFF ERGODIC THEOREM
BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give
More information17. 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 informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More informationA note on self-normalized Dickey-Fuller test for unit root in autoregressive time series with GARCH errors
Appl. Math. J. Chiese Uiv. 008, 3(): 97-0 A ote o self-ormalized Dickey-Fuller test for uit root i autoregressive time series with GARCH errors YANG Xiao-rog ZHANG Li-xi Abstract. I this article, the uit
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 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 information