Spectral calibration of exponential Levy models ??
11
σ 2 |
_______γ______ |
λ |
μ | |
σmax > 0 |
y- ■ s+3 2 |
y- ■ ■■■■■■■ |
y- ■ ■■■ 2 |
log ' s 2 |
σmax — 0 |
0 |
ε (2 s +4) 7 (2 s+5) |
ε (2 s+2) 7 (2 s+5) |
ε 2 s/(2 s+5) |
Table 1. The minimax rates vq,σmax for the different parameters q.
Since the underlying Levy triplet is only identifiable if O (x) is known for
all x ∈ R, we consider the asymptotics of a growing number of observations
with
∆ := max (xj - xj-1) → 0
j=2,...,N j j-
and A := min(xN, -x1) → ∞. (21)
In contrast to standard regression estimates we shall always track ex-
plicitly the dependence on the level (δk ) of the noise in the observations,
which is usually rather small for observed option prices. The subsequent
analysis can certainly be improved for a concrete design (xj ) and concrete
noise levels (δj), but for revealing the main features it is more transparent
and concise to state the results in terms of the abstract noise level
ε := ∆3/2 + ∆1 /2 ∣∣J∏t.
(22)
comprising the level of the numerical interpolation error and of the stochas-
tic error simultaneously. Here and in the sequel we use the norms ∣δ∣l∞ :=
supk δk and ∣δ∣l22 := Pkδk2.
We now state the main results about the risk upper bounds of the estima-
tors obtained by the basic procedure, given the specific choices in Section
6.1, and about the risk lower bounds valid for any estimation procedure
whatsoever. The proofs are given in Sections 6 and 7 for the upper and
lower bounds, respectively.
Theorem 1. Assume e A < ∆2 and ∆∣∣J∣∣22 < ∣∣^∣∣2∞. For any σ > σmax
we choose
U-σ := σ—1(2log(ε-1)/T¢1 /2, Uɔ := ε-2/(2s+5), (23)
in the cases σmax > 0 and σmax = 0, respectively. Then every estimator
q ∈ {σ2,γ,λ,μ} for the corresponding parameter q satisfies the following
asymptotic risk bound:
suP Et [∣∣q - q∣∣ 2]1 /2 . vi,-,
T∈Gs (R,σ
max)
where ∣∣∙∣∣ denotes the absolute value for q ∈ {σ2, γ, λ} and the L2(R)-norm
for q = μ and the rate vq,σmax is given in Table 1.
The two assumptions in the theorem are not very severe: because of
the exponential decay of O the width A of the design only needs to grow
logarithmically and the error levels (δk ) need only be square summable after