Efficient detection of random coefficients in autoregressive models

32Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The problem of detecting randomness in the coefficients of an AR(p) model, that is, the problem of testing ordinary AR(p) dependence against the alternative of a random coefficient autoregressive [RCAR(p)] model is considered. A nonstandard LAN property is established for RCAR(p) models in the vicinity of AR(p) ones. Two main problems arise in this context. The first problem is related to the statistical model itself: Gaussian assumptions are highly unrealistic in a nonlinear context, and innovation densities should be treated as nuisance parameters. The resulting semiparametric model however appears to be severely nonadaptive. In contrast with the linear ARMA case, pseudo-Gaussian likelihood methods here are invalid under non-Gaussian densities; even the innovation variance cannot be estimated without a strict loss of efficiency. This problem is solved using a general result by Hallin and Werker, which provides semiparametrically efficient central sequences without going through explicit tangent space calculations. The second problem is related to the fact that the testing problem under study is intrinsically one-sided, while the case of multiparameter one-sided alternatives is not covered by classical asymptotic theory under LAN. A concept of locally asymptotically most stringent somewhere efficient test is proposed in order to cope with this one-sided nature of the problem.

Cite

CITATION STYLE

APA

Akharif, A., & Hallin, M. (2003). Efficient detection of random coefficients in autoregressive models. Annals of Statistics, 31(2), 675–704. https://doi.org/10.1214/aos/1051027885

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free