Conditional limit theorems for conditionally negatively associated random variables
|
|
- Joanna Ball
- 6 years ago
- Views:
Transcription
1 Condtonal lmt theorems for condtonally negatvely assocated random varables Monatshefte f?r Mathematk ISSN Volume 161 Number 4 Monatsh Math : DOI /s x 1 3
2 Your artcle s protected by copyrght and all rghts are held exclusvely by Sprnger- Verlag. Ths e-offprnt s for personal use only and shall not be self-archved n electronc repostores. If you wsh to self-archve your work, please use the accepted author s verson for postng to your own webste or your nsttuton s repostory. You may further depost the accepted author s verson on a funder s repostory at a funder s request, provded t s not made publcly avalable untl 1 months after publcaton. 1 3
3 Monatsh Math : DOI /s x Condtonal lmt theorems for condtonally negatvely assocated random varables De-Me Yuan Jun An Xu-Shan Wu Receved: Aprl 009 / Accepted: 19 January 010 / Publshed onlne: 9 February 010 Sprnger-Verlag 010 Abstract From the ordnary noton of negatve assocaton for a sequence of random varables, a new concept called condtonal negatve assocaton s ntroduced. The relaton between negatve assocaton and condtonal negatve assocaton s answered, that s, the negatve assocaton does not mply the condtonal negatve assocaton, and vce versa. The basc propertes of condtonal negatve assocaton are developed, whch extend the correspondng ones under the non-condtonng setup. By means of these propertes, some Rosenthal type nequaltes for mum partal sums of such sequences of random varables are derved, whch extend the correspondng results for negatvely assocated random varables. As applcatons of these nequaltes, some condtonal mean convergence theorems, condtonally complete convergence results and a condtonal central lmt theorem stated n terms of condtonal characterstc functons are establshed. In addton, some lemmas n the context are of ndependent nterest. Keywords Condtonal negatve assocaton Condtonal Rosenthal type nequalty Condtonal statonarty Condtonal mean convergence theorem Condtonally complete convergence Condtonal central lmt theorem Condtonal resdual Cesàro alpha-ntegrablty Condtonal strong resdual Cesàro alpha-ntegrablty Communcated by K.D. Elworthy. D.-M. Yuan B J. An X.-S. Wu College of Mathematcs and Statstcs, Chongqng Technology and Busness Unversty, Chongqng , Chna e-mal: yuandeme@163.com J. An e-mal: scottan@sna.com X.-S. Wu e-mal: xushan191@163.com
4 450 D.-M. Yuan et al. Mathematcs Subject Classfcaton F15 60F5 1 Introducton, defnton and basc propertes Let, A, P be a probablty space, and all random varables n ths paper are defned on t unless specfed otherwse. A fnte famly of random varables {X, 1 n} s sad to be negatvely assocated NA, n short f for every par of dsjont subsets A and B of {1,,...,n}, Cov f 1 X, A, f X j, j B 0 whenever f 1 and f are coordnatewse nondecreasng and the covarance exsts. An nfnte famly s NA f every fnte subfamly s NA. Ths concept was frst ntroduced by Alam and Saxena [1]. Joag-Dev and Proschan [7] showed that many well known multvarate dstrbutons possess the NA property, and ts lmt propertes have drawn wde attenton because of ther numerous applcatons n relablty theory, percolaton theory and multvarate statstcal analyss. We refer to Joag-Dev and Proschan [7] for fundamental propertes, Matula [1] for the three seres theorem, Su et al. [18] and Shao [17] for moment nequaltes, Shao and Su [16] for the law of the terated logarthm, Lang and Su [9] for complete convergence, Newman [14] for the central lmt theorem, Ln [10] for the nvarance prncple, among others. Let X and Y be random varables wth EX < and EY <. LetF be a sub-σ -algebra of A. Prakasa Rao [15] defned the noton of the condtonal covarance of X and Y gven F F-covarance, n short as [ ] Cov F X, Y = E F X E F XY E F Y, where E F Z denotes the condtonal expectaton of a random varable Z gven F. It s easy to see that the F-covarance reduces to the ordnary concept of covarance f F ={Ø, }. We pont out that Cov F X + Z, Y + W = Cov F X, Y and Cov F XZ, YW = ZWCov F X, Y are two easy consequences of the above defnton of condtonal covarance, provded that Z and W are F-measurable random varables. On the bass of the above defnton of condtonal covarance, we now consder a new knd of dependence called condtonal negatve assocaton, whch s an extenson to the correspondng non-condtonal case. Defnton 1 A fnte famly of random varables {X, 1 n} s sad to be condtonal negatvely assocated gven F F-NA, n short f, for every par of dsjont subsets A and B of {1,,...,n}, Cov F f 1 X, A, f X j, j B 0 a.s. whenever f 1 and f are coordnatewse nondecreasng and the F-covarance exsts. An nfnte famly s F-NA f every fnte subfamly s F-NA.
5 Condtonal lmt theorems for condtonally negatvely assocated random varables 451 Clearly, a sequence of random varables {X n, n 1} s F-NA f they are F-ndependent. Moreover, the F-negatve assocaton reduces to the concept of negatve assocaton when F ={Ø, }. The natural queston of the relaton between the two concepts of NA and condtonal NA arses. The followng examples show that the NA property of random varables may be nherted by the condtonal NA property, that the NA property does not mply the condtonal NA property and that the condtonal NA property does not mply the NA property. Example 1 Consder the random vector X 1, X, X 3 whch has the multnomal dstrbuton wth parameters n = 3 and p = 1/3, 1/3, 1/3. As t s well known, the random vector X 1, X has also the multnomal dstrbuton. It follows that the famly {X 1, X } s NA n vew of Joag-Dev and Proschan [7]. Now let B ={X 3 = } and let F ={, B, B c, Ø} be the sub-σ -algebra generated by the event B, we next prove that the famly {X 1, X } s F-NA. For every par of functons f 1 and f wth Ef 1 X 1 and Ef X fnte, some smple calculatons show that and E[ f 1 X 1 B], ω B, E F f 1 X 1 = E[ f 1 X 1 B c ], ω B c = E[ f X B], ω B, E F f X = E[ f X B c ], ω B c = 1 f f 11, ω B, 5 1 f f f f 13, ω B c, 1 f f 1, ω B, 5 1 f f f f 3, ω B c E[ f 1 X 1 f X B], ω B, E F [ f 1 X 1 f X ]= E[ f 1 X 1 f X B c ], ω B c 1 f 10 f f 11 f 0, ω B, 1 1 f 10 f f 10 f f 10 f 3 = + 7 f 11 f f 11 f f 1 f f 1 f f 13 f 0, ω B c.
6 45 D.-M. Yuan et al. If f 1 and f are nondecreasng, then and 0 f 1 1 f 1 0 f 1 f 0 3 f 1 1 f 1 0 f 1 f 0 33 f 1 1 f 1 0 f f f 1 1 f 1 0 f 3 f f 1 f 1 1 f f f 1 3 f 1 1 f f 0 + f 1 3 f 1 0 f f f 1 f 1 0 f 3 f f 1 3 f 1 f 1 f f 1 3 f 1 1 f f 0 + f 1 3 f 1 0 f 3 f 0, equvalently, E F [ f 1 X 1 f X ] E F f 1 X 1 E F f X a.s., whch shows that the famly {X 1, X } s F-NA. Remark Let the random vector X 1,...,X r, X r+1,...,x m have multnomal dstrbuton wth parameters n and p 1,...,p m, and let F = σx r+1,...,x m.we conjecture that the famly {X, 1 r} s F-NA. Example Let ={1,, 3, 4} and let p = 1/4 be the probablty assgned to the event {}. If the events A 1 and A are defned by A 1 ={1, } and A ={, 3}, and the random varables X 1 and X are as follows X 1 = I A1 and X = I A where I A denotes the ndcator functon of an event A, then X 1 and X are ndependent, so the famly {X 1, X } s NA. Let B ={1} and F ={, B, B c, Ø} be the sub-σ -algebra generated by B. We wll show that {X 1, X } s not F-NA. For any nondecreasng functons f 1 and f wth Ef 1 X 1 and Ef X fnte and satsfyng f 1 0 = f 0 = 1 and f 1 1 = f 1 =, some smple calculatons show that f 1 1, ω B,, ω B, E F f 1 X 1 = = 3 f f 11, ω B c 4 3, ω B c, f 0, ω B, 1, ω B, E F f X = = 1 3 f f 1, ω B c 5, 3, ω Bc and { E F f 1 1 f 0, ω B, [ f 1 X 1 f X ]= 1 3 [ f 10 f 0 + f 1 0 f 1 + f 1 1 f 1], ω B c {, ω B, = 7 3, ω Bc.
7 Condtonal lmt theorems for condtonally negatvely assocated random varables 453 Hence E F [ f 1 X 1 f X ] E F f 1 X 1 E F f X, ths shows that the famly {X 1, X } s not F-NA. Example 3 Let ={1,, 3, 4, 5, 6} and let p = 1/6 be the probablty assgned to the event {}. Defne the events A 1 and A by A 1 ={1,, 3, 4} and A ={, 3, 4, 5}, and the random varables X 1 and X by X 1 = I A1 and X = I A.LetB ={6} and let F ={, B, B c, Ø} be the sub-σ -algebra generated by the event B. For any strctly ncreasng functons f 1 and f wth Ef 1 X 1 and Ef X fnte, some smple calculatons show that f 1 0, ω B, E F f 1 X 1 = 1 5 [ f f 1 1], ω B c, f 0, ω B, E F f X = 1 5 [ f f 1], ω B c and f 1 0 f 0, ω B, E F [ f 1 X 1 f X ]= 1 5 [ f 10 f 1 + f 1 1 f f 1 1 f 1], ω B c. Note that Hence f 1 0[ f 1 f 0] f 1 1[ f 1 f 0]. E F [ f 1 X 1 f X ] E F f 1 X 1 E F f X, ths shows that the famly {X 1, X } s F-NA. But the famly {X 1, X } s not NA as follows from the observaton E[ f 1 X 1 f X ]= 1 6 [ f 10 f 0 + f 1 0 f 1 + f 1 1 f f 1 1 f 1] 1 3 f f 11 3 f f 1 = Ef 1 X 1 Ef X. A concrete example where condtonal lmt theorems are useful s the study of statstcal nference for non-ergodc models as dscussed n Basawa and Prakasa Rao [] and Basawa and Scott [3]. For nstance, f one wants to estmate the mean off-sprng
8 454 D.-M. Yuan et al. θ for a Galton-Watson Branchng process, the asymptotc propertes of the mum lkelhood estmator depend on the set of non-extncton. As t was ponted out earler, the condtonal NA property does not mply the NA property and the opposte mplcaton s also not true. Hence one does have to derve lmt theorems under condtonng f there s a need for such results even through the proofs of such results may be analogous to those under the non-condtonng setup. Consequently, the study of the lmt theorems for sequences of condtonal NA random varables s of much nterest. Our am n ths paper s to dscuss condtonal lmt theorems for F-NA random varables. Precsely, we wll derve condtonal versons of several knds of lmt theorems: condtonal Rosenthal type nequalty, condtonal mean convergence theorem, condtonal complete convergence and condtonal central lmt theorem for sequences of F-NA random varables. We put S n = n X for a sequence of random varables {X n, n 1}. Let F be a sub-σ -algebra of A. {X n, n 1} wll be called condtonally centered f E F X n = 0 for every n 1, and t s called condtonally statonary gven F f for all 1 t 1 < < t k <, r 1, the jont dstrbuton of X t1,...,x tk condtoned on F s the same as the jont dstrbuton of X t1 +r,...,x tk +r condtoned on F a.s. From now on, we assume that the condtonal expectatons under consderaton exst and the condtonal dstrbutons exst as regular condtonal dstrbutons cf. Chow and Techer [5]. We conclude ths secton by some basc propertes of F-NA random varables. The frst property s mmedate from the defnton of an F-NA sequence. Proposton P1 Coordnatewse nondecreasng or nonncreasng functons defned on dsjont subset of a set of F-NA random varables are F-NA. The followng property wll be used frequently n the subsequent sectons. Proposton P If two sets of F-NA random varables are F-ndependent of one another, then ther unon s a set of F-NA random varables. In partcular, f {X n, n 1} s F-NA, then {X n E F X n, n 1} s condtonally centered and F-NA. Proof Let X = X 1, X,...,X n, Y = Y 1, Y,...,Y m be F-ndependent vectors of each other, each F-NA, Let X 1, X and Y 1, Y denote arbtrary parttons of X and Y, respectvely. Let f 1 and f be arbtrary coordnatewse nondecreasng functons wth fnte expectatons as need. Wrtng f 1 for f 1 X 1, Y 1, and f for f X, Y. Snce X and Y are F-ndependent, we have E F X,Y f 1 f = E F X EF Y f 1 f by takng f = u I A and by usng the usual approxmaton method, where E F X denotes condtonal expectaton over the dstrbuton of X, EY F denotes condtonal expectaton over the dstrbuton of Y, and E F X,Y denotes condtonal expectaton over the jont dstrbuton of X and Y.
9 Condtonal lmt theorems for condtonally negatvely assocated random varables 455 Snce f 1 x 1, y 1 and f x, y are nondecreasng functons n y 1 and y, respectvely, we conclude that E F Y f 1 f E F Y f 1 E F Y f, and therefore E F X,Y f 1 f E F X EY F f 1 EY F f. Note that EY F f 1x 1, Y 1 and EY F f x, Y are nondecreasng functons n x 1 and x, respectvely, so that EY F f 1 EY F f E F X EF Y f 1 E F X EF Y f. Hence E F X E F Y f 1 f E F X,Y f 1 E F X,Y f agan from the F-ndependence of X and Y. Condtonal Rosenthal type nequaltes The followng condtonal Rosenthal type nequaltes for F-NA random varables extend the correspondng results for NA random varables, see for example, Theorem of Shao [17] or Theorem 1 of Su et al. [18]. Moreover, these are the man tools for studyng the lmt results n the subsequent sectons. Theorem 1 Let {X n, n 1} be a sequence of condtonally centered F-NA random varables. Then there exsts a postve constant C p dependng only p such that for all n 1, E F S k p C p 1 k n and E F S k p C p 1 k n E F X p a.s. for 1 p 1 p/ E F X p + E F X a.s. for p >. Proof The basc approach of ths proof s based on Yuan and An [1] but the detals are qute dfferent. Wthout loss of generalty, we can assume that E F X p <
10 456 D.-M. Yuan et al. a.s., 1, for otherwse both the rght-hand sde of 1 and the rght-hand sde of are almost surely nfnty and there s nothng to prove. We frst prove 1. Set U = X, X + X +1,...,X + + X n, 1 n. Clearly, U = X, X + U +1. From the elementary nequalty x + y p p x p + y p + px y p 1 sgn{y} for 1 p, 3 t follows that for 1 n 1 E F U p E F X p I U E F X + U +1 p I U +1 > 0 p E F X p + E F U +1 p + pe F X U +1 p 1 I U +1 > 0 a.s. for 1 p. It s easy to show that gx +1,...,X n := U +1 p 1 I U +1 > 0 s a coordnatewse nondecreasng functon of X j. Thus, by the hypothess of F-NA property, we have for 1 n 1 E F U p p E F X p + E F U +1 p a.s. for 1 p. 4 Substtutng sequentally, we conclude that E F 1 k n S k p p E F X p a.s. for 1 p. 5 By P1, { X n, n 1} s also a sequence of condtonally centered F-NA random varables. In the same way, we also have E F S p k 1 k n p E F X p a.s. for 1 p. 6 Observe that 1 k n S k p 1 k n S k p + S p k 1 k n. 7 Relaton 1 follows mmedately by combnng 5, 6 and 7. Now we turn to the proof of, by nducton on p. In the same manner, wth the excepton of relaton 3 beng replaced by the followng elementary nequalty x + y p p x p + y p + px y p 1 sgn{y}+ p p x y p for p >, we obtan the analogue of 4 E F U p p E F X p + E F U +1 p + p p E F X U +1 p I U +1 > 0
11 Condtonal lmt theorems for condtonally negatvely assocated random varables 457 a.s. for p >. Summng over 1 n 1 on both sde of the above nequalty, we conclude that E F 1 k n S k p p E F n 1 X p + p p a.s. for p >. Observe that U p +1 I U +1 > 0 = 0, X +1, X +1 + X +,...,X X n p E F X U +1 p I U +1 > 0 = S, S + X +1, S + X +1 + X +,...,S + X X n S p p p + S p 1 k n S k p 1 1 k n S k p. Hence E F 1 k n S k p p E F X p + p 1 p E F S n 1 k p 1 k n X 8 a.s. for p >. Smlarly, 8 remans vald for E 1 k n S k p.usng7agan, from 8 we get E F S k p p+1 1 k n E F X p + p p E F S n 1 k p 1 k n a.s.for p >. But by the condtonal verson of the Hölder nequalty c.f. Loéve [11], we have p p E F S n 1 k p 1 k n E F S k p 1 k n X p /p E F n 1 p p X p/ n 1 p/ p 1 p E F S k p + p +1 p p 1 E F X. 1 k n Here we have used the elementary nequalty a α b β αa + βb for non-negatve numbers a, b,α,β wth α + β = 1. Puttng ths nequalty nto 9, we get then /p X 9
12 458 D.-M. Yuan et al. E F S k p C p 1 k n E F X p + E F X p/ a.s.. 10 Here and n the sequel, the constant C p dependng only p may be dfferent at each appearance. Let X + = 0, X, X = 0, X. Set ζ = X + E F X +,δ = X E F X, 1 n. Wehave E F X p/ X + X p/ = E F p/ C p E F X + + X p/ C p EF X + p/ + E F X C p EF ζ + E F p/ X + + E F δ + E F p/ X C p EF p/ p/ p/ ζ + E F δ + E F X a.s.. 11 To complete the proof of, we frst consder the specal case < p, thus 1 < p/. It s noted that X + and X are nondecreasng and nonncreasng functons of X, respectvely, so that {ζ, 1} and {δ, 1} are both condtonally centered F-NA random varables by P. Hence p/ E F ζ C p E F ζ p/ { C p E F X + E F X + } p/ { } p/ C p E F X p + E F X p/ C p E F X p + E F X a.s. 1
13 Condtonal lmt theorems for condtonally negatvely assocated random varables 459 by 1, and analogously for the term correspondng to E F n δ p/.from10, 11 and 1, relaton follows n the specal case < p. We suppose that relaton struefor k < p k+1 where k 1. For k+1 < p k+, that s k < p/ k+1, by the nducton hypothess, p/ E F ζ p/4 C p E F ζ p/ + E F ζ p/ p/4 C p E F X p + E F X + E F X 4 a.s.. 13 Notng that p > 4, we conclude that E F X 4 = whch yelds [ p 4/p E F X X p /p ] { p 4/p E F X E F X p } /p E F X p 4/p /p E F X p a.s., p/4 pp 4/4p p/p E F X 4 E F X E F X p p/ C p E F X + E F X p a.s.. 14 By 13 and 14, E F p/ ζ C p p/ E F X p + E F X a.s.. 15 Smlarly, 15 remans vald for E F n δ p/.from10 and 15, relaton s proved for the general case of k+1 < p k+, thus the proof s complete.
14 460 D.-M. Yuan et al. 3 Condtonal mean convergence theorems Chandra and Goswam [4] ntroduced a specal type of unform ntegrablty called resdual Cesàro alpha-ntegrablty. More recent dscusson on ths topc can be found n Yuan et al. [0]. Yuan and Tao [19] extended ths concept to resdual h-ntegrablty, whch s weaker than the exstng unform ntegrablty. Now we further weaken unform ntegrablty. Defnton For α>0 fxed, a sequence of random varables {X n, n 1} s sad to be condtonally resdually Cesàro alpha-ntegrable gven F F-RCIα, n short f 1 sup n 1 n E F 1 X < a.s. and lm n n E F [ X α I X > α ] =0a.s.. Clearly, f {X n, n 1} have dentcal condtonal dstrbutons that s, E F I X x = E F I X j x a.s. for < x < wth E F X 1 < a.s., then {X n } s F-RCIα for any α>0. Let p > 1 and let hx be a strctly postve functon defned on 1, +. In ths secton, we dscuss condtonal mean convergence theorems of the form of n hp 1 n S ES for F-NA random varables {X n, n 1}, provded that { X n p, n 1} s F-RCIα for an approprate α. Our frst result s dealng wth the case 1 < p <. Theorem Let 1 < p <, and let {X n, n 1} be a sequence of F-NA random varables. If { X n p, n 1} s F-RCIα for some α 0, 1/p, then condtonally on F n 1/p S E F S 0 n L p. Proof Let 1 n Y n = n α I X n < n α + X n I X n n α + n α I X n > n α, n 1, and for each n 1, defne Z n = X n Y n, S 1 n = Y and S n = Z. It s easy to see that Y n =mn { X n, n α }, Z n = X n n α I X n > n α, and 16 Z n p X n p n α I X n p > n α 17 for all p > 1. Moreover, {Y n E F Y n, n 1} and {Z n E F Z n, n 1} are both sequences of condtonally centered F-NA random varables n vew of P.
15 Condtonal lmt theorems for condtonally negatvely assocated random varables 461 For our purpose, t suffces to prove n /p E F S 1 1 n E F S 1 0 a.s. 18 and n 1 E F S 1 n E F S p 0 a.s.. 19 Usng relatons 1, 17 and the second condton of the F-RCIα property 16 of the sequence { X n p, n 1}, we obtan n 1 E F S 1 n E F S p n 1 E F Z E F p Z n 1 E F Z p n 1 E F [ X p α I X p > α ] 0 a.s.. ths proves 19. Here and n the sequel, represents the Vnogradov symbol O. For 18, usng relaton 1 agan,wehave n /p E F S 1 1 n E F S 1 n /p n /p E F Y E F Y E F Y n /p n pα E F X p n pα 1/p sup n 1 n 1 E F X p a.s.. Usng the frst condton of the F-RCIα property 16 of the sequence { X n p, n 1}, the last expresson above clearly goes to 0 as n, because p < and α<1/p, thus completng the proof. Next we consder the case p =. Theorem 3 Let {X n, n 1} be a sequence of F-NA random varables. If { X n p, n 1} s F-RCIαforsomeα 0,, then, for any δ>0, condtonally on F n 1/+δ 1 n S ES 0 n L.
16 46 D.-M. Yuan et al. Proof The proof s smlar to that of Theorem. It suffces to prove that condtonally on F n 1/+δ S 1 E F S 1 0 n L 1 n and n 1/+δ S 1 n E F S 0 n L. These convergences can be establshed by usng relaton 1, and the detals are omtted. For the case p >, we have Theorem 4 Let p >, and let {X n, n 1} be a sequence of F-NA random varables. If { X n p, n 1} s F-RCIαforsomeα 0, 1 /p, then condtonally on F n 1/q S E F S 0 n L p, 1 n where q := p/p 1 s the dual number of p. Proof Proceedng as n the proof of Theorem, we need to show that condtonally on F n 1/q S 1 E F S 1 0 nl p 0 1 n and n 1/q S 1 n E F S 0 nl p. 1 Usng relaton, the Hölder nequalty, relaton 17 and the second condton of the F-RCIα property 16 of the sequence { X n p, n 1}, we obtan n p/q E F S 1 n E F S p p/ Z E F Z n p/q E F Z E F p Z + n p/q E F n p/q Z E F p Z + n p/ E F E F Z E F p Z n p/ n 1 E F Z p E F [ X p α I X p > α ] 0 a.s.,
17 Condtonal lmt theorems for condtonally negatvely assocated random varables 463 ths proves 1. For 0, usng relaton agan,wehave n p/q E F n p/q n p/q n p 1 S 1 1 n E F S 1 p E F Y E F p Y + n p/q E F E F Y p + n p 1 E F Y p n p 1+pα E F X p n p+pα+ sup n 1 n 1 E F Y p E F X p a.s.. p Y E F Y Usng the frst condton of the F-RCIα property 16 of the sequence { X n p, n 1}, the last expresson above clearly goes to 0 a.s. as n, because p > and α<1 /p, thus completng the proof. 4 Condtonally complete convergence A sequence of random varables {X n, n 1} s sad to converge completely to a constant a f for every ε>0, P X a >ε<. Ths concept was defned by Hsu and Robbns [6]. Note that complete convergence mples almost sure convergence n vew of the Borel Cantell lemma. Now we extend ths concept. Defnton 3 A sequence of random varables {X n, n 1} s sad to be condtonally converge completely gven F to a constant a f P X a >ε F < for every ε>0, and we wrte X n a condtonally completely gven F. Chandra and Goswam [4] ntroduced a specal type of unform ntegrablty called strongly resdual Cesàro alpha-ntegrablty, and some of ts applcatons can be found n Yuan et al.[0] and Yuan and An [1]. Now we further extend ths concept. Defnton 4 For α>0 fxed, a sequence {X n, n 1} of random varables s sad to be condtonally strongly resdually Cesàro alpha-ntegrable gven F F-SRCIα, n
18 464 D.-M. Yuan et al. short f 1 sup n 1 n E F X < a.s. and n=1 1 n EF [ X n n α I X n > n α ] < a.s.. That the condton of F-SRCIα s a strong verson of the condton of F-RCIα s an easy consequence of the Kronecker lemma. In ths secton, we wll show that each of the theorems n the prevous secton has a correspondng strong analogue n the sense of condtonal complete convergence. We gve a lemma pror to statng our condtonal complete convergence results. Lemma 1 For sequences {a n, n 1} and {b n, n 1} of non-negatve real numbers, f sup n 1 n 1 a < and b n <, n=1 then m a b sup m 1 a m 1 b for every n 1. Proof Let {a, 1 n} and {b, 1 n} be, respectvely, the rearrangements of {a, 1 n} and {b, 1 n} satsfyng a 1 a a n and b 1 b b n. Then n a b n a b. So wthout loss of generalty, one can assume that {a, 1 n} and {b, 1 n} are nonncreasng. By applyng Remark 3 n Landers and Rogge [8], and by usng the monotoncty of {a n } and {b }, one can complete the rest of the proof. Theorem 5 Let 1 < p <, and let {X n, n 1} be a sequence of F-NA random varables. If { X n p, n 1} s F-RCIαforsomeα 0, 1/p, then n 1/p S E F S 0 condtonally completely gven F. 1 n Proof For each n 1, let m = m n be the nteger such that m 1 < n < m. Observe that n 1/p S E F S n 1/p S E F S 1 n 1 m m 1 1/p S E F S 1 m = 1/p m/p 1 m S E F S.
19 Condtonal lmt theorems for condtonally negatvely assocated random varables 465 Hence t suffces to prove m/p 1 m S E F S 0 condtonally completely gven F. Let Y n, Z n, S n 1 and S n be defned as n the proof of Theorem. We frst prove that m/p S 1 m E F S 0 completely condtonally gven F, namely m/p Z k E F Z k 0 condtonally completely gven F. 3 1 m k=1 Usng relatons 1, 17 and the second condton of the F-SRCIα property of the sequence { X n p },wehave E F m/p Z 1 m k E F Z k = m m k=1 E F Z p E F Z p m: m 1 E F Z p m p 1 E F [ X p α I X p > α ] < a.s., whch yelds 3. Next we show that m/p S 1 1 m E F S 1 0 condtonally completely gven F, namely m/p Y 1 m k E F Y k k=1 p 0 condtonally completely gven F. 4
20 466 D.-M. Yuan et al. By relaton 1 E F m/p 1 m Y k E F Y k k=1 m m/p m m/p E F Y pα E F X p. In vew of the frst condton of the F-SRCIα property of the sequence { X n p } and Lemma 1, we conclude that = E F m/p 1 m m m/p pα m: m /p+ pα Y k E F Y k k=1 pα 1 p1/p α /p m The last seres above converges because p < and α<1/pand therefore 4 holds. Ths completes the proof. Theorem 6 Let {X n, n 1} be a sequence of F-NA random varables. If { X n, n 1} s F-SRCIαforsomeα 0,, then, for every δ>0, n 1/+δ S E F S 0 condtonally completely gven F. 1 n a.s.. Proof The proof s smlar to that of Theorem 5. It suffces to prove E F m1/+δ Z k E F Z k < 1 m and k=1 E F m1/+δ Y 1 m k E F Y k <. These results can be proved by usng relaton 1, and the detals are omtted. k=1
21 Condtonal lmt theorems for condtonally negatvely assocated random varables 467 Theorem 7 Let p >, and let {X n, n 1} be a sequence of F-NA random varables. If { X n p, n 1} s F-SRCIα forsomeα 0, 1 /p, then n 1/q S E F S 0 condtonally completely gven F. 1 n Proof Proceedng as n the proof of Theorem 5, we need only to show that m/q 1 m k=1 Z E F Z 0 condtonally completely gven F 5 and m/q 1 m k=1 Y E F Y 0 condtonally completely gven F 6 reman true. By relaton and the Hölder nequalty, E F m/q 1 m m mp/q p Z k E F Z k k=1 E F Z p + mp/q E F mp/q E F m mp/q E F Z p m Z E F Z p m: m p/ E F Z p 1 E F Z p a.s.. mp/ p/ m Z p/
22 468 D.-M. Yuan et al. Usng relaton 17 and the second condton of the F-SRCIα property of the sequence { X n p }, we conclude that E F m/q Z 1 m k E F Z k k=1 p 1 E F [ X p α I X p > α ] <, whch yelds 5. As for 6, by relaton agan and the Hölder nequalty, E F m/q 1 m m mp/q k=1 Y k E F Y k p E F Y E F p Y + mp/q E F mp/q E F m m mp/q+mp m m m p 1 p Y E F Y E F Y E F p Y E F Y p m m p 1 αp E F X p a.s.. m Y E F Y In vew of the frst condton of the SRCIα property of the sequence { X n p } and Lemma 1, we conclude that E F m/q 1 m p Y k E F Y k k=1 m m p 1 αp m: m p+1+αp αp m p 1 The last seres converges snce α 0, 1 /p mples p αp < 1 and so 6 holds. a.s.. p
23 Condtonal lmt theorems for condtonally negatvely assocated random varables Condtonal central lmt theorem The followng lemma s a condtonal verson of Theorem 1 of Newman and Wrght [13], whch s of ndependent nterest. Lemma Suppose that {X, 1 n} s a set of F-NA random varables wth E F X < for each 1 n. Then for any real number t, n EF exp t X j E F exptx j 1 t Cov F X j, X k. j=1 j=1 1 j =k n Proof The result s true for n = 1 trvally and for n = from the observaton c.f. Prakasa Rao [15] Cov F exptx 1, exptx t Cov F X 1, X. So, the result follows by nducton, and by usng the fact that f X,Y and Z are F-NA then so are txare ty + Z by P1 as they are nondecreasng or nonncreasng functons of F-NA random varables accordng to t > 0ort < 0. The next lemma s a precse restatement of Theorem 8 n Prakasa Rao [15]. Lemma 3 Suppose that the random varable X satsfy E F X = 0,τF = EF X <. Then for every F-measurable random varable T, E F [ ] n exptx/τ F n exp T / a.s. as n. Proof We frst fx a real number t.let{x, X n, n 1} be a sequence of F-ndependent random varables wth dentcal condtonal dstrbutons and let S n = n X.By Theorem 8 n Prakasa Rao [15], E F [ expts n /τ F n ] exp t / a.s. as n. 7 On the other hand, we can prove that E F e ty 1+Y Z = E F e ty 1 Z E F e ty Z, provded that Y 1 and Y are F-ndependent and Z s F-measurable by takng frst Z to be a smple random varable and then by usng the usual approxmaton. Further E F [ ] n expts n /τ F n = E F [ ] exptx j /τ F n j=1 = E F [ ] n exptx/τ F n 8
24 470 D.-M. Yuan et al. by nducton on n. So, t follows that E F [ ] n exptx/τ F n exp t / a.s. as n by combnng 7 and 8. Next, the desred result can be completed by takng T = k j=1 t j I A j, and by usng the usual approxmaton. Our condtonal central lmt theorem stated n terms of condtonal characterstc functons reads as follows. Theorem 8 Let {X n, n 1} be a sequence of F-statonary and F-NA random varables wth E F X 1 = 0, E F X1 < a.s. Then σf := EF X1 + Cov F X 1, X 0 a.s., 9 = n 1 E F S n σ F a.s., 30 and the seres converges almost surely. If σ F > 0 almost surely, then [ E F e ts ] n/σ F n e t / a.s. as n. 31 Proof Relaton 9 s a drect consequence of 30. So, we only need to prove relatons 30 and 31. By the condtonal statonarty, m E F Sm = mef X1 + m j + 1Cov F X 1, X j. j= Note that Cov F X 1, X j 0 for all j. We get whch mples 0 lm m 1 j 1 Cov F X 1, X j E F X m 1 m, j= 0 lm m lm [m/] j= [m/] m E F X 1, j= Cov F X 1, X j 1 j 1 Cov F X 1, X j m
25 Condtonal lmt theorems for condtonally negatvely assocated random varables 471 that s, the seres m j= Cov F X 1, X j converges almost surely. Further m m j 1 Cov F X 1, X j 0 j= a.s. as m by the Kronecker lemma. Hence 1 m EF S m σ F = j=m+1 + m j= Cov F X 1, X j m j 1 Cov F X 1, X j 0 a.s. asm. Therefore 30 holds. Next we prove 31. Let ψ F n r = EF [ exprs n /σ F n ]. Relaton 31 turns nto ψ F n r exp r / a.s. as n. 3 For any fxed l = 1,,...,defne m as the greatest nteger less than or equals to n/l. Note that ψn F r ψf ml r r /σf [E F S n / n S ml / ml ] 1/ and that n vew of relaton 1, E F Sn S ml = E F 1 1 n S n S ml 1 S ml n ml ml n E F 1 n S n S ml + E F 1 1 S ml ml n n ml n = n ml + 1 n = 1 E F X ml 1 n mle F X 1 ml E F X1 n ml E F X1 0 a.s. asn, n so ψ F n r ψf ml r 0 a.s. as n. 33
26 47 D.-M. Yuan et al. Next we defne Y l j = S jl S j 1l /σ F l for j = 1,...,m wth S0 = 0, so that S ml /σ F ml = Y l 1 + +Ym l / m. Note that the famly {Y l j, 1 j m} s F-NA by P1 and P. It follows from the condtonal statonarty and from Lemma wth X j = Y l j and t = r/ m, that ψml F r ψl F m r/ m = r m EF exp m 1 = r EF 1 j =k m j=1 Y l j m j=1 r /mcov F Y l j, Y l k Y l 1 + +Y l m m 1 m E [exp F m E F Y l j j=1 = r [ σf E F S ml / m E F S l / ] l j] r Y l m r σf σf σ l,f a.s. as m, 34 where σ l,f = EF S l / l. Settng Y 1 = S l, and applyng Lemma 3 wth τ F = l 1 σ l,f = EF S l,wehave ψl F m r/ m = = [ E F exp E F [ exp ] m ry 1 / σ F ml exp τf r / lσf τf r Y 1 / ] m τ F m lσf Therefore for any fxed l, we have by combnng 33, 34 and 35, lm sup ψ F n r exp r / n = r σ F a.s. as m. 35 σ F σ l,f + exp τ F r /lσ F exp r /. Snce σl,f = l 1 E F Sl σ F and τ F /lσ F 1asl by relaton 30, ths yelds 3 as desred and completes the proof of Theorem 8. Acknowledgments The authors would lke to sncerely thank the referees for ther valuable comments and suggestons on a prevous draft, whch resulted n the present verson of ths paper. The frst and second authors are supported by the Natonal Natural Scence Foundaton of Chna and by the Natural Scence Foundaton Project of CQ CSTC Of Chna 009BB370.
27 Condtonal lmt theorems for condtonally negatvely assocated random varables 473 References 1. Alam, K., Saxena, K.M.L.: Postve dependence n multvarate dstrbutons. Commun. Statst. Theory Methods A 10, Basawa, I.V., Prakasa Rao, B.L.S.: Statstcal Inference for Stochastc Processes. Academc press, London Basawa, I.V., Scott, D.: Asymptotc Optmal Inference for Non-ergodc models. Lecture Notes n Statstcs, vol. 17. Sprnger, New York Chandra, T.K., Goswam, A.: Cesàro-ntegrablty and laws of large numbers II. J. Theoret. Probab. 19, Chow, Y.S., Techer, H.: Probablty Theory: Independent, Interchangeablty, Martngales. Sprnger, New York Hsu, P.L., Robbns, H.: Complete convergence and the law of large numbers. Proc. Natl. Acad. Sc. 33, Joag-Dev, K., Proschan, F.: Negatve assocaton of random varables wth applcatons. Ann. Statst. 11, Landers, D., Rogge, L.: Laws of large numbers for uncorrelated Cesàro unformly ntegrable random varables. Sankhyā Ser.A59, Lang, H.Y., Su, C.: Complete convergence for weghted sums of NA sequences. Statst. Probab. Lett. 45, Ln, Z.Y.: An nvarance prncple for negatvely assocated random varables. Chn. Sc. Bull. 4, Loéve, M.: Probablty Theory. Sprnger, New York Matula, P.: A note on the almost sure convergence of sums of negatvely dependent random varables. Statst. Probab. Lett. 15, Newman, C.M., Wrght, A.L.: An nvarance prncple for certan dependent sequences. Ann. Probab. 9, Newman, C.M.: Asymptotc ndependence and lmt theorems for postvely and negatvely dependent random varables. In: Tong, Y.L. ed. Inequaltes n Statstcs and Probablty. IMS Lectures Notes-Monograph seres, vol. 5, pp Hayward, CA Prakasa Rao, B.L.S.: Condtonal ndependence, condtonal mxng and condton assocaton. Ann. Inst. Statst. Math. 61, Shao, Q.M., Su, C.: The law of the terated logarthm for negatvely assocated random varables. Stoch. Proc. Appl. 83, Shao, Q.M.: A comparson theorem on moment nequaltes between negatvely assocated and ndependent random varables. J. Theoret. Probab. 13, Su, C., Zhao, L., Wang, Y.: Moment nequaltes and weak convergence for negatvely assocated sequences. Sc. Chn. Ser. A 40, Yuan, D.M., Tao, B.: Mean convergence theorems for weghted sums of arrays of resdually h-ntegrable random varables concernng the weghts under dependent assumptons. Acta Appl. Math. 103, Yuan, D.M., An, J., Tao, B.: Laws of large numbers for resdual Cesàro alpha-ntegrable sequences under dependence assumptons. Statst. Probab. Lett. 79, Yuan, D.M., An, J.: Rosenthal type nequaltes for asymptotcally almost negatvely assocated random varables and applcatons. Sc. Chn. Ser. A 5,
A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationDirichlet s Theorem In Arithmetic Progressions
Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons,
More informationStrong Markov property: Same assertion holds for stopping times τ.
Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationPROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 7, July 1997, Pages 2119{2125 S (97) THE STRONG OPEN SET CONDITION
PROCDINGS OF TH AMRICAN MATHMATICAL SOCITY Volume 125, Number 7, July 1997, Pages 2119{2125 S 0002-9939(97)03816-1 TH STRONG OPN ST CONDITION IN TH RANDOM CAS NORBRT PATZSCHK (Communcated by Palle. T.
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationLecture 4 Hypothesis Testing
Lecture 4 Hypothess Testng We may wsh to test pror hypotheses about the coeffcents we estmate. We can use the estmates to test whether the data rejects our hypothess. An example mght be that we wsh to
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationTAIL PROBABILITIES OF RANDOMLY WEIGHTED SUMS OF RANDOM VARIABLES WITH DOMINATED VARIATION
Stochastc Models, :53 7, 006 Copyrght Taylor & Francs Group, LLC ISSN: 153-6349 prnt/153-414 onlne DOI: 10.1080/153634060064909 TAIL PROBABILITIES OF RANDOMLY WEIGHTED SUMS OF RANDOM VARIABLES WITH DOMINATED
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationLecture 17 : Stochastic Processes II
: Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss
More informationSupplement to Clustering with Statistical Error Control
Supplement to Clusterng wth Statstcal Error Control Mchael Vogt Unversty of Bonn Matthas Schmd Unversty of Bonn In ths supplement, we provde the proofs that are omtted n the paper. In partcular, we derve
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationSupplementary material: Margin based PU Learning. Matrix Concentration Inequalities
Supplementary materal: Margn based PU Learnng We gve the complete proofs of Theorem and n Secton We frst ntroduce the well-known concentraton nequalty, so the covarance estmator can be bounded Then we
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationLecture 4: September 12
36-755: Advanced Statstcal Theory Fall 016 Lecture 4: September 1 Lecturer: Alessandro Rnaldo Scrbe: Xao Hu Ta Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer: These notes have not been
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationEXPONENTIAL ERGODICITY FOR SINGLE-BIRTH PROCESSES
J. Appl. Prob. 4, 022 032 (2004) Prnted n Israel Appled Probablty Trust 2004 EXPONENTIAL ERGODICITY FOR SINGLE-BIRTH PROCESSES YONG-HUA MAO and YU-HUI ZHANG, Beng Normal Unversty Abstract An explct, computable,
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationComplete Convergence for Weighted Sums of Weakly Negative Dependent of Random Variables
Flomat 30:12 (2016), 3177 3186 DOI 10.2298/FIL1612177N Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://www.pmf.n.ac.rs/flomat Complete Convergence for Weghted Sums
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationThree Kinds of Geometric Convergence for Markov Chains and the Spectral Gap Property
E l e c t r o n c J o u r n a l o f P r o b a b l t y Vol. 6 (0), Paper no. 34, pages 00 09. Journal URL http://www.math.washngton.edu/~ejpecp/ Three Knds of Geometrc Convergence for Markov Chans and the
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationY. Guo. A. Liu, T. Liu, Q. Ma UDC
UDC 517. 9 OSCILLATION OF A CLASS OF NONLINEAR PARTIAL DIFFERENCE EQUATIONS WITH CONTINUOUS VARIABLES* ОСЦИЛЯЦIЯ КЛАСУ НЕЛIНIЙНИХ ЧАСТКОВО РIЗНИЦЕВИХ РIВНЯНЬ З НЕПЕРЕРВНИМИ ЗМIННИМИ Y. Guo Graduate School
More informationP exp(tx) = 1 + t 2k M 2k. k N
1. Subgaussan tals Defnton. Say that a random varable X has a subgaussan dstrbuton wth scale factor σ< f P exp(tx) exp(σ 2 t 2 /2) for all real t. For example, f X s dstrbuted N(,σ 2 ) then t s subgaussan.
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
More informationFluctuation Results For Quadratic Continuous-State Branching Process
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 3 Ver. III (May - June 2017), PP 54-61 www.osrjournals.org Fluctuaton Results For Quadratc Contnuous-State Branchng
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationSharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.
Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationA be a probability space. A random vector
Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationDimensionality Reduction Notes 1
Dmensonalty Reducton Notes 1 Jelan Nelson mnlek@seas.harvard.edu August 10, 2015 1 Prelmnares Here we collect some notaton and basc lemmas used throughout ths note. Throughout, for a random varable X,
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationConjugacy and the Exponential Family
CS281B/Stat241B: Advanced Topcs n Learnng & Decson Makng Conjugacy and the Exponental Famly Lecturer: Mchael I. Jordan Scrbes: Bran Mlch 1 Conjugacy In the prevous lecture, we saw conjugate prors for the
More informationTail Dependence Comparison of Survival Marshall-Olkin Copulas
Tal Dependence Comparson of Survval Marshall-Olkn Copulas Hajun L Department of Mathematcs and Department of Statstcs Washngton State Unversty Pullman, WA 99164, U.S.A. lh@math.wsu.edu January 2006 Abstract
More informationAsymptotic Properties of the Jarque-Bera Test for Normality in General Autoregressions with a Deterministic Term
Asymptotc Propertes of the Jarque-Bera est for Normalty n General Autoregressons wth a Determnstc erm Carlos Caceres Nuffeld College, Unversty of Oxford May 2006 Abstract he am of ths paper s to analyse
More informationA Note on Bound for Jensen-Shannon Divergence by Jeffreys
OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More information