Bounds for the Sum of Dependent Risks and Worst. Value-at-Risk with Monotone Marginal Densities

Size: px
Start display at page:

Download "Bounds for the Sum of Dependent Risks and Worst. Value-at-Risk with Monotone Marginal Densities"

Transcription

1 Bouds for the Sum of Depedet Risks ad Worst Value-at-Risk with Mootoe Margial Desities RUODU WANG, LIANG PENG AND JINGPING YANG Jue 23, 202 Abstract I quatitative risk maagemet, it is importat ad challegig to fid sharp bouds for the distributio of the sum of depedet risks with give margial distributios, but a uspecified depedece structure. These bouds are directly related to the problem of obtaiig the worst Value-at-Risk of the total risk. Usig the idea of the complete mixability, we provide a ew lower boud for ay give margial distributios ad give a ecessary ad sufficiet coditio for the sharpess of this ew boud. For the sum of depedet risks with a idetical distributio, which has either a mootoe desity or a tail-mootoe desity, the explicit values of the worst Value-at-Risk ad the bouds o the distributio of the total risk are obtaied. Some examples are give to illustrate the ew results. Keywords: Complete mixability, Mootoe desity, Sum of depedet risks, Value-at- Risk. Mathematics Subject Classificatios (2000): 60E05, 60E5 JEL Classificatios: G0 School of Mathematics, Georgia Istitute of Techology, Atlata, GA , USA. ruodu.wag@math.gatech.edu School of Mathematics, Georgia Istitute of Techology, Atlata, GA , USA. peg@math.gatech.edu Correspodig author. LMEQF, Departmet of Fiacial Mathematics, Ceter for Statistical Sciece, Pekig Uiversity, Beijig, 0087, Chia. yagjp@math.pku.edu.c

2 Itroductio Let X = (X,, X ) be a risk vector with kow margial distributios F,, F, deoted as X i F i, i =,, ad let S = X + + X be the total risk. For the purpose of risk maagemet, it is of importace to fid the best-possible bouds for the distributio of the total risk S whe the depedece structure is uspecified, amely m + (s) = if{p(s < s) : X i F i, i =,, }, () ad M + (s) = sup{p(s < s) : X i F i, i =,, }. (2) See Embrechts ad Puccetti [6] for discussios o such problems i risk maagemet. Sice techiques for hadlig M + (s) are very similar to those for m + (s), we shall focus o m + (s) i this paper. First let us review some kow results o m + (s). Rüschedorf [] foud m + (s) whe all margial distributios have the same uiform or biomial distributio; Deuit et al. [] ad Embrechts et al. [2] used copulas to yield the so-called stadard bouds, which are o loger sharp for 3, ad discussed some applicatios; Embrechts ad Puccetti [4] provided a better lower boud whe all margial distributios are the same ad cotiuous, ad some results whe partial iformatio o the depedece structure is available; Embrechts ad Höig [3] provided a geometric iterpretatio to highlight the shape of the depedece structures with the worst VaR scearios; Embrechts ad Puccetti [5] exteded this problem to multivariate margial distributios ad provided results similar to the uivariate case. I summary, for 3, exact bouds were oly foud for the homogeous case (F = = F = F) i Rüschedorf [] where F is uiform or biomial ad i Wag ad Wag [4] where F has a mootoe desity o its support ad satisfies a mea coditio. Besides the above results o m + (s), Rüschedorf [] associated a equivalet dual optimizatio problem with the bouds for a geeral fuctio 2

3 of X,, X istead of the total risk S. The bouds m + (s) ad M + (s) directly lead to the sharp bouds o quatile-based risk measures of S. A widely used measure is the so-called Value-at-Risk (VaR) at level α, defied as VaR α (S ) = if{s R : P(S s) α}. The boud o the above VaR is called the worst Value-at-Risk sceario. Derivig sharp bouds for the worst VaR is of great iterest i the recet research of quatitative risk maagemet; see Embrechts ad Puccetti [6] ad Kaas et al. [8] for more details. I this paper, we first provide a ew lower boud o m + (s), which is easy to calculate. Usig the idea of the joitly mixable distributios, we give a ecessary ad sufficiet coditio for this boud to be the true value of m + (s). See Sectio 2 for details. I Sectio 3 we employ a special class of copulas to fid m + (s) ad the worst Value-at-Risk whe all the margial distributios are idetical ad have a mootoe or tail-mootoe desity. The methods are illustrated by some examples. Some coclusios are draw i Sectio 4. Some proofs are put i the appedix. 2 Bouds for the sum with geeral margial distributios Throughout, we idetify probability measures with the correspodig distributio fuctios. Let X = (X,, X ) ad S = X + + X. For ay distributio F, we use F (t) = if{s R : F(s) t} to deote the (geeralized) iverse fuctio ad deote by F a the coditioal distributio of F o [F (a), ) for a [0, ), i.e., F a (x) = max { F(x) a a, 0} for x R. It is straightforward to check that for u [0, ], F a (u) = F (( a)u + a). I additio, we defie F (x) = lim a F a (x). I this paper, o specific probability space is assumed ad discussios are focused o distributios, sice m + (s) oly depeds o s ad the distributios F,, F. 3

4 2. Geeral bouds I this sectio, we will give a geeral lower boud o m + (s). Before showig this boud, we eed some defiitios ad lemmas. Defiitio 2.. The radom vector X = (X,, X ) with margial distributios F,, F is called a optimal couplig for m + (s) if P(X + + X < s) = m + (s). It is kow that the optimal couplig for m + (s) always exists (see the itroductio i Rüschedorf [2] for istace). The followig lemma is Propositio 3(c) of Rüschedorf [], which will be used later. Lemma 2.. Suppose F,, F are cotiuous. The there exits a optimal couplig X = (X,, X ) for m + (s) such that {S s} = {X i F i (m + (s))} for each i =,,. Next we itroduce the cocept of completely mixable ad joitly mixable distributios. Defiitio 2.2. (completely mixable ad joitly mixable distributios). A uivariate distributio fuctio F is -completely mixable (-CM) if there exist idetically distributed radom variables X,, X with the same distributio F such that P(X + + X = C) = (3) for some C R. 2. The uivariate distributio fuctios F,, F are joitly mixable (JM) if there exist radom variables X,, X with distributio fuctios F,, F respectively, such that (3) holds for some C R. The defiitio of the CM distributios is formally give i Wag ad Wag [4] although the cocept has bee used i variace reductio problems earlier (see Gaffke ad Rüschedorf 4

5 [7], Kott ad Smith [9], Rüschedorf ad Uckelma [3]). Some examples of -CM distributios iclude the distributio of a costat (for ), uiform distributios (for 2), Normal distributios (for 2), Cauchy distributios (for 2), biomial distributios B(, p/q) with p, q N (for = q), bouded mootoe distributios o [0, ] with /m E(X) /m (for m). See Wag ad Wag [4] for more details of the CM distributios. The cocept of JM distributios is first itroduced i this paper as a geeralizatio of the CM distributios. Obviously, F,, F are JM distributios whe F = = F = F ad F is -CM. The followig propositio gives a ecessary coditio for JM distributios ad the coditio is sufficiet for ormal distributios. The proof is give i the appedix. Propositio Suppose F,, F are JM with fiite variace σ 2,, σ2. The max i σ i 2 σ i. (4) 2. Suppose F i is N(µ i, σ 2 i ) for i =,,. The F,, F are JM if ad oly if (4) holds. i= Remark 2.. Due to the complexity of multivariate distributioal problems, it remais ukow ad extremely difficult to fid geeral sufficiet coditios for the JM distributios. Before presetig the mai results o the relatioship betwee the bouds o m + (s) ad the joitly mixable distributios, we defie the coditioal momet fuctio Φ(t) which turs out to play a importat role i the problem of fidig m + (s). Suppose X i F i for i =,,. Defie for t (0, ), ad Φ(t) = i= E(X i X i Fi (t)) Φ() = lim t Φ(t), Φ(0) = lim t 0+ Φ(t). Obviously Φ(t) is icreasig ad cotiuous whe F i, i =,, are cotiuous. Defie Φ (x) = if{t [0, ] : Φ(t) x} 5

6 for x Φ() ad Φ (x) = for x > Φ(). Theorem 2.3. Suppose the distributios F,, F are cotiuous. () We have m + (s) Φ (s); (5) (2) For each fixed s Φ(0), the equality m + (s) = Φ (s) (6) holds if ad oly if the coditioal distributios F,a,, F,a are joitly mixable, where a = Φ (s). Proof. () It is trivial to prove the result whe Φ(0) =. So we assume Φ(0) <. Note that from Lemma 2. we kow that there exists a optimal couplig X = (X,..., X ) for m + (s) such that {S s} = {X i Fi (m + (s))} for each i =,,. Hece s E[S S s] = i= E[X i X i Fi (m + (s))] = Φ(m + (s)), which implies (5). (2) Suppose X = (X,, X ) is a optimal couplig for m + (s) such that {S s} = {X i Fi (m + (s))} for each i =,,. Whe m + (s) = Φ (s), it follows from the proof of part () that E(S S s) = s, which implies that the coditioal distributios of X,, X o the set {S s} are JM, i.e., the coditioal distributios F,a,, F,a are JM. Coversely, assume that F,a,, F,a are JM. The there exist Y F,a,, Y F,a such that Y + + Y = E(Y + + Y ) = Φ(a) s. Let X i = F i (U) {U a} + Y i {U>a}, (7) 6

7 where U U[0, ] ad is idepedet of (Y,, Y ). The it is easy to verify that X i has the distributio fuctio F i for i =,, ad m + (s) P(S < s) a = Φ (s). The other iequality m + (s) Φ (s) is show i part (). Remark It is see from the proof that the cotiuity of F i ca be removed. I a recet preprit, Puccetti ad Rüschedorff [0] established Theorem 2.3 idepedetly, where the equivalet form sup{p(s > s), X F,, X F } Φ (s) is proved without assumig the cotiuity of F i. 2. The optimal couplig is give i (7). Although the existece of such Y,, Y is guarateed by the mixable coditio, fidig Y,, Y remais quite challegig. For example, whe the margial distributios F i are idetical ad completely mixable, the depedece structure of radom variables Y,, Y may ot be uique ad is hard to be specified i geeral as discussed i Wag ad Wag [4]. 2.2 Bouds for the sum with idetical margial distributios defie Here we cosider m + (s) i the homogeeous case, i.e. F = = F F. For X F, ψ(t) = E(X X F (t)) for t (0, ), ψ() = lim t ψ(t), ψ(0) = lim t 0+ ψ(t), ψ (x) = if{t [0, ] : ψ(t) x} 7

8 for x ψ() ad ψ (x) = for x > ψ(). The followig result follows from Theorem 2.3 immediately. Corollary 2.4. Suppose F = = F F ad F is cotiuous. () We have m + (s) ψ (s/). (8) (2) For each fixed s ψ(0), the equality m + (s) = ψ (s/) (9) holds if ad oly if the coditioal distributio fuctio F a is -completely mixable, where a = ψ (s/). Next we compare the boud i (8) with the boud obtaied i Embrechts ad Puccetti [4], which is m + (s) if r [0,s/) s ( )r r ( F(t))dt s r for s > 0. (0) Propositio 2.5. The boud (0) is greater tha or equal to the boud (8). Moreover, both are equal if ad oly if F () < ad a solutio to the ifimum if r [0,s/) s ( )r r ( F(t))dt s r () lies i [0, s F () ]. The proof of the above Propositio is give i the appedix. Differet from the boud i Embrechts ad Puccetti [4], Theorem 2.3 deals with a more geeral case, where the radom variables X,, X do ot eed to be idetically distributed ad positive. Moreover, the boud i Theorem 2.3 is easier to calculate. Obviously, the bouds i Corollary 2.4 ad i Embrechts ad Puccetti [4] are the same ad both are sharp whe the coditioal distributio F a is completely mixable. A compariso of the two bouds is give i 8

9 Figure 3.2 i Sectio 3 whe the margial distributios have ifiite support (see also Remark 3.2). Note that ifiite support geerally implies that the mixable coditio i Theorem 2.3 ad Corollary 2.4 does ot hold. 3 Bouds for idetically distributed risks with mootoe desities I this sectio, we ivestigate the homogeeous case whe F = = F = F ad F has either a mootoe desity or a tail-mootoe desity o its support. Sice the case of = is trivial, we assume 2. Whe the distributio F with support o [0, ] has a decreasig desity ad satisfies the regular coditio ψ(t) t + t, Wag ad Wag [4] showed that m + (s) = ψ (s/), which ow becomes a corollary of Theorem 2.3. Whe the support of the distributio F is ubouded, the mixable coditio i Theorem 2.3 ad Corollary 2.4 is ot satisfied (see Propositio 2.(7) i Wag ad Wag [4]), i.e., the boud ψ (s/) is ot sharp. I this sectio, we fid a formula for calculatig the boud m + (s) for ay distributio with a mootoe desity or a tail-mootoe desity, ad obtai the correspodig correlatio structure. This partially aswers the questio of optimal couplig for m + (s), which has remaied ope for decades. As a direct applicatio, the bouds o VaR α (S ) are obtaied as well. 3. Prelimiaries To calculate m + (s) for F havig a mootoe margial desity, we first review the costructio of copula Q F ( 2) i Wag ad Wag [4], where F is a distributio fuctio with a icreasig (o-decreasig) desity. More specifically, for some 0 c / ad radom vector (U,, U ) with uiform margial distributios o [0,], we say (U,, U ) Q F (c) if (a) for each i =,,, give U i [0, c], we have U j = ( )U i, j i; (b) F (U ) + + F (U ) is a costat whe ay oe of U i s lies i (c, ( )c). 9

10 Deote Q F = Q F (c ) where c is the smallest possible c such that Q F (c) exists. Note that c = 0 if ad oly if F is -CM. Defie H(x) = F (x) + ( )F ( ( )x) for F with a o-decreasig desity. (2) The the smallest possible c for F with a icreasig desity is ad for ay covex fuctio f, c = mi{c [0, ] : H(t)dt ( c)h(c)} (3) c mi E f (X + + X ) = E QF f ( F (U ) + + F (U ) ). (4) X,,X F Note that Q F may ot be uique. The existece of Q F ad details of the above results ca be foud i Sectio 3 of Wag ad Wag [4]. For F with a decreasig desity ( 2), we defie Q F (c) similarly as follows. For some 0 c /, we say (U,, U ) Q F (c) if (a ) for each i =,,, give U i [ c, ], we have U j = ( )( U i ), j i; (b ) F (U ) + + F (U ) is a costat whe ay oe of U i lies i (( )c, c). Defie H(x) = ( )F (( )x) + F ( x) for F with a decreasig desity. (5) As for the distributio of Z with a decreasig desity, the distributio of Z has a icreasig desity, thus the above properties hold for F with a decreasig desity. That is, the smallest possible c for F with a decreasig desity is c = mi{c [0, ] : H(t)dt ( c)h(c)}. (6) c Ad for a distributio F with a decreasig desity ad ay covex fuctio f the equatio (4) holds. 0

11 Although m + (s) = mi X,,X F E( {S <s}), the above results ca ot be applied directly to solve m + (s) sice the idicator fuctio (,s) ( ) is ot a cocave fuctio. Here we propose to fid m + (s) for F with a mootoe margial desity based o the followig properties of Q F. Propositio 3.. Suppose F admits a mootoe desity o its support.. If (U,, U ) Q F (c) ad F has a icreasig desity, the {Ui (c, ( )c)} = {U (c, ( )c)} a.s. for i =,,. 2. If X,, X F with copula Q F, the H(U/) {U c } + H(c ) {U>c }, c > 0; S = X + + X = E(X ), c = 0 (7) for some U U[0, ]. The proof of Propositio 3. is give i the appedix. For more details of the copula Q F, see Wag ad Wag [4]. 3.2 Mootoe margial desities Now we are ready to give a computable formula for m + (s). I the followig we defie a fuctio φ(x) which works similarly as Φ(x) i the mixable case. For F with a decreasig desity ad a [0, ], defie H a (x) = ( )F (a + ( )x) + F ( x) (8) for x [0, a ] ad c (a) = mi{c [0, ( a)] : ( a) H a (t)dt ( ( a) c)h a(c)}. (9) c

12 Write φ(a) = H a (c (a)) if c (a) > 0, ψ(a) if c (a) = 0. (20) O the other had, for F with a icreasig desity ad a [0, ], defie H a (x) = F (a + x) + ( )F ( ( )x), (2) c (a) = mi{c [0, ( a)] : ( a) H a (t)dt ( ( a) c)h a(c)} (22) c ad φ(a) = H a (0) if c (a) > 0, ψ(a) if c (a) = 0. (23) Some probabilistic iterpretatio of the fuctios H a (x) ad φ(a) is give i the followig remark. Techical details are put i Lemma 3.2 later. Remark 3.. Suppose Y,, Y F a with copula Q F a. By (7) we have H(U/) {U c } + H( c ) {U> c }, c > 0, Y + + Y = E(Y ), c = 0 for some U U[0, ], where H(x) ad c are H(x) ad c defied i (2), (3), (5) ad (6) by replacig F with F a. It is easy to check that H(x) = H a (( a)x), c = c (a)/( a) ad H( c ) = H a (c (a)). For c (a) > 0, later we will show that H a (x), x [0, c (a)] attais its miimum value at H a (c (a)) for F a with a decreasig desity ad at H a (0) for F a with a icreasig desity. Therefore, the miimum possible value of Y + + Y is mi H a(x) {c (a)>0} + E(Y ) {c (a)=0} = φ(a). x [0,c (a)] Thus, P(Y + +Y φ(a)) =, which leads to P(S < φ(a)) a by settig X i = F (V) {V a} + Y i {V>a} where V U[0, ] is idepedet of Y,, Y. This suggests m + (s) φ (a), i.e., φ (a) is potetially a optimal boud. I order to prove the optimality of φ (a), more details of the fuctios H a (x) ad φ(a) are give i the followig lemma, whose proof is put i the appedix. 2

13 Lemma 3.2. Suppose F admits a mootoe desity. (i) If F has a decreasig desity, the give a [0, ), H a (x) is decreasig ad differetiable for x [0, c (a)]. (ii) If F has a icreasig desity, the give a [0, ), H a (x) is icreasig ad differetiable for x [0, c (a)]. (iii) If F has a decreasig desity, the φ(a) = E[F (V a )] where V a U[a + ( )c (a), c (a)]. (iv) For ay radom variables U,, U U[a, ] ad 0 a < b, we have E(F (U i ) A) < E[F (V b )] for i =,,, where V b is defied i (iii) ad A = i= {U i [a, c (b)]}. (v) Suppose Y,, Y F a with copula Q F a, the P(Y + + Y φ(a)) =. (vi) φ(a) is cotiuous ad strictly icreasig for a [0, ). Sice φ(a) is cotiuous ad strictly icreasig, its iverse fuctio φ (a) exists. Put φ (t) = 0 if t < φ(0) ad φ (t) = if t > φ(). Theorem 3.3. Suppose the distributio F(x) has a decreasig desity o its support ad φ(a) is defied i (20), or the distributio F(x) has a icreasig desity o its support ad φ(a) is defied i (23). The we have m + (s) = φ (s). Proof. (a) We first prove m + (s) φ (s). Write a = φ (s). For i =,,, let Y,, Y F a with copula Q F a ad X i = F (V) {V a} + Y i {V>a} where V U[0, ] is idepedet of Y,, Y. It is easy to check that X i F ad by Lemma 3.2(v), m + (s) P(S < φ(a)) = P(S φ(a)) P(Y + + Y φ(a))p(v > a) = a. Thus m + (s) φ (s). 3

14 (b) Next we prove m + (s) φ (s) whe F(x) has a decreasig desity. Suppose a = m + (s) < φ (s) = b ad X = (X,, X ) is a optimal couplig for m + (s) such that {S s} = {X i F (a)} for each i =,,. Hece there exist U a,,, U a, U[a, ] such that F (U a, ) + + F (U a, ) s with probability. By Lemma 3.2(iii) ad (iv), we have s E[ F (U a,i ) A] < E(F (V b )) = φ(b) = s. i= This leads to a cotradictio. Thus m + (s) = φ (s). (c) Fially we prove m + (s) φ (s) whe F(x) has a icreasig desity. I this case F () <. Write a = m + (s) ad let X = (X,, X ) be a optimal couplig for m + (s) such that {S s} = {X i F (a)} for each i =,,. It is clear that P(S < F (a) + ( )F () + ɛ S s) P(X i < F (a) + ɛ X i F (a)) > 0 for ay ɛ > 0. Note that P(S < s S s) = 0 ad thus s F (a) + ( )F () = H a (0). This shows s H a (0). The iequality s ψ(a) is give by Theorem 2.3. Hece s φ(a) ad a φ (s). The proof of the above theorem suggests costructig the optimal correlatio structure as follows. I both cases, for a = φ (s) let U a,,, U a, U[a, ] with copula Q F a ad U U[0,] is idepedet of (U a,,, U a, ). Defie U i = U a,i {U a} + U {U<a} (24) for i =,,. The P(F (U ) + + F (U ) < s) = φ (s). 4

15 Remark The copula Q F plays a importat role i derivig bouds for the covex miimizatio problem (4) ad the m + (s) problem with mootoe margial desities. Note that Q F may ot be uique, hece the structure (24) may ot be uique. Also, o the set {S < s}, the depedece structure of X,, X ca be arbitrary. 2. The value φ (s) is accurate eve whe E(max{X, 0}) =. Whe the distributio F a is -CM, Theorem 3.3 gives the sharp boud Φ (s) i Theorem Whe a radom variable X has a mootoe desity, X has a mootoe desity too. Hece the above theorem also solves the similar problem M + (s) = sup P(S < s) = if P( S s) = if P( S < s), X i P X i P X i P where P has a mootoe desity. 4. Figure 3. shows the sketch of a optimal couplig for F with a decreasig desity, some a > 0 ad c (a) > 0. Here U,, U U[0, ] ad P(F (U ) + + F (U ) < s) = φ (s). (i) Whe U i [0, a], U i is arbitrarily coupled to all other U j i Part A. (ii) Whe U i [a, a + ( )c (a)], U i is coupled to other U j, j i i Part B ad Part D. For j i, either U i a = ( )( U j ) or U j = U i. (iii) Whe U i [a + ( )c (a), c (a)], U i is coupled to all other U j, j i i Part C, ad F (U ) + + F (U ) = φ(a). It is the completely mixable part. (iv) Whe U i [ c (a), ], U i is coupled to other U j, j i i Part B. For j i, U j a = ( )( U i ). 5. Figure 3.2 shows the real values of m + (s) i Theorem 3.3 ad the lower boud ψ (s/) i Theorem 2.3 for the Pareto(2,) distributio. We also calculate the boud (0) i 5

16 Embrechts ad Puccetti [4] (see Sectio 2.2). It turs out that i this case the real values are equal to the boud (0), which suggests that the boud (0) i [4] may be sharp for Pareto distributios. a + ( )c (a) a = m + (s) = φ (s) F (s/) c (a) 0 A B C D I this part U i [0,a] ad U i is arbitrarily coupled to all other U j i A. I this part U i [a + ( )c (a), c (a)], U i is coupled to all other U j, j i i C, ad F (U ) + + F (U ) = φ(a). It is the completely mixable part. 0 I this part U i [a,a + ( )c (a)], U i is coupled to other U j, j i i B ad D. For j i, either U i a = ( )( U j) or U j = U i. I this part U i [ c (a),] ad U i is coupled to other U j, j i i B. For j i, U j a = ( )( U i). 0 Figure 3.: Sketch of the optimal couplig 3.3 Tail-mootoe margial desities For the distributio F with desity p(x), we say p(x) is tail-mootoe, if for some b R, p(x) is decreasig for x > b or p(x) is icreasig for x < b. We are particularly iterested i the case whe p(x) is tail-decreasig (p(x) is decreasig for x > b) sice the risks are usually positive radom variables. For most risk distributios the tail-decreasig property is satisfied. For example, the Gamma distributio with shape parameter α for α > ad the F-distributio with d, d 2 degrees of freedom with d > 2 have a tail-decreasig desity, but do ot have a mootoe desity. I the VaR problems, oe is cocered with the tail behavior of the distributio. From the proof of Theorem 3.3, iformatio o the left tail of F does ot play ay role i the calculatio 6

17 m + (s) for Pareto distributios, = 3, α = 2, θ = real value φ ( ) (s) lower boud ψ ( ) (s/) φ ( ) (s) ad ψ ( ) (s/) s Figure 3.2: m + (s) ad ψ (s/) for a Pareto distributio of m + (s). Based o this observatio, we have the followig theorem, which solves m + (s) for F with tail-decreasig desity ad some large s. Theorem 3.4. Suppose the desity fuctio of F is decreasig o [b, ), ad φ(a) is defied i (20). The for s φ(f(b)), m + (s) = φ (s). Proof. Sice the desity fuctio of F is decreasig o [b, ), the coditioal distributio F F(b) has a decreasig desity. Note that H a (x), c (a) ad φ(a) oly deped o the coditioal distributio F a, hece they are well defied for F(b) a. Sice s φ(f(b)), φ (s) F(b) ad the coditioal distributio F φ (s) has a decreasig desity. Theorem 3.4 follows from the same argumets as i the proof of Theorem 3.3, where o coditio o the distributio of X i o {X i < F (φ (s))} is used. 7

18 3.4 The worst Value-at-Risk scearios The Value-at-Risk (VaR) is a importat risk measure i risk maagemet; see Embrechts ad Puccetti [6] ad refereces therei. Recall that VaR is the α-quatile of the distributio, i.e., VaR α (S ) = F S (α) = if{s R : F S (s) α}, (25) where F S is the distributio of S. Typical values of the level α are 0.95, 0.99 or eve As metioed i Embrechts ad Puccetti [6], baks are cocered with a upper boud o VaR( d i= X i ) whe the correlatio structure betwee X = (X,, X d ) is uspecified. Fidig the bouds o the VaR is equivalet to fidig the iverse fuctio of m + (s) (ote that m + (s) is o-decreasig). Usig Theorem 3.3 ad Theorem 3.4, we are able to obtai the explicit value of the upper boud o the VaR, amely, the worst Value-at-Risk. The proof follows directly from the fact that sup Xi F, i VaR α(s ) = m + (α) whe m + (s) is cotiuous ad strictly icreasig. Corollary 3.5. Suppose that the desity fuctio of the margial distributio F is decreasig o [b, ) ad φ(a) is defied i (20). The for α F(b), the worst VaR of S = X + + X is sup VaR α (S ) = m + (α) = φ(α). (26) X i F, i I particular, (26) holds for all α if the margial distributio F has decreasig desity o its support ad a optimal correlatio structure is give by (24). For arbitrary margial distributios F,, F, Theorem 2.3 gives a upper boud for the worst-var problem as follows. Corollary 3.6. For arbitrary margial distributios, where Φ(α) is defied i Sectio 2. sup VaR α (S ) m + (α) Φ(α), (27) X i F i,i=,, 8

19 Figure 3.3 shows the explicit worst-var i (26) ad the upper boud i (27) for the distributio Pareto(4,) ad 0.9 α worst-var α (S) for Pareto distributio, = 3, α = 4, θ = Real value of worst-var Upper Boud o worst-var 3 worst-varα(s) α Figure 3.3: Worst-VaR for a Pareto distributio 3.5 Examples Here we give some examples to show how to compute m + (s). Example 3.. Assume that X U[0, ], the uiform distributio o [0,]. The p(x) =, F(x) = x, x [0, ], F (t) = t, t [0, ]. Further we have c (a) = 0 for all 0 a ad φ(t) = ψ(t) = E(X X > t) = (+t) 2 for t [0, ]. Thus ( ) 2s m + (s) = φ (s) =. + This result ideed is the same as that i Rüschedorf []. Oe optimal correlatio structure is also give i Rüschedorf ad Uckelma [3]. 9

20 Example 3.2. Assume that X Pareto(α, θ), α >, θ > 0 with desity fuctio p(x) = αθ α x α, x θ. The ( x ) α F(x) =, x θ, F (t) = θ( t) /α, t [0, ]. θ Further we have that c (a) is the smallest c [0, ( a)] such that α α (( a ( )c) /α c /α ) ( ( a) c)(( )( a ( )c) /α + c /α ). The umerical values of m + (s) for two Pareto distributios ad = 3 are plotted i Figure 3.4. A possible correlatio structure is give i (24) m + (s) for Pareto distributios, = 3 α = 2, θ = α = 3, θ = m+(s) s Figure 3.4: m + (s) for Pareto distributios Example 3.3. Assume that X Gamma(α, λ), α, λ > 0 with desity fuctio The p(x) = λα Γ(α) xα e λx. F(x) = γ(α, λx), x > 0, 20

21 where γ(α, t) = t 0 Γ(α) xα e λx dx is the lower icomplete Gamma fuctio. Further c (a) is the smallest c [0, ( a)] such that α λ (γ(α +, λf ( c)) γ(α +, λf (a + ( )c))) ( ( a) c)h a(c), which ca be calculated umerically. The umerical values of m + (s) for two Gamma distributios ad = 3 are plotted i Figure 3.5. A possible correlatio structure is give i (24) m + (s) for Gamma distributios, = 3 α =, λ = α = /2, λ = /2 0.7 m+(s) s Figure 3.5: m + (s) for Gamma distributios 4 Coclusios I this paper, we provide a ew lower boud for m + (s) with ay give margial distributios, ad give a ecessary ad sufficiet coditio for its sharpess i terms of the joit mixability. Whe the margial distributios have a commo mootoe desity, the explicit value of m + (s) ad the worst Value-at-Risk are obtaied. We also exted these results to distributios with a commo tail-mootoe desity. 2

22 Appedix Proof of Propositio The case = is trivial. For 2, by the defiitio of JM distributios, there exist X F,, X F such that Var(X + + X ) = 0. Sice Var(X + X X ) Var(X ) Var(X X ) σ σ i, i=2 we have 2σ i= σ i 0. Similarly, we ca show that 2σ k i= σ i 0 for ay k =,,, i.e., (4) holds. 2. We oly eed to prove the part for 2. Without loss of geerality, we assume σ σ 2 σ. Let X = (X,, X ) be a multivariate Gaussia radom vector with kow margial distributios F,, F ad a uspecific correlatio matrix Γ. We wat to show there exists a correlatio matrix Γ such that Var(X + + X ) = 0. Let T be the correlatio matrix of (X 2,, X ) ad Y = X X. Defie f (T) = Var(X ) Var(Y). Obviously f (T) is a cotiuous fuctio of T with caoical distace measure. It is easy to check that f (T) = σ i=2 σ i 0 whe X 2 = σ 2 Z + µ 2,, X = σ Z + µ for some Z N(0, ). Sice σ σ 2 σ, we also have f (T) = σ i=2 ( ) i σ i 0 whe X i = ( ) i σ i Z + µ i for i = 2,,. Hece there exists a correlatio matrix T 0 such that f (T 0 ) = 0. With the correlatio matrix of (X 2,, X ) beig T 0, we defie X = Y + E(Y) + µ. Hece X N(µ, σ 2 ) ad Var(X + + X ) = 0, which imply that F,, F are JM. 22

23 Proof of Propositio 2.5. Whe s F (), we have m + (s) = = ψ (s/). Suppose s < F (). Obviously if r [0,s/) s ( )r r ( F(t))dt s r if r [0,s/) r ( F(t))dt. (28) s r ( For r [0, s ), from r ( F(t))dt s r ) = 0, we have g(r) := ( F(r))(s r) + Suppose r = r satisfies (29). The r ( F(t))dt = 0. (29) F(r ) = r { F(t)}dt s r. (30) Note that r always exists sice g is cotiuous, g(0) = s + µ < 0, F(s/) < ad Itegratio by parts leads to ad hece { F(r )}(s r ) + g(s/) = r s/ { F(t)}dt > 0. { F(t)}dt = s{ F(r )} + s( F(r )) = E(X X > r )( F(r )), r tdf(t) = 0, i.e., F(r ) = ψ (s/). (3) Therefore, the boud i (0) is greater tha or equal to the boud i (8) by (28), (30) ad (3). Note that the boud (0) is strictly greater if F () =. For provig the secod part of Propositio 2.5, we oly eed to cosider the case of s < F () < sice m + (s) = = ψ (s/) whe F () s <. Cosider the problem () ad if r [0,s/) F () r ( F(t))dt. (32) s r 23

24 From the above proof, we ca see that r is the uique solutio to (32). Therefore, the bouds (8) ad (0) are equal if ad oly if () ad (32) are equal. Sice ( s F ) () g ( = F we have r [0, s F () ]. Thus ( s F )) () F () s + s F () ( F(t))dt 0, if r [0,s/) F () r ( F(t))dt s r = if r [0, s F () ] = if r [0, s F () ] F () r s ( )r r ( F(t))dt s r ( F(t))dt. s r Therefore, the bouds (8) ad (0) are equal if ad oly if a solutio to () lies i [0, s F () ]. Proof of Propositio 3... By (a) i Sectio 3., for ay i j, U i [0, c] U j [ ( )c, ]. Hece A i := {U i [0, c]} {U j [ ( )c, ]} =: B j ad P(A i A j ) = 0. As a cosequece, i j A i B j. Note that P( i j A i ) = ( )c = P(B j ). Thus i j A i = B j a.s. ad i= A i = A j B j = {U j [0,c] [ ( )c,]} a.s. which imply that {U j (c, ( )c)} = ( i= A i ) c a.s. for j =,,. 2. We oly prove the case whe F has a icreasig desity. Whe c = 0, (7) follows from the defiitio of Q F. Next we assume c > 0. Write D j = A j B j ad X j = F (U j ), U j U[0,] for j =,,. First ote that by coditio (b) i Sectio 3., for ay j =,,, F (U ) + + F (U ) is a costat o the set D c j. This costat equals its 24

25 expectatio, which is E(F (U ) + + F (U ) D c j ) = E(F (U ) D c ) = = = = c c c c = H(c ). ( )c c F (x)dx F (x)dx + c c F (x)dx + c c c H(x)dx ( )c F (x)dx c F ( ( )t)d( )t The last equality holds because (3) ad c H(x)dx = ( c )H(c ) for c > 0. Therefore, almost surely S = F (U ) + + F (U ) = F (U i ) D + F (U i ) D c = = = = i= i= F (U i ) j= A j + H(c ) D c i= F (U i )( A j ) + H(c ) D c i= j= [F (U j ) + ( )F ( ( )U j )] A j + H(c ) D c j= H(U j ) A j + H(c ) D c. j= 25

26 Sice c / ad the sets A,, A ad D c are disjoit, we have P( H(U j ) A j + H(c ) D c < t) j= = P(H(U ) {U c } < t) + P(H(c ) D c < t) = P(H(U /) {U c } < t) + P(H(c ) {U >c } < t) = P(H(U /) {U c } + H(c ) {U >c } < t). Hece there exists a U U[0,] such that H(U j ) A j + H(c ) D c j = H(U/) {U c } + H(c ) {U>c }. j= Proof of Lemma 3.2 (i) Uder the assumptio of F, F (x) is covex ad differetiable. Thus H a (x) is covex ad differetiable. The defiitio of c (a) shows that the average of H a (x) o [c (a), ( a)] is H a (c (a)) if 0 < c (a) < a, amely ( a) H a (t)dt = H a (c (a)). ( a) c (a) c (a) With H a (x) beig covex, we have H a(c (a)) 0 ad so H a(x) 0 o [0, c (a)]. Here H a(x) deotes H a (x)/ x. Note that for > 2, H a( a ) = (( )2 )(F ) ( a ) > 0 implies ( a) c H a (t)dt ( ( a) c)h a(c) for some c < a, thus c (a) < a always holds. For = 2, H a(x) 0 o [0, a ] sice H a( a ) = 0 ad H is covex. (ii) It follows from similar argumets as i (i). 26

27 (iii) Suppose c (a) > 0. By the cotiuity of H a (x) w.r.t. x ad (9), we kow that c (a) satisfies ( a) c (a) H a (t)dt = ( ( a) c (a))h a (c (a)). Note that for ay c [0, ( a)], ( a) c H a (t)dt = = = ( a) c a+ ( a) a+( )c c a+( )c ( )F (a + ( )t)dt + ( a) c F (t)dt + F (t)dt ( a) F (t)dt. c F ( t)dt Thus it follows from the defiitio of c (a) that H a (c (a)) = E[F (V a )]. For the case c (a) = 0, it is obvious that ψ(a) = φ(a) = E[F (V a )]. (iv) Note that i a give probability space, for ay measurable set B with P(B) > 0 ad cotiuous radom variable Z with cdf G, we have E(Z B) E[Z Z G ( P(B))]. To see this, deote the coditioal distributio of Z o B by G ad the coditioal distributio o {Z G ( P(B))} by G 2. The we have G 2 (x) = = P(Z x, G(Z) P(B)) P(B) max{g(x) + P(B), 0} P(B) P(Z x, B) = G (x), x R, (33) P(B) which implies that for U U[0,], E(Z B) = E[G (U)] E[G 2 (U)] = E[Z Z G ( P(B))]. (34) Sice A = i= {U i [a, c (b)]}, we have P(A) c (b) a > 0 ad U i c (b) o 27

28 A. By defiig Z = F (U i ) {Ui c (b)} + F (a) {Ui > c (b)}, it follows from (34) that E[F (U i ) A] = E[Z A] E[Z Z F ( c (b) ( a)p(a))] E[F (U i ) U i [ c (b) ( a)p(a), c (b)]] E[F (U i ) U i [a + ( )c (b), c (b)]] < E[F (U i ) U i [b + ( )c (b), c (b)]] = E(F (V b )). (35) (v) It follows from (i), (ii) ad the argumets i Remark 3.. (vi) We first prove the case whe F has a decreasig desity. Sice H a (x) is covex w.r.t. x ad differetiable w.r.t. a, the defiitio of c (a) implies that c (a) is cotiuous. Hece φ(a) = E[F (V a )] is cotiuous. Suppose U a,,, U a, U[a, ] with copula Q F a. The F (U a, ),, F (U a, ) F a ad have copula Q F a too. By (v), we have F (U a, ) + + F (U a, ) φ(a). (36) Thus from (35) ad (36) we have φ(a) E[ F (U a,i ) A] < E(F (V b )) = φ(b). i= Next we prove the case whe F has a icreasig desity. The cotiuity of c (a) comes from the same argumets as above. By defiitio, H a (0) ad ψ(a) are cotiuous ad icreasig fuctios of a. So we oly eed to show that whe c (a) approaches 0, H a (0) ψ(a) approaches 0 too. Suppose that as a a 0, c (a) 0 ad c (a) 0 for a 0 ɛ < a < a 0 ad ɛ > 0. The ( a) 0 H a (t)dt ( a 0)H a0 (0), 28

29 which implies that ψ(a) = a a F (a + t)dt = ( a) H a (t)dt H a0 (0) a 0 as a a 0. Together with the cotiuity of H a (0) ψ(a) we kow H a (0) ψ(a) 0 as a a 0. Ackowledgmet. We thak Co-editor Professor Kerry Back, a associate editor ad two reviewers for their helpful commets which sigificatly improved this paper. Wag s research was partly supported by the Bob Price Fellowship at the Georgia Istitute of Techology. Peg s research was supported by NSF Grat DMS Yag s research was supported by the Key Program of Natioal Natural Sciece Foudatio of Chia (Grats No. 3002). Refereces [] Deuit, M., Geest, C., Marceau, É. (999). Stochastic bouds o sums of depedet risks. Isurace: Mathematics ad Ecoomics 25, [2] Embrechts, P., Höig, A. ad Juri, A. (2003). Usig copulae to boud the value-at-risk for fuctios of depedet risks. Fiace ad Stochastics 7, [3] Embrechts, P ad Höig, G. (2006). Extreme VaR scearios i higher dimesios. Extremes 9, [4] Embrechts, P ad Puccetti, G. (2006a). Bouds for fuctios of depedet risks. Fiace ad Stochastics 0, [5] Embrechts, P. ad Puccetti, G. (2006b). Bouds for fuctios of multivariate risks. Joural of Multivariate Aalysis 97,

30 [6] Embrechts, P. ad Puccetti, G. (200). Risk Aggregatio. I: Copula Theory ad Its Applicatios, P.Jaworski et al. (eds.), Lecture Notes i Statistics 98, Spriger, Berli/Heidelberg. [7] Gaffke, N. ad Rüschedorf, L. (98). O a class of extremal problems i statistics. Math. Operatiosforschug Statist., Series Optimizatio 2, [8] Kaas, R., Laeve, R. ad Nelse, R. (2009). Worst VaR scearios with give margials ad measures of associatio. Isurace: Mathematics ad Ecoomics 44, [9] Kott, M. ad Smith, C.S. (2006). Choosig joit distributios so that the variace of the sum is small. Joural of Multivariate Aalysis 97, [0] Puccetti, G. ad Rüschedorf, L. (20) Bouds for joit portfolios of depedet risks. Preprit. [] Rüschedorf, L. (982). Radom variables with maximum sums. Adv. Appl. Probab. 4(3), [2] Rüschedorf, L. (983). Solutio of a statistical optimizatio problem by rearragemet methods. Metrika 30, [3] Rüschedorf, L. ad Uckelma, L. (2002). Variace miimizatio ad radom variables with costat sum, i: Distributios with give margials. Cuadras, et al. (Eds.), Kluwer, [4] Wag, B. ad Wag, R. (20). The complete mixability ad covex miimizatio problems for mootoe margial distributios. Joural of Multivariate Aalysis 02,

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Lecture 19: Convergence

Lecture 19: Convergence Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may

More information

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

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

More information

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

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

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

STAT Homework 1 - Solutions

STAT Homework 1 - Solutions STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

Sequences and Series of Functions

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

More information

Chapter 6 Principles of Data Reduction

Chapter 6 Principles of Data Reduction Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a

More information

The Complete Mixability and Convex Minimization. Problems with Monotone Marginal Densities

The Complete Mixability and Convex Minimization. Problems with Monotone Marginal Densities The Complete Mixability ad Covex Miimizatio Problems with Mootoe Margial Desities Bi Wag ad Ruodu Wag May 9, 211 Abstract Followig the results i Rüschedorf ad Uckelma (22), we itroduce the completely mixable

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

A Note on the Kolmogorov-Feller Weak Law of Large Numbers

A Note on the Kolmogorov-Feller Weak Law of Large Numbers Joural of Mathematical Research with Applicatios Mar., 015, Vol. 35, No., pp. 3 8 DOI:10.3770/j.iss:095-651.015.0.013 Http://jmre.dlut.edu.c A Note o the Kolmogorov-Feller Weak Law of Large Numbers Yachu

More information

Self-normalized deviation inequalities with application to t-statistic

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

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

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

More information

1 Convergence in Probability and the Weak Law of Large Numbers

1 Convergence in Probability and the Weak Law of Large Numbers 36-752 Advaced Probability Overview Sprig 2018 8. Covergece Cocepts: i Probability, i L p ad Almost Surely Istructor: Alessadro Rialdo Associated readig: Sec 2.4, 2.5, ad 4.11 of Ash ad Doléas-Dade; Sec

More information

Distribution of Random Samples & Limit theorems

Distribution of Random Samples & Limit theorems STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to

More information

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

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

More information

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT

Introduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

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

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

More information

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.

Econ 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1. Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio

More information

On forward improvement iteration for stopping problems

On forward improvement iteration for stopping problems O forward improvemet iteratio for stoppig problems Mathematical Istitute, Uiversity of Kiel, Ludewig-Mey-Str. 4, D-24098 Kiel, Germay irle@math.ui-iel.de Albrecht Irle Abstract. We cosider the optimal

More information

Lecture 8: Convergence of transformations and law of large numbers

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

More information

MAS111 Convergence and Continuity

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

More information

Unbiased Estimation. February 7-12, 2008

Unbiased Estimation. February 7-12, 2008 Ubiased Estimatio February 7-2, 2008 We begi with a sample X = (X,..., X ) of radom variables chose accordig to oe of a family of probabilities P θ where θ is elemet from the parameter space Θ. For radom

More information

Estimation for Complete Data

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

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

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

More information

MASSACHUSETTS 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/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 information

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices A Hadamard-type lower boud for symmetric diagoally domiat positive matrices Christopher J. Hillar, Adre Wibisoo Uiversity of Califoria, Berkeley Jauary 7, 205 Abstract We prove a ew lower-boud form of

More information

Lecture 7: Properties of Random Samples

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

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Lecture 3 : Random variables and their distributions

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

More information

4. Partial Sums and the Central Limit Theorem

4. Partial Sums and the Central Limit Theorem 1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems

More information

Lecture 20: Multivariate convergence and the Central Limit Theorem

Lecture 20: Multivariate convergence and the Central Limit Theorem Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece

More information

Expectation and Variance of a random variable

Expectation and Variance of a random variable Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio

More information

January 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS

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

More information

Random Variables, Sampling and Estimation

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

More information

A note on log-concave random graphs

A note on log-concave random graphs A ote o log-cocave radom graphs Ala Frieze ad Tomasz Tocz Departmet of Mathematical Scieces, Caregie Mello Uiversity, Pittsburgh PA53, USA Jue, 08 Abstract We establish a threshold for the coectivity of

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Chapter 5. Inequalities. 5.1 The Markov and Chebyshev inequalities

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

Appendix to Quicksort Asymptotics

Appendix to Quicksort Asymptotics Appedix to Quicksort Asymptotics James Alle Fill Departmet of Mathematical Scieces The Johs Hopkis Uiversity jimfill@jhu.edu ad http://www.mts.jhu.edu/~fill/ ad Svate Jaso Departmet of Mathematics Uppsala

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Itroductio to Probability ad Statistics Lecture 23: Cotiuous radom variables- Iequalities, CLT Puramrita Sarkar Departmet of Statistics ad Data Sciece The Uiversity of Texas at Austi www.cs.cmu.edu/

More information

Measure and Measurable Functions

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

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

Precise Rates in Complete Moment Convergence for Negatively Associated Sequences

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

More information

ON POINTWISE BINOMIAL APPROXIMATION

ON POINTWISE BINOMIAL APPROXIMATION Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece

More information

J. Stat. Appl. Pro. Lett. 2, No. 1, (2015) 15

J. Stat. Appl. Pro. Lett. 2, No. 1, (2015) 15 J. Stat. Appl. Pro. Lett. 2, No. 1, 15-22 2015 15 Joural of Statistics Applicatios & Probability Letters A Iteratioal Joural http://dx.doi.org/10.12785/jsapl/020102 Martigale Method for Rui Probabilityi

More information

Lecture 12: September 27

Lecture 12: September 27 36-705: Itermediate Statistics Fall 207 Lecturer: Siva Balakrisha Lecture 2: September 27 Today we will discuss sufficiecy i more detail ad the begi to discuss some geeral strategies for costructig estimators.

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

The log-behavior of n p(n) and n p(n)/n

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

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values

Confidence interval for the two-parameter exponentiated Gumbel distribution based on record values Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values

More information

Mi-Hwa Ko and Tae-Sung Kim

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

Asymptotic distribution of products of sums of independent random variables

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

Lecture 10 October Minimaxity and least favorable prior sequences

Lecture 10 October Minimaxity and least favorable prior sequences STATS 300A: Theory of Statistics Fall 205 Lecture 0 October 22 Lecturer: Lester Mackey Scribe: Brya He, Rahul Makhijai Warig: These otes may cotai factual ad/or typographic errors. 0. Miimaxity ad least

More information

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.

Let us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f. Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these

for all x ; ;x R. A ifiite sequece fx ; g is said to be ND if every fiite subset X ; ;X is ND. The coditios (.) ad (.3) are equivalet for =, but these sub-gaussia techiques i provig some strog it theorems Λ M. Amii A. Bozorgia Departmet of Mathematics, Faculty of Scieces Sista ad Baluchesta Uiversity, Zaheda, Ira Amii@hamoo.usb.ac.ir, Fax:054446565 Departmet

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

Gamma Distribution and Gamma Approximation

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

REGRESSION WITH QUADRATIC LOSS

REGRESSION WITH QUADRATIC LOSS REGRESSION WITH QUADRATIC LOSS MAXIM RAGINSKY Regressio with quadratic loss is aother basic problem studied i statistical learig theory. We have a radom couple Z = X, Y ), where, as before, X is a R d

More information

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

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

More information

Mathematical Statistics - MS

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

Preponderantly increasing/decreasing data in regression analysis

Preponderantly increasing/decreasing data in regression analysis Croatia Operatioal Research Review 269 CRORR 7(2016), 269 276 Prepoderatly icreasig/decreasig data i regressio aalysis Darija Marković 1, 1 Departmet of Mathematics, J. J. Strossmayer Uiversity of Osijek,

More information

An Introduction to Asymptotic Theory

An Introduction to Asymptotic Theory A Itroductio to Asymptotic Theory Pig Yu School of Ecoomics ad Fiace The Uiversity of Hog Kog Pig Yu (HKU) Asymptotic Theory 1 / 20 Five Weapos i Asymptotic Theory Five Weapos i Asymptotic Theory Pig Yu

More information

On Random Line Segments in the Unit Square

On Random Line Segments in the Unit Square O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,

More information

Relations between the continuous and the discrete Lotka power function

Relations between the continuous and the discrete Lotka power function Relatios betwee the cotiuous ad the discrete Lotka power fuctio by L. Egghe Limburgs Uiversitair Cetrum (LUC), Uiversitaire Campus, B-3590 Diepebeek, Belgium ad Uiversiteit Atwerpe (UA), Campus Drie Eike,

More information

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)

Randomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018) Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black

More information

EE 4TM4: Digital Communications II Probability Theory

EE 4TM4: Digital Communications II Probability Theory 1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair

More information

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

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

More information

A survey on penalized empirical risk minimization Sara A. van de Geer

A survey on penalized empirical risk minimization Sara A. van de Geer A survey o pealized empirical risk miimizatio Sara A. va de Geer We address the questio how to choose the pealty i empirical risk miimizatio. Roughly speakig, this pealty should be a good boud for the

More information

STAT Homework 2 - Solutions

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

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Berry-Esseen bounds for self-normalized martingales

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

Fall 2013 MTH431/531 Real analysis Section Notes

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

More information

Lecture 16: UMVUE: conditioning on sufficient and complete statistics

Lecture 16: UMVUE: conditioning on sufficient and complete statistics Lecture 16: UMVUE: coditioig o sufficiet ad complete statistics The 2d method of derivig a UMVUE whe a sufficiet ad complete statistic is available Fid a ubiased estimator of ϑ, say U(X. Coditioig o a

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

Basis for simulation techniques

Basis for simulation techniques Basis for simulatio techiques M. Veeraraghava, March 7, 004 Estimatio is based o a collectio of experimetal outcomes, x, x,, x, where each experimetal outcome is a value of a radom variable. x i. Defiitios

More information

Rademacher Complexity

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

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

COMMON FIXED POINT THEOREMS VIA w-distance

COMMON FIXED POINT THEOREMS VIA w-distance Bulleti of Mathematical Aalysis ad Applicatios ISSN: 1821-1291, URL: http://www.bmathaa.org Volume 3 Issue 3, Pages 182-189 COMMON FIXED POINT THEOREMS VIA w-distance (COMMUNICATED BY DENNY H. LEUNG) SUSHANTA

More information

Sharp Convex Bounds on the Aggregate Sums An Alternative Proof

Sharp Convex Bounds on the Aggregate Sums An Alternative Proof risks Article Sharp Covex Bouds o the Aggregate Sums A Alterative Proof Chuacu Yi * ad Da Zhu School of Statistics, Qufu Normal Uiversity, Qufu 273165, Shadog, Chia; zhudasprig@163.com * Correspodece:

More information

lim za n n = z lim a n n.

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

More information

2.2. Central limit theorem.

2.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 information

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

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

More information

Math 341 Lecture #31 6.5: Power Series

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

1 = δ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

1 = δ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 information

Statistical Theory MT 2009 Problems 1: Solution sketches

Statistical Theory MT 2009 Problems 1: Solution sketches Statistical Theory MT 009 Problems : Solutio sketches. Which of the followig desities are withi a expoetial family? Explai your reasoig. (a) Let 0 < θ < ad put f(x, θ) = ( θ)θ x ; x = 0,,,... (b) (c) where

More information

Riesz-Fischer Sequences and Lower Frame Bounds

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

More information

32 estimating the cumulative distribution function

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

More information

ST5215: Advanced Statistical Theory

ST5215: 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 information

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so 3 From the otes we see that the parts of Theorem 4. that cocer us are: Let s ad t be two simple o-egative F-measurable fuctios o X, F, µ ad E, F F. The i I E cs ci E s for all c R, ii I E s + t I E s +

More information

Machine Learning Brett Bernstein

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

1 Inferential Methods for Correlation and Regression Analysis

1 Inferential Methods for Correlation and Regression Analysis 1 Iferetial Methods for Correlatio ad Regressio Aalysis I the chapter o Correlatio ad Regressio Aalysis tools for describig bivariate cotiuous data were itroduced. The sample Pearso Correlatio Coefficiet

More information

Notes 19 : Martingale CLT

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

More information

Lecture 18: Sampling distributions

Lecture 18: Sampling distributions Lecture 18: Samplig distributios I may applicatios, the populatio is oe or several ormal distributios (or approximately). We ow study properties of some importat statistics based o a radom sample from

More information

Empirical Processes: Glivenko Cantelli Theorems

Empirical Processes: Glivenko Cantelli Theorems Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3

More information

TMA4245 Statistics. Corrected 30 May and 4 June Norwegian University of Science and Technology Department of Mathematical Sciences.

TMA4245 Statistics. Corrected 30 May and 4 June Norwegian University of Science and Technology Department of Mathematical Sciences. Norwegia Uiversity of Sciece ad Techology Departmet of Mathematical Scieces Corrected 3 May ad 4 Jue Solutios TMA445 Statistics Saturday 6 May 9: 3: Problem Sow desity a The probability is.9.5 6x x dx

More information