arXiv subjects

Marc Hallin

Publications and source records attributed to Marc Hallin.

57 records · Page 4Linked to original sources

arXiv2006

Serial and nonserial sign-and-rank statistics: asymptotic representation and asymptotic normality

The classical theory of rank-based inference is entirely based either on ordinary ranks, which do not allow for considering location (intercept) parameters, or on signed ranks, which require an assumption of symmetry. If the median, in the absence of a symmetry assumption, is considered as a location parameter, the maximal invariance property of ordinary ranks is lost to the ranks and the signs. This new maximal invariant thus suggests a new class of statistics, based on ordinary ranks and signs. An asymptotic representation theory à la Hájek is developed here for such statistics, both in the nonserial and in the serial case. The corresponding asymptotic normality results clearly show how the signs add a separate contribution to the asymptotic variance, hence, potentially, to asymptotic efficiency. As shown by Hallin and Werker [Bernoulli 9 (2003) 137--165], conditioning in an appropriate way on the maximal invariant potentially even leads to semiparametrically efficient inference. Applications to semiparametric inference in regression and time series models with median restrictions are treated in detail in an upcoming companion paper.

math.ST↗

arXiv2005

Rank-based optimal tests of the adequacy of an elliptic VARMA model

We are deriving optimal rank-based tests for the adequacy of a vector autoregressive-moving average (VARMA) model with elliptically contoured innovation density. These tests are based on the ranks of pseudo-Mahalanobis distances and on normed residuals computed from Tyler's [Ann. Statist. 15 (1987) 234-251] scatter matrix; they generalize the univariate signed rank procedures proposed by Hallin and Puri [J. Multivariate Anal. 39 (1991) 1-29]. Two types of optimality properties are considered, both in the local and asymptotic sense, a la Le Cam: (a) (fixed-score procedures) local asymptotic minimaxity at selected radial densities, and (b) (estimated-score procedures) local asymptotic minimaxity uniform over a class F of radial densities. Contrary to their classical counterparts, based on cross-covariance matrices, these tests remain valid under arbitrary elliptically symmetric innovation densities, including those with infinite variance and heavy-tails. We show that the AREs of our fixed-score procedures, with respect to traditional (Gaussian) methods, are the same as for the tests of randomness proposed in Hallin and Paindaveine [Bernoulli 8 (2002b) 787-815]. The multivariate serial extensions of the classical Chernoff-Savage and Hodges-Lehmann results obtained there thus also hold here; in particular, the van der Waerden versions of our tests are uniformly more powerful than those based on cross-covariances. As for our estimated-score procedures, they are fully adaptive, hence, uniformly optimal over the class of innovation densities satisfying the required technical assumptions.

math.ST↗

arXiv2005

Local linear spatial regression

A local linear kernel estimator of the regression function x\mapsto g(x):=E[Y_i|X_i=x], x\in R^d, of a stationary (d+1)-dimensional spatial process {(Y_i,X_i),i\in Z^N} observed over a rectangular domain of the form I_n:={i=(i_1,...,i_N)\in Z^N| 1\leq i_k\leq n_k,k=1,...,N}, n=(n_1,...,n_N)\in Z^N, is proposed and investigated. Under mild regularity assumptions, asymptotic normality of the estimators of g(x) and its derivatives is established. Appropriate choices of the bandwidths are proposed. The spatial process is assumed to satisfy some very general mixing conditions, generalizing classical time-series strong mixing concepts. The size of the rectangular domain I_n is allowed to tend to infinity at different rates depending on the direction in Z^N.

math.ST↗