On the asymptotic normality of kernel density estimators for linear random fields

Abstract

We establish sufficient conditions for the asymptotic normality of kernel density estimators, applied to causal linear random fields. Our conditions on the coefficients of linear random fields are weaker than known results, although our assumption on the bandwidth is not minimal. The proof is based on the m-approximation method. As a key step, we prove a central limit theorem for triangular arrays of stationary m-dependent random fields with unbounded m. We also apply a moment inequality recently established for stationary random fields.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…