Asymptotic lower bounds in estimating jumps

E Clement, S Delattre, A Gloter - 2014 - projecteuclid.org
E Clement, S Delattre, A Gloter
2014projecteuclid.org
We study the problem of the efficient estimation of the jumps for stochastic processes. We
assume that the stochastic jump process (X_t)_t∈0,1 is observed discretely, with a sampling
step of size 1/n. In the spirit of Hajek's convolution theorem, we show some lower bounds for
the estimation error of the sequence of the jumps (ΔX_T_k)_k. As an intermediate result, we
prove a LAMN property, with rate n, when the marks of the underlying jump component are
deterministic. We deduce then a convolution theorem, with an explicit asymptotic minimal …
Abstract
We study the problem of the efficient estimation of the jumps for stochastic processes. We assume that the stochastic jump process is observed discretely, with a sampling step of size . In the spirit of Hajek’s convolution theorem, we show some lower bounds for the estimation error of the sequence of the jumps . As an intermediate result, we prove a LAMN property, with rate , when the marks of the underlying jump component are deterministic. We deduce then a convolution theorem, with an explicit asymptotic minimal variance, in the case where the marks of the jump component are random. To prove that this lower bound is optimal, we show that a threshold estimator of the sequence of jumps based on the discrete observations, reaches the minimal variance of the previous convolution theorem.
Project Euclid
以上显示的是最相近的搜索结果。 查看全部搜索结果