Large Sample Properties of Matching Estimators for Average Treatment Effects by Alberto Abadie & Guido Imbens

Size: px
Start display at page:

Download "Large Sample Properties of Matching Estimators for Average Treatment Effects by Alberto Abadie & Guido Imbens"

Transcription

1 Addtonal Proofs for: Large Sample Propertes of atchng stmators for Average Treatment ffects by Alberto Abade & Gudo Imbens Remnder of Proof of Lemma : To get the result for U m U m, notce that U m U m B m m, where B m uu fz + u Pr X z u m Pr X z u m du R Boundedness of X mples that B m converges unformly Transformng to polar coordnates agan leads to B m where, as before br log r S r ωω fz + rωλ S dω r r m s fz + sωλ S dω ds dr S e br ãr dr, r s S fz + sωλ S dω ds, m s S fz + sωλ S dω ds and ãr r + ωω fz + rωλ S dω S r m s S fz + sωλ S dω ds r s S fz + sωλ S dω m ds That s, ãr qrpr, qr r + cr, and, as before, pr gr m, where ωω fz + rωλ S dω S cr r, s S fz + sωλ S dω ds Clearly, r gr r s S fz + sωλ S dω ds s S fz + sωλ S dω ds lm r qrr + lm cr r fz λ S dωi S

2 Hence, lm r ãrr m+ lm prr m lm qrr + r r m fz λ S dω S fz λ S dωi S m fz λ S dω I S Therefore, the condtons of Lemma A hold for α m +, β m a fz λ S dω I S b fz S λ S dω Applyng Lemma A, we get m + B m Γ a b m+/ + o m+/ m+/ / m + fz Γ λ S dω S I m+/ + o m + Γ fz Hence, usng the fact that lm we have that m /m!, m U m U m m B m π / Γ + / / I m+/ + o m+/ m+/ / m + π / Γ fz m! Γ + I + o / / Usng the same technques as for the frst two moments, U m 3 C m m, where C m br log e br ār dr, r s S fz + sωλ S dω ds,

3 and ār r + fz + rωλ S dω S r m s S fz + sωλ S dω ds r s S fz + sωλ S dω m, ds and C m converges unformly Let ār qrpr, qr r + cr, and pr gr m, where fz + rωλ S dω S cr r, s S fz + sωλ S dω ds ow, Hence, r gr r s S fz + sωλ S dω ds s S fz + sωλ S dω lm r qrr + lm cr fz λ S dω r S lm r ārr m+ ds lm prr m lm qrr + r r m fz λ S dω fz λ S dω S S m fz λ S dω S Therefore, the condtons of Lemma A hold for α m + 3, β m a fz λ S dω S b fz S λ S dω Applyng Lemma A, we get m + 3 C m Γ a b m+3/ fz + o m+3/ m+3/ 3/ m + 3 Γ λ S dω S + o m+3/ m + 3 π / 3/ Γ fz Γ + / + o m+3/ Hence, usng the fact that lm m /m!, m 3 m+3/ m+3/

4 we have that U m 3 m C m m + 3 π / 3/ Γ fz m! Γ + / + o 3/ m + 3 U m 3 π / 3/ Γ fz m! Γ + / + o 3/ Therefore U m 3 O 3/ 3/ 3/ Proof of Theorem 5: Frst, assume wthout loss of generalty that the support of X s, If the support of X s x, x, we can always wor wth the transform X x/x x and obtan the same estmator The results wll not change because they are functons of ratos of denstes, so the Jacobans of the transformaton cancel Pr j J X j, W, W j, ι W Pr j j m X j, W, W j, ι W m Pr j j m X j, W, W j, ι W Pr j j m X x, X j, W, W j, ι W f x dx m m + m m + m { x x x } m f xdx { x x x } m f xdx f x dx f x dx x m x m f x dx m f x dx u m +v f x dx where u x, v x otce that m f x dx u u f x dx x f x dx x u +v m f x dx f x dx m m m f x dx f u du f x dx f x dx f u du m f + v dv, au exp bu du, 4

5 where f x dx u au f u u m f x dx m, and bu log u f x dx It s easy to see that lm u au/u m f f m, and lm u bu/u f Applyng Lemma A we obtan: ow, because, lm m f x dx u m /m!, m u f x dx m f u du m! f f m + o m we obtan: m m f x dx u u f x dx m f u du f + o f Smlarly, m m +v f x dx +v f x dx m f + v dv f + o f Therefore: Pr j j m X j, W, W j, ι f W + o f, and Pr j J X j, W, W j, ι f W + o f 5

6 ow, let us calculate the jont probablty of two matches: Pr j J, j J X j, W W, W j, ι W Pr j J, j J X j, W W, W j, ι W, X X x Pr j J, j J X j, W W, W j, ι W, X x, X x f x f x / dx dx Let P, j Pr j J, j J X j, W W, W j, ι W, X x, X x ow, let us calculate P, j for x x Three cases: x x : otce that Let P, j P m m x m x f x dx m f m x dx x m f x dx m x f x dx m ow let u x Then, where f x dx x f x dx m x f x dx m x f x dx m m x f x dx f x dx m m f x dx f x dx f x dx f x dx x x x m m f x dx f x dx u u f x dx f u du a u exp b u du, u a u f u b u log f x dx u u f x dx f x dx u m, f x dx u 6 m

7 It s easy to see that and a u lm u u m f f m, b u lm f u u As a result, Lemma A holds wth α m+, β, a f f m, and b f : m! m f x dx x f f m f m+ f m! f m+ + o ow, because, m+ m+ f x dx x + o m+ m x f x dx f x dx lm m m+ /m! m, we obtan: P f m f m + f f + o + o x x : otce that Let P, j P m m! f x dx m!m! m m +! x m x x f x dx f x dx x m m m + m! f x dx m m m!m! m m +! x m x m x x m + j f x dx f x dx f x f x dx dx x 7

8 Let u x, u x otce that for x x, sup u, u Also, let S ++ {ω ω, ω R : ω, ω, ω } m m x f x dx f x dx x where x x S ++ a r +u u f x dx m m + f x f x dx dx m +u f x dx f x dx u f x dx m m + f + u f u du du m mn{ /ω,/ω } m +rω r f x dx f x dx rω +rω rω b r log f x dx m m + S ++ rf + rω f rω +rω rω f + rω f rω dr λ S dω m mn{ /ω,/ω } a r exp b r dr λ S dω, f x dx rω +rω rω It can be easly seen that for ω > and ω > a r lm r r m+m f ω f m b r lm f ω + ω r r Therefore, Lemma A holds wth α m + m, β, m +rω f x dx f x dx f x dx ω f m, m m+m, a f f m+m ω m ω m, and b f ω + ω mn{ /ω,/ω } +rω rω m +rω r f x dx f x dx rω f x dx m m + m + m! f + rω f rω dr f ω m ω m f ω + ω m+m m+m m + o m+m 8

9 Therefore, mn{ /ω,/ω } +rω rω! m m +! r f x dx m m + rω m +rω f x dx f x dx f + rω f rω dr m f ω m ω m m + m! + o m+m f ω + ω In addton, t can be shown that last ntegral s bounded by a constant To see that, notce that rω f x dx m frω m, In addton, for r /ω we have +rω f x dx m frω m, and +rω f x dx m m + +rω f x dx m m + rω rω frω + ω m m + Let s fω + ω r mn{ /ω,/ω } +rω rω! m m +! r f x dx f f m+m ω m ω m mn{ /ω,/ω } f f m+m f m+m m m + rω m +rω f x dx f x dx f + rω f rω dr m! m m +! rm+m fω + ω r m m + dr ω m ω m ω + ω m+m! m m +! fω+ω mn{ /ω,/ω } s m+m s m m+ ds It s easy to see that mn{ /ω, /ω } ω + ω If /ω /ω, then ω ω ω so ω ω + ω An analogous argument apples for the case /ω /ω In addton, because the support of X has length one, t has to be the case that f 9

10 Therefore, the upper lmt of the ntegral s smaller than one We obtan mn{ /ω,/ω } +rω rω f m+m f f m+m! m m +! r f x dx m m + ω m ω m ω + ω m+m rω m +rω f x dx f x dx f + rω f rω dr! m m +! m s m+m s m m+ ds The ntegral n the rght hand sde s a Beta functon wth parameters m +m and m m +, whch s equal to m + m! m m +!/ +! Therefore, mn{ /ω,/ω } +rω rω f m+m f f m+m! m m +! r f x dx m m + rω m +rω f x dx f x dx f + rω f rω dr ω m ω m ω + ω m m+m + m! whch s ntegrable over ω, ω S ++, because ω m ω m S ++ f m+m f f m+m ω + ω λ m+m S dω m! m!, m + m see, eg, Gradshteyn and Ryzh,, eq m ω m ω m ω + ω m m+m + m!, Then, applyng Lebesgue s Domnated Convergence Theorem, and usng agan the result n last equaton we obtan: P f f + o 3 x x : Ths case s analogous to the case wth x x and contrbutes the same amount to the ntegral: Hence, P 3 + f f + o Pr j J, j J X j, W W, W j, ι W P + P + P 3 + f f + o

11 As a result the frst two moments of K are gven by: K W, X x, ι W f x + o f x K W, X x, ι W f x f x Let p PrW + K σw X o f x f x + K σw X W PrW + + K σw X W PrW We focus on the frst term The second term can be calculated analogously Frst, notce that / p/ p almost surely From the proof of Lemma 3, we obtan: q n K q W, X x, ι W C Sq, n, n for some C > and all q Usng Chernoff s Inequalty, t s easy to show that all postve moments of / exst, condtonal of X x and W and are bounded unformly n arov s Inequalty mples that / n s asymptotcally unformly ntegrable, whch, n turn, mples convergence of moments: K W, X x f x p f x p + o K W, X x f x p f x p + + f x f x p p + o Therefore, + K W, X x + K + K W, X x + f x p f x p + f x p f x p + + f x p f x p + o + p f x + p f x p f x p f x + p f x p f x + o Because ex pf x/pf x + pf x, and thus ex/ex pf x/pf x, ths can be wrtten as + K W, X x ex + ex ex + ex ex + o

12 Because the bound on the condtonal moments of K, and because the moments of / n condtonal on X x and W do not depend on x, and are bounded unformly n, we obtan: + K σw X W ex + ex ex + ex ex σx W + o After some algebra t can be shown that: ex + ex ex + ex ex σx W p σ X + ex ex ex σx The analogous result holds condtonng on W, so the result follows Although t s not necessary for the proof of Theorem 5, t can be seen that V converges to ts expectaton Before provng that result we gve a couple of prelmnary lemmas As before, wthout loss of generalty assume that the support of X s, Defne f xdx f W, A P f xdx f W, A Let X,, for,, be the covarates for the control observatons, wth P, and K, the correspondng versons of P and K Also defne X, to be the order statstcs so that X, < X,+, and let A be the correspondng catchment areas: A X, + X, /, X, + X,+ / for, and P, the correspondng probabltes that s, based on the orderng of the covarates, not based on the orderng of the probabltes themselves: X, +X,+ / P, f xdx f xdx Defne A X, +X, / P, f X, f X, F X,+ F X, / Lemma A6: For all δ >, and all fxed K and maxx,+k X, o p +δ, max P, P, o p +δ max P, o p +δ,

13 Proof of Lemma A6: Frst, consder part Because F X,+ F X, f x X,+K X, for some x X,, X,+K, t follows that max X,+K X, sup x f x max F X,+K F X, Wth the support of X compact and the densty bounded away from zero the frst factor s bounded By the fact that the dstrbuton functon of a contnuous random varable has a unform dstrbuton, and by the fact that the order statstcs of unform random varables can be wrtten as ratos of sums of d unt exponentals the second factor has the same dstrbuton as max +K,, K m / ɛ m m ɛ m, K for d unt exponental ɛ m Hence t wll be suffcent to show that max,, K m ɛ +m/ j ɛ j o p +δ To show ths we frst show that K / K max ɛ +m ɛ j ɛ +m / + o p +δ, A6 m and second that max K m j m ɛ +m / + o p +δ A7 To show that A6 holds, consder K / δ max ɛ +m ɛ j m j K ɛ +m / + δ max m + / j ɛ j/ δ max ɛ K ɛ +m + m j ɛ j A8 The second factor n A8, δ max ɛ s o p because all moments of ɛ m exsts because t s unt exponental The frst factor n A8 converges to zero, so A8 s o p and A6 holds To show that A7 holds, consder Pr δ max Pr K ɛ +m / + > C m δ max K ɛ +m > C m K Pr δ ɛ +m > C m Pr ɛ m C δ m 3

14 Pc > /δ Then the rght hand sde s equal to Pr ɛ m C δ m By Chebyshev s nequalty ths can be bounded from above by m ɛ m C δ ɛ m C δ, m whch converges to zero because fnshes part of the Lemma ext, consder part Because max m ɛ m P, P, max P, P,, t s suffcent to show that max P, P, o p +δ By the trangle nequalty s fnte gven that the ɛ are d unt exponental Ths δ max P, P, δ max X, +X,+ / X, +X, / f xdx f X, X,+ X, / A9 + δ max Consder the frst term, A9: δ max f X, X,+ X, / f X, f X, F X,+ F X, / X, +X,+ / X, +X, / δ max δ max f xdx f X, X,+ X, / X,+ X, / max X,+ X, max δ max X,+ X, sup f x x sup x X,,X,+ X,+ X, sup x f x f X, f x A The last factor s bounded Because for all δ > we have δ max X,+ X, op, t follows that for δ > δ / δ max X,+ X, δ δ δ max X,+ X, op 4

15 Hence A9 s o p To show that the second term, A, s o p t s suffcent to show that δ max X,+ X, f X, F X,+ F X, o p, because f x s bounded By a mean value theorem t follows that X,+ X, f x F X,+ F X, for some x X,, X,+ So, for ths value of x, δ max X,+ X, f X, F X,+ F X, δ max X,+ X, f x f X, δ max X,+ X, f X, + f x x X, f X, δ/ max X,+ X, δ/ x X f, x f X, δ/ max X,+ X, δ/ x X, f sup x x,x f x Because x X,, X,+ and X,+ X, o p δ/, t follows that δ/ max X,+ X, δ/ and x X, are op Because the last factor s bounded the product s o p and thus A s o p Ths fnshed part of the Lemma Fnally, consder part of the Lemma By part of the Lemma t s suffcent to show that P, o p δ Because f x and f x are bounded and bounded away from zero t s suffcent to show that max F X,+ F X, o p δ Ths follows by the same argument as n part of the Lemma Lemma A7: Suppose that g s contnuously dfferentable on the nterval, If ɛ,, ɛ unt-exponental, then for fxed, as, / / g ɛ j ɛ l ɛ +j ɛ l p gxdx j l and 4 / g ɛ j j l ɛ l j + j + l ɛ +j / l ɛ l p + gxdx Proof: We show that for arbtrary fxed ntegers K, K, and K 3 mnk, K we have K / / p g ɛ j ɛ +K3 ɛ l gxdx K j l ɛ l l are d A A A3 Applyng to each of the terms n A then gves the desred result We prove that A3 holds for K K K 3 The dfference wth terms wth other values of K, K, and K 3 s of order o p By the trangle nequalty we have / / g ɛ j ɛ l ɛ ɛ l gxdx j l l 5

16 / / / g ɛ j ɛ l ɛ ɛ l g / + ɛ ɛ l j l l l / ɛ + g / + ɛ ɛ l g / + + l + g/ + ɛ g/ g/ + gxdx + We wll show for each of the terms A4-A7 that they are of order o p Frst note that max,, ɛ + + o p j A4 A5 A6 A7 A8 Ths follows because max,, + ɛ + j max,, + ɛ The expectaton of ɛ s zero, wth second moment equal to µ and fourth moment fnte Then defne Z + j ɛ The fourth moment of Z s bounded by C / 4 for some fnte C Then, for < α < /4, Prmax Z C α PrZ C α j PrZ 4 C 4 α Z 4 /C 4 4α C / 4 4α /C 4 C 3+4α 4 /C 4 ext, note that / max,, ɛ ɛ l j l ɛ j / + o p j A9 Ths follows from / max,, ɛ ɛ l j + l ɛ j / + max + j ɛ l ɛ l/ + o p j ɛ l ɛ l/ + j 6

17 Combned these two results mply that / max,, ɛ ɛ l / + o p j l A3 ow consder A4 / g ɛ j j max x max x l ɛ l g x max g x max / / ɛ ɛ l g / + ɛ ɛ l l l / ɛ j ɛ l / + j l / ɛ ɛ l l / ɛ j ɛ l / + o p j ext, consder A5 / ɛ g / + ɛ ɛ l g / l l g / + ɛ l ɛ l/ + o p ext, consder A6 Because ɛ, t follows that the expectaton of ths term s zero Its varance s g/ / + max x, gx / + whch converges to zero, mplyng that ths term s o p Fnally, consder A7 By contnuty of g, ths non-stochastc term converges to zero Ths fnshes the proof for part The same argument shows that 4 / g ɛ j j l ɛ l j + ɛ +j / l ɛ l 4 g / j + ɛ +j / The expected value for j + ɛ +j s 4 + Usng the exstence of fourth moments one can then show that 4 g / j + ɛ +j / 4 g / 4 + / p, whch n turn mples the second part of the Lemma Lemma A8: p W σx K W σ X P + P P p 7

18 Proof of Lemma A8: We wll show that W σx K P P P σ X, K, P, P, P, p We frst prove ths for the sngle match case wth Wth, condtonal on,, and X W X,, W X the -vector K, wth th element K, has a multnomal dstrbuton wth parameters P,,, P, and The moment generatng functon of the frst components of the vector K s t,, t exp We need the followng moments: µ, K, X P,, K t µ, K, X P, + P, P,, µ 4, K, 4 X P, + 7 P, P, expt + P, +4 P, P,, 4 µ,,,j K, K, j X P, P,j + P, P,j + P, P,j + 3 P, P,j, where the last expectaton s for j Then σx, K, P, + P, P, σx, σx,j K, µ K, j µ j σx 4, µ 4, + σx, σx,j µ,,,j µ, µ,j j σ 4 X, P, + 7 P, +4 P, P, 4 + σ X, σx,j P, P,j P, P,j j 8

19 + 4 + P, P,j P, P,j Usng the fact that for all δ >, max P, o p +δ, all sums n ths expresson can be shown to be convergng to zero n probablty For example, choosng δ < / σ 4 X, 3 P, 4 sup σx 4 x 3 max P, o p 4+4δ o p ow consder the case wth general The margnal dstrbuton of K, remans bnomal wth parameters and P,, and so the moments µ,, µ,, and µ 4, are as before The dfference s n the moment µ,,,j There are two possbltes Frst, A A j In that case µ,,,j s as before Second, A A j In that case µ,,,j maxµ 4,, µ 4,j Frst we shall show that that out of the pars, j the number of pars wth A A j s less than Consder the catchment area for unt, A X, + X, /, X, + X,+ / Ths overlaps only wth the catchment areas for unts + to +, a total of unts Hence the total number of pars, j wth overlap n the catchment areas s less than or equal to For the unts wth overlappng catchment areas the correlaton between K, and K, j s hgher than for unts wth non-overlappng catchment areas Hence we can bound the second cross moment for such unts from above by µ 4, µ 4,j Hence the dfference wth the expresson for s bounded by max µ 4, Ths converges to zero usng the expresson for µ 4, gven above Lemma A9: W σx P + P P p σx f X f X W + + σ X f X f X W Proof of Lemma A9: To prove ths result we show frst that and second that W P P p σx fx f X W, A3 W P p p + σ X the combnaton of whch gves the desred result For A3 consder: W σx P σx, P, 9 f X f X W A3

20 Ths can be bounded n absolute value by sup x σx max P, By Lemma A6 max P, o p +δ for any δ >, so max P, o p +δ, and sup x σx max P, o p +δ for all δ > Choose δ < /, so that sup x σx max P, o p and thus σ X, P, o p Hence n order to show that A3 holds t remans to show that We can wrte W σx p P σx fx f X W A33 W σx P σx, P, σx, P, σx, P, + o p, σx, fx, f X, F X,+ F X, + o p where the second to last equalty follows from Lemma A6 Wth X d wth cdf F x, the vector F X,, F X has the same dstrbuton as the vector ɛ / j ɛ j,, ɛ / j ɛ j, wth the ɛ j d unt exponental Hence to show A33 t suffces to show, for d unt exponental ɛ j, that σf ff j ɛ j / ɛ l ɛ j/ l ɛ l f F j ɛ j/ l ɛ l ɛ +j / ɛ l j l p σx fx f X W j By Lemma A7, for g contnuously dfferentable on, and d unt-exponental ɛ we have / / g ɛ j ɛ l ɛ +j ɛ l p gzdz j l j Wth gz σf z f F z/f F z, ths equals gzdz σf ff z z f F z dz σz f z f z df z σx fx f X W Thus A33 holds, and therefore A3 For A3 we have: l l W σx P σx, P, σx, P, + o p σf ɛ j / ɛ l j l f F j ɛ j/ f F j ɛ j/ l ɛ l l ɛ l m + ɛ +m j ɛ +o p j

21 g F ɛ j / ɛ l m + ɛ +m j ɛ + o p, j j l wth gz σ zf z /f z Then usng part of Lemma A7 shows that A3 holds Proof of Theorem 5: Condtonal on X and W the varance of the smple matchng estmator wth matches s V + + K σw X W σ X + W σ X + W K W K σ X + σ X + K W σ X K W σ X Frst we shall show that ths converges to V p σx W + p σx p f X p f X W σ +p X fx f X + σ X + f X p f X p W +p σx W + p σx p f X p f X W σ + p X fx f X + σ X + f X p f X p W We wll loo at convergence of one of the terms n V to the correspondng term n V Specfcally, we wll show that K W σ X p p σ X The others follow by the same argument By Lemma A8 fx f X + σ X + f X f X p p W A34 W σx K P P P p By Lemma A9 W σx P + P P p σx p f X p f X W + p + p,

22 so that W σx P + P P p p σx p f X p f X W + + p p The fnal step conssts of showng that V s equal to σ X + ex ex ex σ + X + ex ex ex σx σx Ths follows from smple algebra For example, collectng the terms wth σx and no factor / n V : p σx W + p σx p f X p f X W +p σx f X p f X p W p σx p f X + p f X + p f X p f X W p σx + ex ex + p ex ex W p σx + ex ex + ex ex W σ p X ex W σ X ex Remander of proof of Lemma A5: Let µ 4 be a bound to the fourth centered condtonal moments of ε Because µ 4 <, t s easy to show that the varance of the frst term s o The varance of the second term multpled tmes J 4 s: K q J j ε l j σ W X lj J K q j + J K q K t q t> j K q J µ 4 + ε l j σ W X lj ε l j σ W X lj J j max K q J L µ 4 J µ 4 K q + J L µ 4 ε l jt σ W X ljt max K q

23 Usng Bonferron s Inequalty: max K q max K 4q n Pr K 4q > n n Pr max K 4q > n K 4q, whch s unformly bounded for all Because the frst moment of a random varable s bounded by the square-root of the second moment we obtan that / max K q s unformly bounded for all, and the second term on the rght hand sde of equaton A s o p Let σ be a unform bound for the condtonal varance of ε, and σ 4 σ The varance of the thrd term on the rght hand sde of equaton A dvded by 4/J 4 s: K q + t> J j h>j ε ljε lh J K q K t q JJ σ4 j h>j ε ljε lh J K q J j h>j K q + J LJ σ 4 j h>j ε ljtε lh t ε ljε lh max K q o The last nequalty holds because wthn the same treatment group, each observaton s used as a match at most J L tmes; and because there are J possble combnatons of that observaton and the other J matches The varance of the fourth term on the rght hand sde of equaton A dvded by 4/J s: K q ε + J j ε lj K q K t q ε t> J j ε lj K q ε ε t J σ4 K q + J j ε ljt J j 4 J L σ ε lj max K q o 3

24 The varance of the ffth term on the rght hand sde of equaton A dvded by 4/J s: K q ε + J µ W X µ W X lj j K q ε J µ W X µ W X lj j K q K t q ε t> J µ W X µ W X lj ε t j J µ Wt X t µ Wt X ljt j σ J K q µ W X µ W X lj o The varance of the sxth term on the rght hand sde of equaton A dvded by 4/J 4 s: K q + J J ε lj j j J K q ε ljt j j J σ + j j J µ W X µ W X lj ε lj J µ W X µ W X lj j J K q K t q t> j J µ Wt X t µ Wt X ljt K q J L σ max ε lj j J µ W X µ W X lj J µ W X µ W X lj j max K q max J µ W X µ W X lj o As a result, the varance of each term on the rght hand sde of equaton A s o, so equaton A9 holds Ths result, along wth the result n equaton A8 guarantees that the result of the lemma holds Here we also prove the second part of the lemma The analyss from the begnnng of ths proof to equaton A7 apples here wthout change Recall also from the proof of Lemma 3 that for any q, / K q W s unformly bounded As a result, we obtan: W K q σ W X X, W σw X max σ W X X, W σw X W j K q W o p A35 4

25 To obtan the second result of the lemma, t s left to be proven that for q : otce that: J + W K q σ W X X, W σ W X o p A36 J + J W W W K q J K q ε K q σ W X X, W σ W X J j J j ε l j σ W X lj + J ε lj + J J W W K q ε K q J j J W W K q K q ε σw X J j h>j ε ljε lh µ W X µ W X lj J ε lj j j µ W X µ W X lj A37 The means of the terms on the rght-hand sde of equaton A37 are zero It s left to be shown that the varances are o The varance of the frst term on the rght hand sde of equaton A37 s K q ε σw X K q ε σw X W µ 4 The varance of the second term multpled tmes J 4 s: W K q J j J K q W j + K q J µ 4 W JJ L µ 4 JJ L µ 4 ε l j σ X lj W t,t> K q W W W ε l j σ X lj K t q J j ε l j σ X lj + JJ L µ 4 K q W J W, K K q max W t K t q max W K t q W, K JJ L µ 4 j o p ε l jt σ X ljt K q max K t q W t + o + o max K t q + o, W 5

26 where A s the ndcator functon of the set A that s A x f x A, zero otherwse Bonferron s Inequalty: max K q max W K 4q W n n Pr max K 4q > n W Pr K 4q > n W K 4q W, Usng whch s unformly bounded Because the frst moment of a random varable s bounded by the square-root of the second moment we obtan that / max W K q s unformly bounded, and the second term on the rght hand sde of equaton A37 s o p The varance of the thrd term on the rght hand sde of equaton A37 dvded by 4/J 4 s: W + JJ σ4 K q W K q J j h>j JJ J L σ 4 JJ J L σ 4 ε ljε lh W t,t> J K t q K q W W j h>j J K q W ε ljε lh J j h>j + JJ J L σ 4, K K q max W t K t q max K q, K W W JJ J L σ 4 j h>j ε ljtε lh t W + o + o ε ljε lh K q max W t K t q max K q + o o W The varance of the fourth term on the rght hand sde of equaton A37 dvded by 4/J s: W + J σ4 K q ε W J j K q ε lj W t,t> K t q ε J j W ε lj K q ε ε t K q W + J 4 L σ J j W ε ljt J j ε lj K q max W t K q o 6

27 The varance of the ffth term on the rght hand sde of equaton A37 dvded by 4/J s: W K q ε W J µ W X µ W X lj j K q ε J µ W X µ W X lj j + K q K t q ε W t> σ J µ W X µ W X lj ε t j W J µ Wt X t µ Wt X ljt j J K q µ W X µ W X lj o The varance of the sxth term on the rght hand sde of equaton A37 dvded by 4/J 4 s: W + J K q W W J ε lj j j J K q ε ljt j j J σ K q j j J µ W X µ W X lj ε lj J µ W X µ W X lj j J K t q W t,t> j J µ Wt X t µ Wt X ljt W + JJ L σ W t ε lj j J K q max µ Wt X t µ Wt X ljt W j J µ W X µ W X lj J K q max K t q max µ Wt X t µ Wt X W t W ljt o t As a result, the varance of each term on the rght hand sde of equaton A37 s o, so equaton A36 holds Ths result, along wth the result n equaton A35 guarantees that the result of the lemma holds j Remnder of proof of Theorem 8: For the varance of τ sm,t W Y Ŷ τ sm,t W W we obtan: Y Ŷ τ t τ sm,t τ t Y Ŷ τ t + op A38 7

28 In addton, Y Ŷ τ t W µ X µ X jm τ t + ε W m W m + µ X µ X jm τ t ε W m ε jm m ε jm A39 Because the sample maxmum of the norms of the matchng dscrepances, X X jm, s o p, and the regresson functon µ, s Lpschtz, we obtan W µ X µ X jm o p A4 m Consder the frst term on the rght hand sde of equaton A39: W W µ X µ X jm τ t m µ X µ X τ t + µ X µ X jm W m µ X µ X τ t + µ X µ X jm + µ X µ X τ t W W m µ X µ X jm m µ X µ X τ t + o p, A4 by Hölder s Inequalty and equaton A4 ext, consder the second term on the rght hand sde of equaton A39: W ε m ε jm W ε + m W ε j + m m n>m ε jmε jn ε ε jm m Therefore, W ε m ε jm + W W + W K σ X, W W + W K m n>m ε jmε jn ε σ X, W W ε ε jm m A4 8

29 The expectatons condtonal on X and W of each of the three terms on the rght hand sde of last expresson are zero, so the uncondtonal expectatons are also zero Because the fourth condtonal moments of ε are unformly bounded, and because / K W s unformly bounded see Proof of Lemma 3, we obtan: W + W K ε σ X, W W + W K The varance of the second term dvded by 4/ 4 s ε jmε jn W m n>m + + W 4 m n>m ε σ X, W o ε jmε jn W W j,j> m n>m W W W σ 4 ε jmε jn m n>m K K σ 4 o The varance of the thrd term dvded by 4/ s ε ε jm ε ε jm W m W m + jmj ε ε jm ε j ε W W,j> m m σ 4 o As a result, we obtan W ε m ε jm W W + W K σ X, W o p Fnally consder the last term on the rght hand sde of equaton A39 Let Ψ t, µ X µ X jm τ t m otce that there s a fnte bound Ψ t, such that Ψ t, Ψt for all The condtonal expectaton of the last term of equaton A39 s zero, so the uncondtonal expectaton s also zero The condtonal varance jnj ε jmjε 9

30 of ths term dvded by 4 s: jmj Ψ t,ψ t,j ε ε jm ε j ε W W j m m Ψ t,ψ t,jε ε j W W j + Ψ t,ψ t,jε W W j + Ψ t,ψ t,j W W j otce that: Ψ t,ψ t,jε ε j W W j Ψ t, ε Ψt W Ψ t,ψ t,jε ε jmj, W W j W + m Ψ t,ψ t,j ε jm ε jmj W j m m Ψ t,ψ t,j ε jm W W j,j> m m + Ψt ε jmj m ε jm ε jmj m m ε W o, Ψ t, ε jm W m ε jmj Ψt σ W K K ε o W As a result, we obtan: Ŷ Ŷ τ sm,t µ X µ X τ t W Applyng the prevous lemma: Therefore, W + W K V τx,t W Y Ŷ τ sm,t W + σ X, W W + W K σ X, W + o p Addtonal References W + W K σ X, W o p W + W K σ X, W p V τx,t Gradshteyn, IS and I Ryzh,, Tables of Integrals, Seres, and Products, 6th edton, Academc Press, San Dego 3

3.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

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

Strong Markov property: Same assertion holds for stopping times τ.

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

More metrics on cartesian products

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

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

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

Lecture 3: Probability Distributions

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

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table: SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

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

APPENDIX A Some Linear Algebra

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

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications

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

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

First Year Examination Department of Statistics, University of Florida

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

Supplementary material: Margin based PU Learning. Matrix Concentration Inequalities

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

Complete subgraphs in multipartite graphs

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

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

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

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 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 information

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

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

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

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

Applied Stochastic Processes

Applied Stochastic Processes STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva

Econ Statistical Properties of the OLS estimator. Sanjaya DeSilva Econ 39 - Statstcal Propertes of the OLS estmator Sanjaya DeSlva September, 008 1 Overvew Recall that the true regresson model s Y = β 0 + β 1 X + u (1) Applyng the OLS method to a sample of data, we estmate

More information

MATH 281A: Homework #6

MATH 281A: Homework #6 MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested

More information

Lecture 4: Universal Hash Functions/Streaming Cont d

Lecture 4: Universal Hash Functions/Streaming Cont d CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected

More information

Lecture 4 Hypothesis Testing

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

MATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1

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

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

THE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION

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

Supplement to Clustering with Statistical Error Control

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

Simulation and Random Number Generation

Simulation and Random Number Generation Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

CSCE 790S Background Results

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

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

First day August 1, Problems and Solutions

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

Differentiating Gaussian Processes

Differentiating Gaussian Processes Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the

More information

Conjugacy and the Exponential Family

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

Randomness and Computation

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

Foundations of Arithmetic

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

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis

Appendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

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 information

Exercise Solutions to Real Analysis

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

Lecture 4: September 12

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

Dirichlet s Theorem In Arithmetic Progressions

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

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials MA 323 Geometrc Modellng Course Notes: Day 13 Bezer Curves & Bernsten Polynomals Davd L. Fnn Over the past few days, we have looked at de Casteljau s algorthm for generatng a polynomal curve, and we have

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Online Appendix to The Allocation of Talent and U.S. Economic Growth

Online Appendix to The Allocation of Talent and U.S. Economic Growth Onlne Appendx to The Allocaton of Talent and U.S. Economc Growth Not for publcaton) Chang-Ta Hseh, Erk Hurst, Charles I. Jones, Peter J. Klenow February 22, 23 A Dervatons and Proofs The propostons n the

More information

Effects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012

Effects of Ignoring Correlations When Computing Sample Chi-Square. John W. Fowler February 26, 2012 Effects of Ignorng Correlatons When Computng Sample Ch-Square John W. Fowler February 6, 0 It can happen that ch-square must be computed for a sample whose elements are correlated to an unknown extent.

More information

DECOUPLING THEORY HW2

DECOUPLING THEORY HW2 8.8 DECOUPLIG THEORY HW2 DOGHAO WAG DATE:OCT. 3 207 Problem We shall start by reformulatng the problem. Denote by δ S n the delta functon that s evenly dstrbuted at the n ) dmensonal unt sphere. As a temporal

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

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

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,

More information

HMMT February 2016 February 20, 2016

HMMT February 2016 February 20, 2016 HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,

More information

Lecture Space-Bounded Derandomization

Lecture Space-Bounded Derandomization Notes on Complexty Theory Last updated: October, 2008 Jonathan Katz Lecture Space-Bounded Derandomzaton 1 Space-Bounded Derandomzaton We now dscuss derandomzaton of space-bounded algorthms. Here non-trval

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

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

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010

Parametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010 Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton

More information

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition) Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes

More information

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

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

Lecture 4. Instructor: Haipeng Luo

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

Random Partitions of Samples

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

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

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

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13] Algorthms Lecture 11: Tal Inequaltes [Fa 13] If you hold a cat by the tal you learn thngs you cannot learn any other way. Mark Twan 11 Tal Inequaltes The smple recursve structure of skp lsts made t relatvely

More information

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities Algorthms Non-Lecture E: Tal Inequaltes If you hold a cat by the tal you learn thngs you cannot learn any other way. Mar Twan E Tal Inequaltes The smple recursve structure of sp lsts made t relatvely easy

More information

arxiv: v1 [math.ho] 18 May 2008

arxiv: v1 [math.ho] 18 May 2008 Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc

More information

Composite Hypotheses testing

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

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, 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 information

Primer on High-Order Moment Estimators

Primer on High-Order Moment Estimators Prmer on Hgh-Order Moment Estmators Ton M. Whted July 2007 The Errors-n-Varables Model We wll start wth the classcal EIV for one msmeasured regressor. The general case s n Erckson and Whted Econometrc

More information

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Modelli Clamfim Equazioni differenziali 22 settembre 2016 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 22 settembre 2016 professor Danele Rtell danele.rtell@unbo.t 1/22? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

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

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve follow-up tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

EEE 241: Linear Systems

EEE 241: Linear Systems EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they

More information

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7

Stanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7 Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every

More information

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients ECON 5 -- NOE 15 Margnal Effects n Probt Models: Interpretaton and estng hs note ntroduces you to the two types of margnal effects n probt models: margnal ndex effects, and margnal probablty effects. It

More information

Affine transformations and convexity

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

Probability and Random Variable Primer

Probability and Random Variable Primer B. Maddah ENMG 622 Smulaton 2/22/ Probablty and Random Varable Prmer Sample space and Events Suppose that an eperment wth an uncertan outcome s performed (e.g., rollng a de). Whle the outcome of the eperment

More information

Comparison of Regression Lines

Comparison of Regression Lines STATGRAPHICS Rev. 9/13/2013 Comparson of Regresson Lnes Summary... 1 Data Input... 3 Analyss Summary... 4 Plot of Ftted Model... 6 Condtonal Sums of Squares... 6 Analyss Optons... 7 Forecasts... 8 Confdence

More information

A be a probability space. A random vector

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

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14

APPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14 APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce

More information

Why Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability

Why Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability Introducton to Monte Carlo Method Kad Bouatouch IRISA Emal: kad@rsa.fr Wh Monte Carlo Integraton? To generate realstc lookng mages, we need to solve ntegrals of or hgher dmenson Pel flterng and lens smulaton

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

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

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD

Matrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo

More information

Solutions Homework 4 March 5, 2018

Solutions Homework 4 March 5, 2018 1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and

More information

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.

More information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).

More information

Chapter 11: Simple Linear Regression and Correlation

Chapter 11: Simple Linear Regression and Correlation Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests

More information

Lecture 12: Discrete Laplacian

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

F statistic = s2 1 s 2 ( F for Fisher )

F statistic = s2 1 s 2 ( F for Fisher ) Stat 4 ANOVA Analyss of Varance /6/04 Comparng Two varances: F dstrbuton Typcal Data Sets One way analyss of varance : example Notaton for one way ANOVA Comparng Two varances: F dstrbuton We saw that the

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

18.1 Introduction and Recap

18.1 Introduction and Recap CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng

More information

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim Causal Damonds M. Aghl, L. Bombell, B. Plgrm Introducton The correcton to volume of a causal nterval due to curvature of spacetme has been done by Myrhem [] and recently by Gbbons & Solodukhn [] and later

More information