24.02.2013 Views

Optimality

Optimality

Optimality

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

160 D. M. Dabrowska<br />

We have � t<br />

0 |ψ1n(h, θ, u)|N.(du)≤ρn(t) and � t<br />

0 |ψ2n(h, θ, u)|N.(du)≤h T � t<br />

0 Bn(u)×<br />

� τ<br />

N.(du), for a process Bn with limsupn 0 Bn(u)N.(du) = O(1) a.s. This follows<br />

from condition 2.1 and some elementary algebra. By Gronwall’s inequality,<br />

limsupn supt≤τ|remn(h, θ, t)| = O(|h| 2 ) = o(|h|) a.s. A similar argument shows that<br />

if hn is a nonrandom sequence with hn = O(n −1/2 ), then limsup n sup t≤τ|remn(hn,<br />

θ, t)| = O(n−1 ) a.s. If ˆ hn is a random sequence with | ˆ hn|<br />

limsupn supt≤τ|remn( ˆ hn, θ, t)| = Op(| ˆ hn| 2 ).<br />

6.4. Part (iv)<br />

P<br />

→ 0, then<br />

Next suppose that θ0 is a fixed point in Θ, EN(t) is continuous, and ˆ θ is a √ nconsistent<br />

estimate of θ0. Since EN(t) is a continuous function,{ ˆ W(t, θ) : t≤τ, θ∈<br />

Θ} converges weakly to a process W whose paths can be taken to be continuous<br />

with respect to the supremum norm. Because √ n[ ˆ θ−θ0] is bounded in probability,<br />

we have √ n[Γ n ˆ θ − Γθ0]− √ n[ ˆ θ− θ0] ˙ Γθ0 = ˆ W(·, ˆ θ)+ √ n[Γˆ θ − Γθ0− [ ˆ θ− θ0] ˙ Γθ0] =<br />

ˆW(·, ˆ θ)+OP( √ n| ˆ θ−θ0| 2 )⇒W(·, θ0) by weak convergence of the process{ ˆ W(t, θ) :<br />

t≤τ, θ∈Θ} and [8].<br />

7. Proof of Proposition 2.2<br />

The first part follows from Remark 3.1 and part (iv) of Proposition 2.1. Note that at<br />

the true parameter value θ = θ0, we have √ n[Γnθ0−Γθ0](t) = n1/2 � t<br />

0 R1n(du, θ0)×<br />

Pθ0(u, t) + oP(1), where R1n is defined as in Lemma 5.1,<br />

R1n(t, θ) = 1<br />

n<br />

n�<br />

i=1<br />

� t<br />

and Mi(t, θ) = Ni(t)− � t<br />

0 Yi(u)α(Γθ, θ, Zi)Γθ(du).<br />

We shall consider now the score process. Define<br />

Ũn1(θ) = 1<br />

n<br />

Ũn2(θ) =<br />

n�<br />

i=1<br />

� τ<br />

0<br />

� τ<br />

0<br />

0<br />

Mi(du, θ)<br />

s(Γθ(u−), θ, u) .<br />

˜ bi(Γθ(u), θ)Mi(dt, θ),<br />

�<br />

R1n(du, θ)<br />

(u,τ]<br />

Pθ(u, v−)r(dv, θ).<br />

Here ˜ bi(Γθ(u), θ) = ˜ bi1(Γθ(u), θ) − ˜ bi2(Γθ(u), θ)ϕθ0(t) and ˜ b1i(Γθ(t), θ) =<br />

˙ℓ(Γθ(t), θ, Zi)−[˙s/s](Γθ(t), θ, t), ˜ b2i(Γθ(t), θ) = ℓ ′ (Γθ(t), θ, Zi)−[s ′ /s](Γθ(t), θ, t).<br />

The function r(·, θ) is the limit in probability of the term ˆr1(t, θ) given below. Under<br />

Condition 2.2, it reduces at θ = θ0 to<br />

� t<br />

r(·, θ0) =− ρϕ(u, θ0)EN(du)<br />

0<br />

and ρϕ(u, θ0) is the conditional correlation defined in Section 2.3. The terms<br />

√ nŨ1n(θ0) and √ n Ũ2n(θ0) are uncorrelated sums of iid mean zero variables and<br />

their sum converges weakly to a mean zero normal variable with covariance matrix<br />

Σ2,ϕ(θ0, τ) given in the statement of Proposition 2.2.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!