Journal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula
|
|
- Asher Robertson
- 5 years ago
- Views:
Transcription
1 Joural of Multivariate Aalysis 102 (2011) Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: Superefficiet estimatio of the margials by exploitig kowledge o the copula Joh H.J. Eimahl, Ramo va de Akker Departmet of Ecoometrics & OR ad CetER, Tilburg Uiversity, PO Box 90153, NL-5000 LE Tilburg, The Netherlads a r t i c l e i f o a b s t r a c t Article history: Received 9 November 2010 Available olie 6 May 2011 AMS subject classificatios: 62G05 62G20 Keywords: Copula Estimatio of margials Superefficiet estimatio We cosider the problem of estimatig the margials i the case where there is kowledge o the copula. If the copula is smooth, it is kow that it is possible to improve o the empirical distributio fuctios: optimal estimators still have a rate of covergece 1/2, but a smaller asymptotic variace. I this paper we show that for o-smooth copulas it is sometimes possible to costruct superefficiet estimators of the margials: we costruct both a copula ad, exploitig the iformatio our copula provides, estimators of the margials with the rate of covergece log / Elsevier Ic. All rights reserved. 1. Itroductio Suppose oe observes a radom sample from a bivariate distributio. By Sklar s theorem (see, e.g., [5]) the distributio fuctio is determied by its copula ad the margial distributios. I semiparametric copula models, it is assumed that the copula depeds o a Euclidea parameter ad, apart from (absolute) cotiuity, o assumptios are imposed o the margials. The study of efficiet estimatio for semiparametric copula models origiated i [3,2], which focused o efficiet estimatio of the copula parameter. [3] also oted that exploitig the kowledge o the copula may help to improve o the margial empirical distributio fuctios. Followig the setup i [3], [1] ad [7, Chapter 5] provide efficiet estimators of the margials, icorporatig the iformatio the copula provides, with the stadard rate of covergece 1/2 ad a limitig distributio that has less spread tha the limitig distributio of the empirical distributio fuctios. I those models smoothess assumptios o the copula are imposed. This paper shows that i the absece of smoothess, superefficiet estimatio of the margials is possible. To this ed, we costruct, i Sectio 2, a specific copula. I Sectio 3, we costruct a estimator of the margials that exploits the iformatio our copula provides, ad show that its rate of covergece is log /. Our copula is a best copula i the sese that log / is the best possible rate of covergece. 2. The copula I this sectio we defie our copula. To this ed we itroduce idepedet Beroulli variables (B k ) k N with success probability 1/2, ad defie Beroulli variables ( Bk ) k N by Bk = B k for k odd ad Bk = 1 B k for k eve. Usig these Beroulli sequeces, we itroduce the radom pair (U, V) by B k U = 2, ad V = B k k 2. k k=1 k=1 Correspodig author. addresses: j.h.j.eimahl@uvt.l (J.H.J. Eimahl), r.vdakker@uvt.l (R. va de Akker) X/$ see frot matter 2011 Elsevier Ic. All rights reserved. doi: /j.jmva
2 1316 J.H.J. Eimahl, R. va de Akker / Joural of Multivariate Aalysis 102 (2011) Fig. 1. The support S k of the copula C k for k = 1, 2, 3. Hece V is a oe-to-oe fuctio of U ad the iverse is the same fuctio. Note that U ad V are uiformly distributed o [0, 1]. The joit distributio of (U, V) thus defies a copula, which we will deote by C. This copula ca be iterpreted as a ifiite shuffle of mi (see [4] for shuffles of mi). We provide a secod costructio of C that might be more ituitive ad allows us to itroduce otatio that is eeded i the remaider of the paper. Defie, for k N ad p, q = 1,...,, the sets A (k) p,q = [(p 1)2 k, p2 k ) [(q 1)2 k, q2 k ). Next, we defie, for k N ad p = 1,...,, idices q (k) (p) as follows. For k = 1 we set q (1) (1) = 1 ad q (1) (2) = 2. For k 2 we set, for p = 1,..., 1, q (k) 2q (2p) = (k 1) (p), k odd; 2q (k 1) ad q (k) 2q (2p 1) = (k 1) (p) 1, k odd; (p) 1, k eve, 2q (k 1) (p), k eve. Next we itroduce, for k N, S k = 2k p=1 A(k) p,q (k) ; see Fig. 1 for a illustratio. (p) Now we are able to itroduce, for k N, radom variables (U (k), V (k) ) that are uiformly distributed o S k (the desity equals ). Note that U (k) ad V (k) are uiformly distributed o [0, 1], so the law of (U (k), V (k) ) defies a copula C k. It is easy to see that C k C poitwise, as k. I particular, we have, for all k, m N ad all p, q = 1,...,, P{(U (k), V (k) ) A (k) } = p,q P{(U(k+m), V (k+m) ) A (k) } = P{(U, V) A(k) ad this probability equals 2 k i the case q = q (k) (p) ad 0 i the case q q (k) (p). 3. The estimator ad its limitig behavior p,q Available is a radom sample (X 1, Y 1 ),..., (X, Y ) from a bivariate distributio fuctio H which has C, as defied i Sectio 2, as copula. By Sklar s theorem we have, for all (x, y) R 2, H(x, y) = C(F(x), G(y)), where F ad G are the margial distributio fuctios of X 1 ad Y 1, respectively. The oly assumptio we impose o F ad G is that they belog to F, the set of cotiuous distributio fuctios o the real lie. We itroduce our estimator of F via its quatile fuctio. First, we defie (u) o the set {p2 k p = 0,...,, k 1}. Set (0) = X 1:, (1) = X :, ad defie (p2 k ) for k N ad p {1,..., 1} odd, recursively by (we adopt the usual covetio max = ): p = max p 1 where max p i I p X i k = max X i with i I p k j:x j j: X j I p = k i {1,..., } X i, Q p, max Y j < mi p 1,X i j:x j mi Y j > max p 1,X i j:x j p 1 Y j p+1 X i, Y j p+1 X i,,, p,q }, for k odd, for k eve, ] p + 1 p + 1,, X j X i,. Next, we exted the domai to [0, 1] by (u) = sup{ (p2 k ) p2 k u}. As estimator of F we take the distributio fuctio associated with. We deote this estimator by ˆF. Note that ˆF ca be writte as ˆF (x) = i=1 p i1 (,x] (X i ), where the probability masses p i oly deped o the observatios via the raks (R X, j RY ) j of (X j, Y j ), j = 1,...,. The followig theorem is the mai result of this paper.
3 J.H.J. Eimahl, R. va de Akker / Joural of Multivariate Aalysis 102 (2011) Fig. 2. Realizatio of ˆF (solid) ad F edf (dashed) for = 100, F = Φ (dotted), ad G F. Theorem 3.1. For F, G F we have ( deotes the sup-orm): 1 2 lim if log ˆF F lim sup log ˆF F 4 a.s. (1) The theorem demostrates that ˆF is superefficiet, i.e. the rate of covergece is log / istead of the usual rate 1/2. Remark 1. I the proof of Theorem 3.1 we exploit that ay estimator F of F that cocetrates o X 1,..., X satisfies lim if log F F 1 2 a.s. (2) This property implies that our estimator ˆF achieves the best attaiable rate of covergece log /. As the boud (2) does ot deped o the copula, our copula C ca be iterpreted as a best oe (i terms of rate of covergece). Remark 2. A atural questio is whether Z = (/ log )(ˆF (x) F(x)) x R, see as a elemet of l (R), weakly coverges (if so, the limit determies the limitig distributio of (/ log ) ˆF F by a applicatio of the cotiuous mappig theorem). The aswer is egative. For F = I, where I deotes the distributio fuctio of the Uiform[0, 1] distributio, the argumet is as follows (the geeral case easily follows from the uiform case). Sice ˆF cocetrates o the observatios ad, as we exploit i the proof of Theorem 3.1, the maximal spacig of i.i.d. draws from the Uiform[0, 1] distributio satisfies (/ log ) 1 a.s. we have, for ay η (0, 1), ϵ (0, 1/2) ad ay fiite partitio k i=1 T i of [0, 1], lim P sup i sup u,u T i which shows that Z is ot tight. log ˆF (u) ˆF (u ) (u u ) > ϵ = 1 > η, As a illustratio, Fig. 2 presets a realizatio of our estimator ad the empirical distributio fuctio F edf for = 100, F = Φ, the stadard ormal distributio fuctio, ad G F, ad Fig. 3 presets the cetered versios of the estimates. Proof of Theorem 3.1. Itroduce U i = F(X i ) ad V i = G(Y i ), ad recall that mootoe trasformatios of the margials U do ot chage the copula. Let ˆF deote the distributio fuctio resultig from computig ˆF from (U i, V i ) i=1 istead of (X i, Y i ) i=1. As U ˆF (x) = ˆF (F(x)) a.s. we have ˆF U F = ˆF I a.s., which shows that it suffices to prove (1) for F = G = I. To stress that we cosider uiform margials we deote the observatios by (U i, V i ) i the remaider of the proof. As the probability of a tie i (U i ) i=1 or (V i) i=1 equals zero, we throughout work o the evet that there are o ties. Let = max i=1,...,+1 U i: U i 1:, with U 0: = 0 ad U +1: = 1, deote the maximal spacig of U 1,..., U. Observe that ay estimator F of I of the form F (u) = i=1 p i1 [0,u] (U i ) satisfies F I /2. Observe that F I = I. As it is well-kow (see, e.g., [6]) that (/ log ) 1 a.s., we see that the theorem holds oce we establish the boud I 4. As (0) 0 ad (1) 1 we have to prove (u) u 4, for all u (0, 1). (3)
4 1318 J.H.J. Eimahl, R. va de Akker / Joural of Multivariate Aalysis 102 (2011) Fig. 3. Realizatio of ˆF F (solid) ad F edf F (dashed) for = 100, F = Φ, ad G F. Deote U = {U 1,..., U } ad itroduce the radom variable ] p 1 K = max k N p = 1,..., +1 : 2, p U k I the case K = we have 1/4 ad (3) trivially holds, so we oly eed to cosider K 1. We will prove, for k = 1,..., K ad p = 1,..., 2k 1 odd, p = max U i U i < p2. (4) i=1,..., k Before we prove (4) we show that (4) implies (3). From (4) it is immediate that (3) holds for u {p2 K p = 1,..., 2 K 1}; to be precise, we have, for p = 1,..., 2 K 1, p p. 2 K 2 K Let K = K+1 ad ote that the itervals ((p 1)2 K, p2 K ] ad (p2 K, (p+1)2 K ] both cotai at least oe observatio. The defiitio of ad (4) ow yield (p2 K ) [(p 1)2 K, (p+1)2 K ) ad the defiitio of K implies 2 (K +1). A combiatio of these observatios immediately yields p 2 K p 2 K 2, which shows that (3) holds for all u {p2 K p = 1,..., 2 K 1}. Fially, we cosider u (0, 1) with u2 K N. Let p such that u (p 2 K, (p + 1)2 K ). We easily obtai the boud p 4 p 1 p K 2 K 2 K (u) u p K 2 K 2 K 4. We coclude that (3) ideed holds. We coclude the proof by establishig (4). We start with k = p = 1. Sice the squares A (1) 1,1 ad A(1) 2,2 both cotai at least two observatios ad A (1) 2,2 is orth to A(1) 1,1, it follows from the defiitio of (1/2) that (1/2) max i {U i U i < 1/2}. As the square A (2) 3,4 is orth to A(2) 4,3 ad both squares cotai at least oe observatio it is also immediate that (1/2) < mi i {U i U i 1/2}. Hece (4) ideed holds for k = p = 1. Suppose that we have show (4) to hold for k = 1,..., K 1, with K K. We show that the (4) also holds for k = K. We have to discuss the cases K eve ad K odd separately. As the argumets are similar, we oly discuss the case K odd. For p odd we obtai from the iductio hypothesis that all observatios that are relevat for (p2 K ), i.e. the observatios U i that belog to the iterval ( ((p 1)2 K ), ((p+1)2 K )], correspod to observatios (U i, V i ) that fall i the sets A (K) p,q (K) ad A(K) (p) p+1,q (K) (p+1). As K K p,q (K) (p). It follows that (p2 K ) both squares cotai at least oe observatio. As K is odd A (K) p+1,q (K) is orth to A(K) (p+1) max i {U i U i < p2 k }. The mass that C assigs to the set A (K) p+1,q (K) cocetrates i the two subsets A(K+1) (p+1) 2p+1,q (K+1) (2p+1) ad A (K+1) 2(p+1),q (K+1), ad both sets cotai at least oe observatio. As K + 1 is eve the set A(K+1) (2(p+1)) 2(p+1),q (K+1) is south to (2(p+1)) A (K+1) 2p+1,q (K+1) (2p+1). This easily yields (p2 K ) < mi i {U i U i p2 k }. We coclude that (4) holds for k = K as well, which cocludes the iductio argumet.
5 J.H.J. Eimahl, R. va de Akker / Joural of Multivariate Aalysis 102 (2011) Refereces [1] X. Che, Y. Fa, V. Tsyreikov, Efficiet estimatio of semiparametric multivariate copula models, Joural of the America Statistical Associatio 101 (2006) [2] C. Geest, B.J.M. Werker, Coditios for the asymptotic semiparametric efficiecy of a omibus estimator of depedece parameters i copula models, i: C.M. Cuadras, J. Fortiaa, J.A. Rodríguez-Lallea (Eds.), Distributios with Give Margials ad Statistical Modelig, Kluwer, Dordrecht, 2002, pp [3] C.A.J. Klaasse, J.A. Weller, Efficiet estimatio i the bivariate ormal copula model: ormal margis are least favourable, Beroulli 3 (1997) [4] P. Mikusiski, H. Sherwood, M. Taylor, Shuffles of mi, Stochastica XIII (1992) [5] R. Nelse, A Itroductio to Copulas, 1st ed., Spriger-Verlag, New York, [6] E. Slud, Etropy ad maximal spacigs for radom partitios, Zeitschrift für Wahrscheilichkeitstheorie ud verwadte Gebiete 41 (1978) [7] R. Va de Akker, Iteger-valued time series, Ph.D. Thesis, CetER Dissertatio Series 197, Tilburg Uiversity, Available at:
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 information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the
More information17. Joint distributions of extreme order statistics Lehmann 5.1; Ferguson 15
17. Joit distributios of extreme order statistics Lehma 5.1; Ferguso 15 I Example 10., we derived the asymptotic distributio of the maximum from a radom sample from a uiform distributio. We did this usig
More informationA RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS
J. Japa Statist. Soc. Vol. 41 No. 1 2011 67 73 A RANK STATISTIC FOR NON-PARAMETRIC K-SAMPLE AND CHANGE POINT PROBLEMS Yoichi Nishiyama* We cosider k-sample ad chage poit problems for idepedet data i a
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationResampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.
Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 21 11/27/2013 Fuctioal Law of Large Numbers. Costructio of the Wieer Measure Cotet. 1. Additioal techical results o weak covergece
More information32 estimating the cumulative distribution function
32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationHOMEWORK I: PREREQUISITES FROM MATH 727
HOMEWORK I: PREREQUISITES FROM MATH 727 Questio. Let X, X 2,... be idepedet expoetial radom variables with mea µ. (a) Show that for Z +, we have EX µ!. (b) Show that almost surely, X + + X (c) Fid the
More informationMath 341 Lecture #31 6.5: Power Series
Math 341 Lecture #31 6.5: Power Series We ow tur our attetio to a particular kid of series of fuctios, amely, power series, f(x = a x = a 0 + a 1 x + a 2 x 2 + where a R for all N. I terms of a series
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationAn 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 information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationNotes 19 : Martingale CLT
Notes 9 : Martigale CLT Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: [Bil95, Chapter 35], [Roc, Chapter 3]. Sice we have ot ecoutered weak covergece i some time, we first recall
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationNotes 27 : Brownian motion: path properties
Notes 27 : Browia motio: path properties Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces:[Dur10, Sectio 8.1], [MP10, Sectio 1.1, 1.2, 1.3]. Recall: DEF 27.1 (Covariace) Let X = (X
More informationANSWERS TO MIDTERM EXAM # 2
MATH 03, FALL 003 ANSWERS TO MIDTERM EXAM # PENN STATE UNIVERSITY Problem 1 (18 pts). State ad prove the Itermediate Value Theorem. Solutio See class otes or Theorem 5.6.1 from our textbook. Problem (18
More informationlim za n n = z lim a n n.
Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationDetailed proofs of Propositions 3.1 and 3.2
Detailed proofs of Propositios 3. ad 3. Proof of Propositio 3. NB: itegratio sets are geerally omitted for itegrals defied over a uit hypercube [0, s with ay s d. We first give four lemmas. The proof of
More informationUniversity of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!
Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad
More informationECE 901 Lecture 14: Maximum Likelihood Estimation and Complexity Regularization
ECE 90 Lecture 4: Maximum Likelihood Estimatio ad Complexity Regularizatio R Nowak 5/7/009 Review : Maximum Likelihood Estimatio We have iid observatios draw from a ukow distributio Y i iid p θ, i,, where
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics ad Egieerig Lecture otes Sergei V. Shabaov Departmet of Mathematics, Uiversity of Florida, Gaiesville, FL 326 USA CHAPTER The theory of covergece. Numerical sequeces..
More informationElement sampling: Part 2
Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationFirst Year Quantitative Comp Exam Spring, Part I - 203A. f X (x) = 0 otherwise
First Year Quatitative Comp Exam Sprig, 2012 Istructio: There are three parts. Aswer every questio i every part. Questio I-1 Part I - 203A A radom variable X is distributed with the margial desity: >
More informationSince X n /n P p, we know that X n (n. Xn (n X n ) Using the asymptotic result above to obtain an approximation for fixed n, we obtain
Assigmet 9 Exercise 5.5 Let X biomial, p, where p 0, 1 is ukow. Obtai cofidece itervals for p i two differet ways: a Sice X / p d N0, p1 p], the variace of the limitig distributio depeds oly o p. Use the
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationCouncil 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 informationKolmogorov-Smirnov type Tests for Local Gaussianity in High-Frequency Data
Proceedigs 59th ISI World Statistics Cogress, 5-30 August 013, Hog Kog (Sessio STS046) p.09 Kolmogorov-Smirov type Tests for Local Gaussiaity i High-Frequecy Data George Tauche, Duke Uiversity Viktor Todorov,
More informationAlternating Series. 1 n 0 2 n n THEOREM 9.14 Alternating Series Test Let a n > 0. The alternating series. 1 n a n.
0_0905.qxd //0 :7 PM Page SECTION 9.5 Alteratig Series Sectio 9.5 Alteratig Series Use the Alteratig Series Test to determie whether a ifiite series coverges. Use the Alteratig Series Remaider to approximate
More informationLecture 27: Optimal Estimators and Functional Delta Method
Stat210B: Theoretical Statistics Lecture Date: April 19, 2007 Lecture 27: Optimal Estimators ad Fuctioal Delta Method Lecturer: Michael I. Jorda Scribe: Guilherme V. Rocha 1 Achievig Optimal Estimators
More informationMATH301 Real Analysis (2008 Fall) Tutorial Note #7. k=1 f k (x) converges pointwise to S(x) on E if and
MATH01 Real Aalysis (2008 Fall) Tutorial Note #7 Sequece ad Series of fuctio 1: Poitwise Covergece ad Uiform Covergece Part I: Poitwise Covergece Defiitio of poitwise covergece: A sequece of fuctios f
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More information6. Sufficient, Complete, and Ancillary Statistics
Sufficiet, Complete ad Acillary Statistics http://www.math.uah.edu/stat/poit/sufficiet.xhtml 1 of 7 7/16/2009 6:13 AM Virtual Laboratories > 7. Poit Estimatio > 1 2 3 4 5 6 6. Sufficiet, Complete, ad Acillary
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 6 9/23/2013. Brownian motion. Introduction
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/5.070J Fall 203 Lecture 6 9/23/203 Browia motio. Itroductio Cotet.. A heuristic costructio of a Browia motio from a radom walk. 2. Defiitio ad basic properties
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More informationIntroduction to Probability. Ariel Yadin
Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways
More informationSOME GENERALIZATIONS OF OLIVIER S THEOREM
SOME GENERALIZATIONS OF OLIVIER S THEOREM Alai Faisat, Sait-Étiee, Georges Grekos, Sait-Étiee, Ladislav Mišík Ostrava (Received Jauary 27, 2006) Abstract. Let a be a coverget series of positive real umbers.
More informationB Supplemental Notes 2 Hypergeometric, Binomial, Poisson and Multinomial Random Variables and Borel Sets
B671-672 Supplemetal otes 2 Hypergeometric, Biomial, Poisso ad Multiomial Radom Variables ad Borel Sets 1 Biomial Approximatio to the Hypergeometric Recall that the Hypergeometric istributio is fx = x
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationMachine Learning Theory Tübingen University, WS 2016/2017 Lecture 12
Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig
More informationLecture 15: Learning Theory: Concentration Inequalities
STAT 425: Itroductio to Noparametric Statistics Witer 208 Lecture 5: Learig Theory: Cocetratio Iequalities Istructor: Ye-Chi Che 5. Itroductio Recall that i the lecture o classificatio, we have see that
More informationLet us give one more example of MLE. Example 3. The uniform distribution U[0, θ] on the interval [0, θ] has p.d.f.
Lecture 5 Let us give oe more example of MLE. Example 3. The uiform distributio U[0, ] o the iterval [0, ] has p.d.f. { 1 f(x =, 0 x, 0, otherwise The likelihood fuctio ϕ( = f(x i = 1 I(X 1,..., X [0,
More informationBull. 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 informationDirection: This test is worth 250 points. You are required to complete this test within 50 minutes.
Term Test October 3, 003 Name Math 56 Studet Number Directio: This test is worth 50 poits. You are required to complete this test withi 50 miutes. I order to receive full credit, aswer each problem completely
More informationLecture 3 The Lebesgue Integral
Lecture 3: The Lebesgue Itegral 1 of 14 Course: Theory of Probability I Term: Fall 2013 Istructor: Gorda Zitkovic Lecture 3 The Lebesgue Itegral The costructio of the itegral Uless expressly specified
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationLecture 20: Multivariate convergence and the Central Limit Theorem
Lecture 20: Multivariate covergece ad the Cetral Limit Theorem Covergece i distributio for radom vectors Let Z,Z 1,Z 2,... be radom vectors o R k. If the cdf of Z is cotiuous, the we ca defie covergece
More informationLECTURE 8: ASYMPTOTICS I
LECTURE 8: ASYMPTOTICS I We are iterested i the properties of estimators as. Cosider a sequece of radom variables {, X 1}. N. M. Kiefer, Corell Uiversity, Ecoomics 60 1 Defiitio: (Weak covergece) A sequece
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationEFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS
EFFECTIVE WLLN, SLLN, AND CLT IN STATISTICAL MODELS Ryszard Zieliński Ist Math Polish Acad Sc POBox 21, 00-956 Warszawa 10, Polad e-mail: rziel@impagovpl ABSTRACT Weak laws of large umbers (W LLN), strog
More informationBIRKHOFF ERGODIC THEOREM
BIRKHOFF ERGODIC THEOREM Abstract. We will give a proof of the poitwise ergodic theorem, which was first proved by Birkhoff. May improvemets have bee made sice Birkhoff s orgial proof. The versio we give
More informationLaw of the sum of Bernoulli random variables
Law of the sum of Beroulli radom variables Nicolas Chevallier Uiversité de Haute Alsace, 4, rue des frères Lumière 68093 Mulhouse icolas.chevallier@uha.fr December 006 Abstract Let be the set of all possible
More informationEmpirical Processes: Glivenko Cantelli Theorems
Empirical Processes: Gliveko Catelli Theorems Mouliath Baerjee Jue 6, 200 Gliveko Catelli classes of fuctios The reader is referred to Chapter.6 of Weller s Torgo otes, Chapter??? of VDVW ad Chapter 8.3
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationNotes 5 : More on the a.s. convergence of sums
Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series
More information1. Universal v.s. non-universal: know the source distribution or not.
28. Radom umber geerators Let s play the followig game: Give a stream of Ber( p) bits, with ukow p, we wat to tur them ito pure radom bits, i.e., idepedet fair coi flips Ber( / 2 ). Our goal is to fid
More informationConfidence interval for the two-parameter exponentiated Gumbel distribution based on record values
Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values
More informationEfficient GMM LECTURE 12 GMM II
DECEMBER 1 010 LECTURE 1 II Efficiet The estimator depeds o the choice of the weight matrix A. The efficiet estimator is the oe that has the smallest asymptotic variace amog all estimators defied by differet
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationEstimation 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 informationMathematical Statistics - MS
Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios
More informationGlivenko-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 informationIMPROVING EFFICIENT MARGINAL ESTIMATORS IN BIVARIATE MODELS WITH PARAMETRIC MARGINALS
IMPROVING EFFICIENT MARGINAL ESTIMATORS IN BIVARIATE MODELS WITH PARAMETRIC MARGINALS HANXIANG PENG AND ANTON SCHICK Abstract. Suppose we have data from a bivariate model with parametric margials. Efficiet
More information1+x 1 + α+x. x = 2(α x2 ) 1+x
Math 2030 Homework 6 Solutios # [Problem 5] For coveiece we let α lim sup a ad β lim sup b. Without loss of geerality let us assume that α β. If α the by assumptio β < so i this case α + β. By Theorem
More informationIntroduction to Extreme Value Theory Laurens de Haan, ISM Japan, Erasmus University Rotterdam, NL University of Lisbon, PT
Itroductio to Extreme Value Theory Laures de Haa, ISM Japa, 202 Itroductio to Extreme Value Theory Laures de Haa Erasmus Uiversity Rotterdam, NL Uiversity of Lisbo, PT Itroductio to Extreme Value Theory
More informationEntropy and Ergodic Theory Lecture 5: Joint typicality and conditional AEP
Etropy ad Ergodic Theory Lecture 5: Joit typicality ad coditioal AEP 1 Notatio: from RVs back to distributios Let (Ω, F, P) be a probability space, ad let X ad Y be A- ad B-valued discrete RVs, respectively.
More informationKernel density estimator
Jauary, 07 NONPARAMETRIC ERNEL DENSITY ESTIMATION I this lecture, we discuss kerel estimatio of probability desity fuctios PDF Noparametric desity estimatio is oe of the cetral problems i statistics I
More informationA NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS
Acta Math. Hugar., 2007 DOI: 10.1007/s10474-007-7013-6 A NOTE ON INVARIANT SETS OF ITERATED FUNCTION SYSTEMS L. L. STACHÓ ad L. I. SZABÓ Bolyai Istitute, Uiversity of Szeged, Aradi vértaúk tere 1, H-6720
More informationPrecise Rates in Complete Moment Convergence for Negatively Associated Sequences
Commuicatios of the Korea Statistical Society 29, Vol. 16, No. 5, 841 849 Precise Rates i Complete Momet Covergece for Negatively Associated Sequeces Dae-Hee Ryu 1,a a Departmet of Computer Sciece, ChugWoo
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationK. Grill Institut für Statistik und Wahrscheinlichkeitstheorie, TU Wien, Austria
MARKOV PROCESSES K. Grill Istitut für Statistik ud Wahrscheilichkeitstheorie, TU Wie, Austria Keywords: Markov process, Markov chai, Markov property, stoppig times, strog Markov property, trasitio matrix,
More information