Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asymptotic lower bounds in estimating jumps

Published 1 Jul 2014 in math.ST and stat.TH | (1407.0241v1)

Abstract: We study the problem of the efficient estimation of the jumps for stochastic processes. We assume that the stochastic jump process $(X_t){t\in[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 $(\Delta X{T_k})k$. As an intermediate result, we prove a LAMN property, with rate $\sqrt{n}$, 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 $(\Delta X{T_k})_k$ based on the discrete observations, reaches the minimal variance of the previous convolution theorem.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.