Estimation in a model with infinite-dimensional nuisance parameter.
Consider an autoregressive model with measurement error: we observe Zi = Xi + εi, where the unobserved Xi is a stationary solution of the autoregressive equation Xi = gθ0(Xi − 1) + ξi. The regression function gθ0 is known up to a finite dimensional parameter θ0 to be estimated. The distributions of ξ1 and X0 are unknown and gθ belongs to a large class of parametric regression functions. The distribution of ε0is completely known. We propose an estimation procedure with a new criterion computed as...
Statistical inference procedures based on least absolute deviations involve estimates of a matrix which plays the role of a multivariate nuisance parameter. To estimate this matrix, we use kernel smoothing. We show consistency and obtain bounds on the rate of convergence.
A histogram sieve estimator of the drift function in Ito processes and some semimartingales is constructed. It is proved that the estimator is pointwise and L¹ consistent and its finite-dimensional distributions are asymptotically normal. Our approach extends the results of Leśkow and Różański (1989a).
We consider a failure hazard function, conditional on a time-independent covariate Z, given by . The baseline hazard function and the relative risk both belong to parametric families with . The covariate Z has an unknown density and is measured with an error through an additive error model U = Z + ε where ε is a random variable, independent from Z, with known density . We observe a n-sample (Xi, Di, Ui), i = 1, ..., n, where Xi is the minimum between the failure time and the censoring time, and...
The subject of this paper is to estimate adaptively the common probability density of independent, identically distributed random variables. The estimation is done at a fixed point , over the density functions that belong to the Sobolev class . We consider the adaptive problem setup, where the regularity parameter is unknown and varies in a given set . A sharp adaptive estimator is obtained, and the explicit asymptotical constant, associated to its rate of convergence is found.
The subject of this paper is to estimate adaptively the common probability density of n independent, identically distributed random variables. The estimation is done at a fixed point , over the density functions that belong to the Sobolev class Wn(β,L). We consider the adaptive problem setup, where the regularity parameter β is unknown and varies in a given set Bn. A sharp adaptive estimator is obtained, and the explicit asymptotical constant, associated to its rate of convergence is found.
Karhunen-Loève expansions of Gaussian processes have numerous applications in Probability and Statistics. Unfortunately the set of Gaussian processes with explicitly known spectrum and eigenfunctions is narrow. An interpretation of three historical examples enables us to understand the key role of the Laplacian. This allows us to extend the set of Gaussian processes for which a very explicit Karhunen-Loève expansion can be derived.
We present a method for estimating the edge of a two-dimensional bounded set, given a finite random set of points drawn from the interior. The estimator is based both on a Parzen-Rosenblatt kernel and extreme values of point processes. We give conditions for various kinds of convergence and asymptotic normality. We propose a method of reducing the negative bias and edge effects, illustrated by some simulations.
We present a method for estimating the edge of a two-dimensional bounded set, given a finite random set of points drawn from the interior. The estimator is based both on a Parzen-Rosenblatt kernel and extreme values of point processes. We give conditions for various kinds of convergence and asymptotic normality. We propose a method of reducing the negative bias and edge effects, illustrated by some simulations.
Gaussian semiparametric or local Whittle estimation of the memory parameter in standard long memory processes was proposed by Robinson [18]. This technique shows several advantages over the popular log- periodogram regression introduced by Geweke and Porter–Hudak [7]. In particular under milder assumptions than those needed in the log periodogram regression it is asymptotically more efficient. We analyse the asymptotic behaviour of the Gaussian semiparametric estimate of the memory parameter in...
We consider the problem of hypothesis testing within a monotone regression model. We propose a new test of the hypothesis : “” against the composite alternative : “” under the assumption that the true regression function is decreasing. The test statistic is based on the -distance between the isotonic estimator of and the function , since it is known that a properly centered and normalized version of this distance is asymptotically standard normally distributed under . We study the asymptotic...
We consider the problem of hypothesis testing within a monotone regression model. We propose a new test of the hypothesis H0: “ƒ = ƒ0” against the composite alternative Ha: “ƒ ≠ ƒ0” under the assumption that the true regression function f is decreasing. The test statistic is based on the -distance between the isotonic estimator of f and the function f0, since it is known that a properly centered and normalized version of this distance is asymptotically standard normally distributed under H0....
In a recent paper Fay and Philippe [ESAIM: PS 6 (2002) 239–258] proposed a goodness-of-fit test for long-range dependent processes which uses the logarithmic contrast as information measure. These authors established asymptotic normality under the null hypothesis and local alternatives. In the present note we extend these results and show that the corresponding test statistic is also normally distributed under fixed alternatives.