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

Size: px
Start display at page:

Download "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"

Transcription

1 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: Departmet of Statistics Faculty of Mathematical Scieces, Ferdowsi Uiversity, Mashhad, Ira Bozorg@math.um.ac.ir, Fax: Abstract: I this paper, we study some P P strog it theorems for the sequece f fi X g, for each fi > 0 ad weighted sums a kx k where fx ; g is a sequece of egative depedece Sub-Gaussia radom variables ad a k is a array of oegative real umbers. Key Words: Negative Depedet,Sub-Gaussia, Strog Law of Large Numbers, Weighted Sums,Martigale..Itroductio Some P covergece theorems for weighted sums a k X k has bee studied by Chow [4] for the case where fx ; g is a sequece of idepedet, geeralized Gaussia radom variables. The case of m-depedet geeralized Gaussia r.v.'s has bee discussed by Ouy [6], ad the strog law of large umbers for sequeces of idepedet Sub-Gaussia radom variables has bee obtaied by Taylor ad Chug Hu [9]. I this paper, we exted some of these results ad prove somep strog it theorems for the sequece of f fi X g, for each fi > 0, ad weighted sums P a k X k where fx ; g is a sequece of egative depedet Sub-Gaussia radom variables ad a k is a array of oegative real umbers. Also P by sub-gaussia techiques we prove that a k X k coverge with probability oe for each, where E[X jf ] = 0, F = ff(x ; ;X ) ad P j=k a j = O(k fi ) for every fi > 0.To prove these results we eed to the followig defiitios, lemmas ad theorems. Defiitio. A symmetric radom variable X is said to be Sub- Gaussia (SG) r.v. if there exist a oegative real umber ff such that for Λ This research supported by cetral research of statistics each real umber t Ee tx» exp[ ff t (:) The umber, fi(x) = iffff 0:E(e tx )» exp[ ff t ]; t Rg, will be called the Gaussia stadard of the radom variable X. It is evidet that X will be a Sub-Gaussia radom variable if ad oly if fi(x) <. Moreover fi(x) = sup t6=0 " l(e(e tx )) t # = ; ad iequality (.) holds for ff = fi(x). Defiitio.A symmetric radom variable X is strictly Sub-Gaussia if E(X )=fi (X): Defiitio 3.The radom variables X ; ;X are said to be ND if we have P[ P [ ad (X j» x j )]» (X j >x j )]» P [X j» x j ]; (:) P [X j >x j ]; (:3)

2 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 do ot agree for 3 (see [3],Pages 3-4). The followig Lemmas ad Theorems which our work is based o ca be foud i Taylor, Chug Hu (987),Buldygi, Kozacheko (980) ad Bozorgia, Taylor (996). Theorem. ( [0]) Let X be Sub-Gaussia radom variable ad a is a real umber (a 6= 0), the ax is sub-gaussia radom variable with fi(x) =jajfi(x). Lemma. ( [9]) If X is a Sub-Gaussia radom variable with fi(x)» ff, the i) For every t R, ad E[e tjxj ]» exp[ ff t (:4) For every ">0, we have P[X>"]»exp[ " ff ] (:5) P [jxj >"]»exp[ " (:6) ff Lemma. ( [9]) If X is bouded (jxj»m) ad has zero mea (E(X) = 0), the X is Sub- Gaussia radom variable with fi(x)» p M. Lemma 3.( [3]) Let X ; ;X be ND radom variables ad f ;f be a sequece of Borel fuctios which all are mootoe icreasig (or all are mootoe decreasig), the f (X ); ;f (X ) are ND radom variables. Lemmas 4.( [3]) Let X ; ;X be ND oegative radom variables. The Examples. E[ X j ]» E[X j ) Let X has uiform distributio i (a; b) iterval, the Y = X a+b is Sub-Gaussia radom variable with fi(y )» p (b a). ) Let X be a cotiuous radom variable with d.f. F (x), the Y = F (X) is Sub- Gaussia with fi(y )» p. 3) Let X be a radom variable with d.f. Normal ad E(X) =0; Var(X)=ff, the X is strictly Sub-Gaussia with fi (X) =ff.. Strog Limit Theorems I this sectio we obtai some strog it theorems for sequece f fi P X k g for each fi>0, where fx ; g is a sequece of egative depedet Sub-Gaussia radom variables with fi(x )» ff, for every, uder the coditios o P ff k. Theorem. Let fx ; g be a sequece of ND Sub-Gaussia radom variables with fi(x )» ff. i) S = P X k is a Sub-Gaussia r.v. with ff = P i= ff i. i P If i= ff i = O( fi ) for every fi>0, the! X k =0 W:P:: If ff = ff = = ff = ff, the for some fi>,! fi X k =0 W:P:: i) By Lemmas,3,4 ad Theorems we have E[e ts ]» E[e tx k ]» exp[ ff t ]; hece S is a Sub-Gaussia r.v. with ff = P i= ff i. For each " > 0 by part i ad Lemma (., we have P [j X k j >"]» exp[ " ( fi) ] < ; c

3 i ad also P [j fi X k j >"]» exp[ " fi ff ] < : which these complete the proof.. Theorem 3. Let fx ; g be a sequece of ND radom variables satisfyig P [a» X i» b] =, for each i where a<b, the for every fi>,! fi (X k E(X k )) = 0; W:P:: Defie Y k = X k E(X k ), k =;; ;, the, E(Y k ) = 0 ad jy k j» (b a), W.P., hece by Lemma fy k ; k g be a sequece of Sub-Gaussia radom variables with fi(y k )» p (b a). Thus by Theorem (3.i, for every fi>,wehave! fi (X k E(X k )) = 0; W:P:: Corollary. Let fx ; g be a sequece of ND idetically distributed radom variables with E(X )=0, Var(X )= ad E[X k ] < k, the p S is a asymptotically Sub-Gaussia radom variable, whe! with fi( p S )». For t R p E[e t S ]» we have p E[e t X k ]= [ + t + ffi( )]! e t ; whe!..some Strog Limit Theorems for weighted sums I this sectio, we obtai some strog it theorems for weighted sums T = P a k X k ad P a k X k, where fx ; g is a sequece of egative depedece Sub-Gaussia radom variables ad a k is a array of oegative real umbers.also we prove T = P a k X k covergece W.P.. uder the coditio that E[X jf ]=0,F = ff(x ; ;X ) ad P j=k a j = O(k fi ) for every fi>0 ad. Lemma 5. Let fx ; g be a sequece of ND Sub-Gaussia radom variables with fi(x k )» ff. The i) T is a Sub-Gaussia radom variable with fi(t )» ff p A for all. For every ">0 P[jT j>"]» exp[ " ff A Where A = P a k. i) By Lemmas,3,4 ad Theorems, for every h R we have E[e htm ]» my exp[ h ff P m a k Hece, by Fatou's Lemma E[e ha kx k ]» ]» exp[ h ff A E[e ht ]» exp[ h ff A This follows by part i ad Lemma. Corollary. i) If P exp[ " ff A ] <, the! a k X k =0 W:P:: (:) I particular if A = ffi(l ()), the (.) holds. If S = P X k ad fi>0 the 3

4 ! = (l (+fi)= ())S =0 W:P:: Theorem 4. Let fx ; g be a sequece of ND Sub-Gaussia r.v.'s P i) If! a k = l 6= 0<, the for every fi>0! fi a k X k =0 W:P:: (:) If a k = O( fi ) for some k» ad fi>, the! a k X k =0 W:P:: (:3) i If P a k = O( fi ) for some fi > 0, the! a k X k =0 W:P:: (:4) By Lemma 5 for some 0 <B<, ad ">0 ad P [j P [j fi X» a k X k j >"]» fi " exp[ P ff ] < ; a k a k X k j >"]» exp[ " fi ff B ] < : " exp[ P ff ] a k Now (.) ad (.3) follow from the Borel Catelli Lemma, ad (.4) follows from part (. Theorem 5. Let fx ; g be a sequece of ND Sub-Gaussia r.v.'s. The for every x R x P [max jt jj x]»exp[ j»m ff A By Lemmas,3,4 ad Theorems for every h R we have Ee hjtmj» Ee htm +Ee htm» exp[ h ff A Sice ft m ; F m ; m g is a martigale ad fjt m j; F m ; m g is submartigale ad '(t) =e th for each h 0 is icreasig ad covex fuctio, the by the submartigale iequality P [max j»m jt jj x]=p[max j»m '(jt jj) '(x)]» For h = E['(jT m j)] '(x) x ff A» exp[ hx + h ff A wehave P[max jt jj x]»exp[ x j»m ff A Theorem 6. Uder the assumptios of Theorem 5 i) If ft m ; m g coverges i probability for every, the it coverges W.P.. T = P a k X k coverges W.P. for each. i) Let T m! l i probability for every, the there exist a subsequece fm k ; k g such that T mk! l W.P.. We defie S k = By Theorem 5 max m k <m»m k+ jt m T mk j: P [S k >"]»exp[ P ff j=mk + a j " Hece by the Borel Catelli Lemma S k! 0 a.e., whe k!.thus jt m l j»s k + jt mk l j!0 For every N >mby Lemma 4 W:P:: 4

5 P [jt N T m j >"]»exp[ P ff j=m+ a j " [0] Buldygi,V.V. ad Kozacheko Yu.V. (980) Sub-Gaussia radom variables. Ukraiia Math.J.3, 980, If m!, the left had side of above iequality teds to zero. Hece, ft m ; m g coverges i probabilityby the Cauchy criterio. Now part i shows that T coverges W.P.. Let fx ; g be a sequece of idepedet Sub-Gaussia r.v.'s with fi(x )» ff, for every, the the assumptio E[X jf ]=0 ca be replaced by E(X ) = 0, ( i.e.e(x )=E[X jf ] = 0). Thus all the above Theorems, Lemmas, ad Corollaries are true i this case. Refereces [] Amii, M ad Bozorgia, A. Negatively depedet bouded radom variables probability iequalities ad the strog law of large umbers. Joural of Applied Mathematics ad Stochastic Aalysis, 3:3 (000), [] Amii, M. Azaroosh, H.A. ad Bozorgia, A. The almost sure covergece of weighted sums of egatively depedet radom variables.j. of Scieces I.R.I. Vol.0 No., 999, - 6. [3] Bozorgia, A., Patterso, R.F ad Taylor, R.L. Limit theorems for depedet r.v.'s.world Cogress Noliear Aalysts'9, 996, [4] Chow, Y.S. Some covergece theorems for idepedet r.v.'s.a.mat. Statist. 37, 966, [5] Chow, Y.S. Probability Theory.Spriger Verlag, 978, [6] Kim, Chheag.Ouy. Some covergece theorems for depedet geeralized Gaussia r.v.'s.j.natioal.chiao.tug.uiversity, 976, [7] Lehma, E. Some cocepts of depedece. A.Math.Statist.37, 966, [8] Stout, W.F. Some results o the complete ad almost sure covergece of liear combiatios of idepedet radom variables ad martigale differeces.a.math.statist. 39, 968, [9] Taylor, R.L. ad Tie-Chug Hu. Sub-Gaussia techiques i provig strog law of large umbers.the Teachig of Mathematics, 987,

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

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

Review Article Complete Convergence for Negatively Dependent Sequences of Random Variables

Review Article Complete Convergence for Negatively Dependent Sequences of Random Variables Hidawi Publishig Corporatio Joural of Iequalities ad Applicatios Volume 010, Article ID 50793, 10 pages doi:10.1155/010/50793 Review Article Complete Covergece for Negatively Depedet Sequeces of Radom

More information

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

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

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

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES

MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES Commu Korea Math Soc 26 20, No, pp 5 6 DOI 0434/CKMS20265 MAXIMAL INEQUALITIES AND STRONG LAW OF LARGE NUMBERS FOR AANA SEQUENCES Wag Xueju, Hu Shuhe, Li Xiaoqi, ad Yag Wezhi Abstract Let {X, } be a sequece

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

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

Introduction to Probability. Ariel Yadin

Introduction to Probability. Ariel Yadin Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways

More information

This section is optional.

This section is optional. 4 Momet Geeratig Fuctios* This sectio is optioal. The momet geeratig fuctio g : R R of a radom variable X is defied as g(t) = E[e tx ]. Propositio 1. We have g () (0) = E[X ] for = 1, 2,... Proof. Therefore

More information

Probability and Random Processes

Probability and Random Processes Probability ad Radom Processes Lecture 5 Probability ad radom variables The law of large umbers Mikael Skoglud, Probability ad radom processes 1/21 Why Measure Theoretic Probability? Stroger limit theorems

More information

Complete Convergence for Asymptotically Almost Negatively Associated Random Variables

Complete Convergence for Asymptotically Almost Negatively Associated Random Variables Applied Mathematical Scieces, Vol. 12, 2018, o. 30, 1441-1452 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.810142 Complete Covergece for Asymptotically Almost Negatively Associated Radom

More information

Solutions of Homework 2.

Solutions of Homework 2. 1 Solutios of Homework 2. 1. Suppose X Y with E(Y )

More information

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

More 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

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

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

LECTURE 8: ASYMPTOTICS I

LECTURE 8: ASYMPTOTICS I LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece

More information

2.1. Convergence in distribution and characteristic functions.

2.1. Convergence in distribution and characteristic functions. 3 Chapter 2. Cetral Limit Theorem. Cetral limit theorem, or DeMoivre-Laplace Theorem, which also implies the wea law of large umbers, is the most importat theorem i probability theory ad statistics. For

More information

HAJEK-RENYI-TYPE INEQUALITY FOR SOME NONMONOTONIC FUNCTIONS OF ASSOCIATED RANDOM VARIABLES

HAJEK-RENYI-TYPE INEQUALITY FOR SOME NONMONOTONIC FUNCTIONS OF ASSOCIATED RANDOM VARIABLES HAJEK-RENYI-TYPE INEQUALITY FOR SOME NONMONOTONIC FUNCTIONS OF ASSOCIATED RANDOM VARIABLES ISHA DEWAN AND B. L. S. PRAKASA RAO Received 1 April 005; Revised 6 October 005; Accepted 11 December 005 Let

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More 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

Research Article Complete Convergence for Maximal Sums of Negatively Associated Random Variables

Research Article Complete Convergence for Maximal Sums of Negatively Associated Random Variables Hidawi Publishig Corporatio Joural of Probability ad Statistics Volume 010, Article ID 764043, 17 pages doi:10.1155/010/764043 Research Article Complete Covergece for Maximal Sums of Negatively Associated

More information

Limit distributions for products of sums

Limit distributions for products of sums Statistics & Probability Letters 62 (23) 93 Limit distributios for products of sums Yogcheg Qi Departmet of Mathematics ad Statistics, Uiversity of Miesota-Duluth, Campus Ceter 4, 7 Uiversity Drive, Duluth,

More 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

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

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

Probability for mathematicians INDEPENDENCE TAU

Probability for mathematicians INDEPENDENCE TAU Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet

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

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

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

BIRKHOFF ERGODIC THEOREM

BIRKHOFF ERGODIC THEOREM BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give

More information

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences.

Topics. Homework Problems. MATH 301 Introduction to Analysis Chapter Four Sequences. 1. Definition of convergence of sequences. MATH 301 Itroductio to Aalysis Chapter Four Sequeces Topics 1. Defiitio of covergece of sequeces. 2. Fidig ad provig the limit of sequeces. 3. Bouded covergece theorem: Theorem 4.1.8. 4. Theorems 4.1.13

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

The Borel-Cantelli Lemma and its Applications

The Borel-Cantelli Lemma and its Applications The Borel-Catelli Lemma ad its Applicatios Ala M. Falleur Departmet of Mathematics ad Statistics The Uiversity of New Mexico Albuquerque, New Mexico, USA Dig Li Departmet of Electrical ad Computer Egieerig

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

1 Lecture 2: Sequence, Series and power series (8/14/2012)

1 Lecture 2: Sequence, Series and power series (8/14/2012) Summer Jump-Start Program for Aalysis, 202 Sog-Yig Li Lecture 2: Sequece, Series ad power series (8/4/202). More o sequeces Example.. Let {x } ad {y } be two bouded sequeces. Show lim sup (x + y ) lim

More 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

Entropy Rates and Asymptotic Equipartition

Entropy Rates and Asymptotic Equipartition Chapter 29 Etropy Rates ad Asymptotic Equipartitio Sectio 29. itroduces the etropy rate the asymptotic etropy per time-step of a stochastic process ad shows that it is well-defied; ad similarly for iformatio,

More information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More 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

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

FUNDAMENTALS OF REAL ANALYSIS by

FUNDAMENTALS OF REAL ANALYSIS by FUNDAMENTALS OF REAL ANALYSIS by Doğa Çömez Backgroud: All of Math 450/1 material. Namely: basic set theory, relatios ad PMI, structure of N, Z, Q ad R, basic properties of (cotiuous ad differetiable)

More information

Mixingales. Chapter 7

Mixingales. Chapter 7 Chapter 7 Mixigales I this sectio we prove some of the results stated i the previous sectios usig mixigales. We first defie a mixigale, otig that the defiitio we give is ot the most geeral defiitio. Defiitio

More information

Learning Theory: Lecture Notes

Learning Theory: Lecture Notes Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic

More information

Hyun-Chull Kim and Tae-Sung Kim

Hyun-Chull Kim and Tae-Sung Kim Commu. Korea Math. Soc. 20 2005), No. 3, pp. 531 538 A CENTRAL LIMIT THEOREM FOR GENERAL WEIGHTED SUM OF LNQD RANDOM VARIABLES AND ITS APPLICATION Hyu-Chull Kim ad Tae-Sug Kim Abstract. I this paper we

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

On Weak and Strong Convergence Theorems for a Finite Family of Nonself I-asymptotically Nonexpansive Mappings

On Weak and Strong Convergence Theorems for a Finite Family of Nonself I-asymptotically Nonexpansive Mappings Mathematica Moravica Vol. 19-2 2015, 49 64 O Weak ad Strog Covergece Theorems for a Fiite Family of Noself I-asymptotically Noexpasive Mappigs Birol Güdüz ad Sezgi Akbulut Abstract. We prove the weak ad

More information

Notes 27 : Brownian motion: path properties

Notes 27 : Brownian motion: path properties Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X

More 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

2.4.2 A Theorem About Absolutely Convergent Series

2.4.2 A Theorem About Absolutely Convergent Series 0 Versio of August 27, 200 CHAPTER 2. INFINITE SERIES Add these two series: + 3 2 + 5 + 7 4 + 9 + 6 +... = 3 l 2. (2.20) 2 Sice the reciprocal of each iteger occurs exactly oce i the last series, we would

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

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

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

Bull. Korean Math. Soc. 36 (1999), No. 3, pp. 451{457 THE STRONG CONSISTENCY OF NONLINEAR REGRESSION QUANTILES ESTIMATORS Seung Hoe Choi and Hae Kyung

Bull. Korean Math. Soc. 36 (1999), No. 3, pp. 451{457 THE STRONG CONSISTENCY OF NONLINEAR REGRESSION QUANTILES ESTIMATORS Seung Hoe Choi and Hae Kyung Bull. Korea Math. Soc. 36 (999), No. 3, pp. 45{457 THE STRONG CONSISTENCY OF NONLINEAR REGRESSION QUANTILES ESTIMATORS Abstract. This paper provides suciet coditios which esure the strog cosistecy of regressio

More information

LECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS

LECTURE 11 LINEAR PROCESSES III: ASYMPTOTIC RESULTS PRIL 7, 9 where LECTURE LINER PROCESSES III: SYMPTOTIC RESULTS (Phillips ad Solo (99) ad Phillips Lecture Notes o Statioary ad Nostatioary Time Series) I this lecture, we discuss the LLN ad CLT for a liear

More 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

Strong Convergence Theorems According. to a New Iterative Scheme with Errors for. Mapping Nonself I-Asymptotically. Quasi-Nonexpansive Types

Strong Convergence Theorems According. to a New Iterative Scheme with Errors for. Mapping Nonself I-Asymptotically. Quasi-Nonexpansive Types It. Joural of Math. Aalysis, Vol. 4, 00, o. 5, 37-45 Strog Covergece Theorems Accordig to a New Iterative Scheme with Errors for Mappig Noself I-Asymptotically Quasi-Noexpasive Types Narogrit Puturog Mathematics

More information

Research Article On the Strong Laws for Weighted Sums of ρ -Mixing Random Variables

Research Article On the Strong Laws for Weighted Sums of ρ -Mixing Random Variables Hidawi Publishig Corporatio Joural of Iequalities ad Applicatios Volume 2011, Article ID 157816, 8 pages doi:10.1155/2011/157816 Research Article O the Strog Laws for Weighted Sums of ρ -Mixig Radom Variables

More information

Research Article Moment Inequality for ϕ-mixing Sequences and Its Applications

Research Article Moment Inequality for ϕ-mixing Sequences and Its Applications Hidawi Publishig Corporatio Joural of Iequalities ad Applicatios Volume 2009, Article ID 379743, 2 pages doi:0.55/2009/379743 Research Article Momet Iequality for ϕ-mixig Sequeces ad Its Applicatios Wag

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Solutions to HW Assignment 1

Solutions to HW Assignment 1 Solutios to HW: 1 Course: Theory of Probability II Page: 1 of 6 Uiversity of Texas at Austi Solutios to HW Assigmet 1 Problem 1.1. Let Ω, F, {F } 0, P) be a filtered probability space ad T a stoppig time.

More information

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002

ECE 330:541, Stochastic Signals and Systems Lecture Notes on Limit Theorems from Probability Fall 2002 ECE 330:541, Stochastic Sigals ad Systems Lecture Notes o Limit Theorems from robability Fall 00 I practice, there are two ways we ca costruct a ew sequece of radom variables from a old sequece of radom

More information

Lecture 3 The Lebesgue Integral

Lecture 3 The Lebesgue Integral Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified

More 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

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

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

1 The Haar functions and the Brownian motion

1 The Haar functions and the Brownian motion 1 The Haar fuctios ad the Browia motio 1.1 The Haar fuctios ad their completeess The Haar fuctios The basic Haar fuctio is 1 if x < 1/2, ψx) = 1 if 1/2 x < 1, otherwise. 1.1) It has mea zero 1 ψx)dx =,

More 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

SUBSERIES CONVERGENCE AND SEQUENCE-EVALUATION CONVERGENCE. Min-Hyung Cho, Hong Taek Hwang and Won Sok Yoo. n t j x j ) = f(x 0 ) f(x j ) < +.

SUBSERIES CONVERGENCE AND SEQUENCE-EVALUATION CONVERGENCE. Min-Hyung Cho, Hong Taek Hwang and Won Sok Yoo. n t j x j ) = f(x 0 ) f(x j ) < +. Kagweo-Kyugki Math. Jour. 6 (1998), No. 2, pp. 331 339 SUBSERIES CONVERGENCE AND SEQUENCE-EVALUATION CONVERGENCE Mi-Hyug Cho, Hog Taek Hwag ad Wo Sok Yoo Abstract. We show a series of improved subseries

More information

5 Birkhoff s Ergodic Theorem

5 Birkhoff s Ergodic Theorem 5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the

More information

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim

Real Analysis Fall 2004 Take Home Test 1 SOLUTIONS. < ε. Hence lim Real Aalysis Fall 004 Take Home Test SOLUTIONS. Use the defiitio of a limit to show that (a) lim si = 0 (b) Proof. Let ε > 0 be give. Defie N >, where N is a positive iteger. The for ε > N, si 0 < si

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 central limit theorem for moving average process with negatively associated innovation

A central limit theorem for moving average process with negatively associated innovation Iteratioal Mathematical Forum, 1, 2006, o. 10, 495-502 A cetral limit theorem for movig average process with egatively associated iovatio MI-HWA KO Statistical Research Ceter for Complex Systems Seoul

More information

COMPLETE CONVERGENCE AND COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF ROWWISE END RANDOM VARIABLES

COMPLETE CONVERGENCE AND COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF ROWWISE END RANDOM VARIABLES GLASNIK MATEMATIČKI Vol. 4969)2014), 449 468 COMPLETE CONVERGENCE AND COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF ROWWISE END RANDOM VARIABLES Yogfeg Wu, Mauel Ordóñez Cabrera ad Adrei Volodi Toglig Uiversity

More information

1+x 1 + α+x. x = 2(α x2 ) 1+x

1+x 1 + α+x. x = 2(α x2 ) 1+x Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem

More information

ON THE STRONG LAW OF LARGE NUMBERS FOR SEQUENCES OF PAIRWISE NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES

ON THE STRONG LAW OF LARGE NUMBERS FOR SEQUENCES OF PAIRWISE NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES ON THE STRONG LAW OF LARGE NUMBERS FOR SEQUENCES OF PAIRWISE NEGATIVE QUADRANT DEPENDENT RANDOM VARIABLES BY DELI LI ( ), ANDREW ROSALSKY, AND ANDREI I. VOLODIN Abstract For a sequece of pairwise egative

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

Sieve Estimators: Consistency and Rates of Convergence

Sieve Estimators: Consistency and Rates of Convergence EECS 598: Statistical Learig Theory, Witer 2014 Topic 6 Sieve Estimators: Cosistecy ad Rates of Covergece Lecturer: Clayto Scott Scribe: Julia Katz-Samuels, Brado Oselio, Pi-Yu Che Disclaimer: These otes

More information

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate

Supplementary Material for Fast Stochastic AUC Maximization with O(1/n)-Convergence Rate Supplemetary Material for Fast Stochastic AUC Maximizatio with O/-Covergece Rate Migrui Liu Xiaoxua Zhag Zaiyi Che Xiaoyu Wag 3 iabao Yag echical Lemmas ized versio of Hoeffdig s iequality, ote that We

More information

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors

ECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic

More information

APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS

APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS Hacettepe Joural of Mathematics ad Statistics Volume 32 (2003), 1 5 APPROXIMATION BY BERNSTEIN-CHLODOWSKY POLYNOMIALS E. İbili Received 27/06/2002 : Accepted 17/03/2003 Abstract The weighted approximatio

More information

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS

LECTURE SERIES WITH NONNEGATIVE TERMS (II). SERIES WITH ARBITRARY TERMS LECTURE 4 SERIES WITH NONNEGATIVE TERMS II). SERIES WITH ARBITRARY TERMS Series with oegative terms II) Theorem 4.1 Kummer s Test) Let x be a series with positive terms. 1 If c ) N i 0, + ), r > 0 ad 0

More information

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n.

Lecture 4. We also define the set of possible values for the random walk as the set of all x R d such that P(S n = x) > 0 for some n. Radom Walks ad Browia Motio Tel Aviv Uiversity Sprig 20 Lecture date: Mar 2, 20 Lecture 4 Istructor: Ro Peled Scribe: Lira Rotem This lecture deals primarily with recurrece for geeral radom walks. We preset

More information

Glivenko-Cantelli Classes

Glivenko-Cantelli Classes CS28B/Stat24B (Sprig 2008 Statistical Learig Theory Lecture: 4 Gliveko-Catelli Classes Lecturer: Peter Bartlett Scribe: Michelle Besi Itroductio This lecture will cover Gliveko-Catelli (GC classes ad itroduce

More information

The Central Limit Theorem

The Central Limit Theorem Chapter The Cetral Limit Theorem Deote by Z the stadard ormal radom variable with desity 2π e x2 /2. Lemma.. Ee itz = e t2 /2 Proof. We use the same calculatio as for the momet geeratig fuctio: exp(itx

More information

Statistically Convergent Double Sequence Spaces in 2-Normed Spaces Defined by Orlicz Function

Statistically Convergent Double Sequence Spaces in 2-Normed Spaces Defined by Orlicz Function Applied Mathematics, 0,, 398-40 doi:0.436/am.0.4048 Published Olie April 0 (http://www.scirp.org/oural/am) Statistically Coverget Double Sequece Spaces i -Normed Spaces Defied by Orlic Fuctio Abstract

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

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

An introduction to stochastic integration with respect to continuous semimartingales

An introduction to stochastic integration with respect to continuous semimartingales A itroductio to stochastic itegratio with respect to cotiuous semimartigales Alexader Sool Departmet of Mathematical Scieces Uiversity of Copehage Departmet of Mathematical Scieces Uiversity of Copehage

More information

Lecture 2: Concentration Bounds

Lecture 2: Concentration Bounds CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy

More information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

More information

Council for Innovative Research

Council for Innovative Research ABSTRACT ON ABEL CONVERGENT SERIES OF FUNCTIONS ERDAL GÜL AND MEHMET ALBAYRAK Yildiz Techical Uiversity, Departmet of Mathematics, 34210 Eseler, Istabul egul34@gmail.com mehmetalbayrak12@gmail.com I this

More information

Estimation of the essential supremum of a regression function

Estimation of the essential supremum of a regression function Estimatio of the essetial supremum of a regressio fuctio Michael ohler, Adam rzyżak 2, ad Harro Walk 3 Fachbereich Mathematik, Techische Uiversität Darmstadt, Schlossgartestr. 7, 64289 Darmstadt, Germay,

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

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

ON THE FUZZY METRIC SPACES

ON THE FUZZY METRIC SPACES The Joural of Mathematics ad Computer Sciece Available olie at http://www.tjmcs.com The Joural of Mathematics ad Computer Sciece Vol.2 No.3 2) 475-482 ON THE FUZZY METRIC SPACES Received: July 2, Revised:

More information