z-logo
Premium
Adaptive Deconvolution on the Non‐negative Real Line
Author(s) -
Mabon Gwennaëlle
Publication year - 2017
Publication title -
scandinavian journal of statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.359
H-Index - 65
eISSN - 1467-9469
pISSN - 0303-6898
DOI - 10.1111/sjos.12272
Subject(s) - deconvolution , estimator , mathematics , fourier transform , projection (relational algebra) , parametric statistics , algorithm , function (biology) , random variable , mathematical optimization , probability density function , statistics , mathematical analysis , evolutionary biology , biology
In this paper, we consider the problem of adaptive density or survival function estimation in an additive model defined by Z = X + Y with X independent of Y , when both random variables are non‐negative. This model is relevant, for instance, in reliability fields where we are interested in the failure time of a certain material that cannot be isolated from the system it belongs. Our goal is to recover the distribution of X (density or survival function) through n observations of Z , assuming that the distribution of Y is known. This issue can be seen as the classical statistical problem of deconvolution that has been tackled in many cases using Fourier‐type approaches. Nonetheless, in the present case, the random variables have the particularity to beR +supported. Knowing that, we propose a new angle of attack by building a projection estimator with an appropriate Laguerre basis. We present upper bounds on the mean squared integrated risk of our density and survival function estimators. We then describe a non‐parametric data‐driven strategy for selecting a relevant projection space. The procedures are illustrated with simulated data and compared with the performances of a more classical deconvolution setting using a Fourier approach. Our procedure achieves faster convergence rates than Fourier methods for estimating these functions.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here