High Frequency Asymptotics for Wavelet-Based Tests for Gaussianity and Isotropy on the Torus

We prove a CLT for skewness and kurtosis of the wavelets coefficients of a stationary field on the torus. The results are in the framework of the fixed-domain asymptotics, i.e. we refer to observations of a single field which is sampled at higher and higher frequencies. We consider also studentized statistics for the case of an unknown correlation structure. The results are motivated by the analysis of cosmological data or high-frequency financial data sets, with a particular interest towards testing for Gaussianity and isotropyComment: 33 pages, 3 figure

Localized spherical deconvolution

We provide a new algorithm for the treatment of the deconvolution problem on the sphere which combines the traditional SVD inversion with an appropriate thresholding technique in a well chosen new basis. We establish upper bounds for the behavior of our procedure for any $\mathbb {L}_p$ loss. It is important to emphasize the adaptation properties of our procedures with respect to the regularity (sparsity) of the object to recover as well as to inhomogeneous smoothness. We also perform a numerical study which proves that the procedure shows very promising properties in practice as well.Comment: Published in at http://dx.doi.org/10.1214/10-AOS858 the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org

Testing the isotropy of high energy cosmic rays using spherical needlets

For many decades, ultrahigh energy charged particles of unknown origin that can be observed from the ground have been a puzzle for particle physicists and astrophysicists. As an attempt to discriminate among several possible production scenarios, astrophysicists try to test the statistical isotropy of the directions of arrival of these cosmic rays. At the highest energies, they are supposed to point toward their sources with good accuracy. However, the observations are so rare that testing the distribution of such samples of directional data on the sphere is nontrivial. In this paper, we choose a nonparametric framework that makes weak hypotheses on the alternative distributions and allows in turn to detect various and possibly unexpected forms of anisotropy. We explore two particular procedures. Both are derived from fitting the empirical distribution with wavelet expansions of densities. We use the wavelet frame introduced by [SIAM J. Math. Anal. 38 (2006b) 574-594 (electronic)], the so-called needlets. The expansions are truncated at scale indices no larger than some ${J^{\star}}$, and the $L^p$ distances between those estimates and the null density are computed. One family of tests (called Multiple) is based on the idea of testing the distance from the null for each choice of $J=1,\ldots,{J^{\star}}$, whereas the so-called PlugIn approach is based on the single full ${J^{\star}}$ expansion, but with thresholded wavelet coefficients. We describe the practical implementation of these two procedures and compare them to other methods in the literature. As alternatives to isotropy, we consider both very simple toy models and more realistic nonisotropic models based on Physics-inspired simulations. The Monte Carlo study shows good performance of the Multiple test, even at moderate sample size, for a wide sample of alternative hypotheses and for different choices of the parameter ${J^{\star}}$. On the 69 most energetic events published by the Pierre Auger Collaboration, the needlet-based procedures suggest statistical evidence for anisotropy. Using several values for the parameters of the methods, our procedures yield $p$-values below 1%, but with uncontrolled multiplicity issues. The flexibility of this method and the possibility to modify it to take into account a large variety of extensions of the problem make it an interesting option for future investigation of the origin of ultrahigh energy cosmic rays.Comment: Published in at http://dx.doi.org/10.1214/12-AOAS619 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

Needlet algorithms for estimation in inverse problems

We provide a new algorithm for the treatment of inverse problems which combines the traditional SVD inversion with an appropriate thresholding technique in a well chosen new basis. Our goal is to devise an inversion procedure which has the advantages of localization and multiscale analysis of wavelet representations without losing the stability and computability of the SVD decompositions. To this end we utilize the construction of localized frames (termed "needlets") built upon the SVD bases. We consider two different situations: the "wavelet" scenario, where the needlets are assumed to behave similarly to true wavelets, and the "Jacobi-type" scenario, where we assume that the properties of the frame truly depend on the SVD basis at hand (hence on the operator). To illustrate each situation, we apply the estimation algorithm respectively to the deconvolution problem and to the Wicksell problem. In the latter case, where the SVD basis is a Jacobi polynomial basis, we show that our scheme is capable of achieving rates of convergence which are optimal in the $L_2$ case, we obtain interesting rates of convergence for other $L_p$ norms which are new (to the best of our knowledge) in the literature, and we also give a simulation study showing that the NEED-D estimator outperforms other standard algorithms in almost all situations.Comment: Published at http://dx.doi.org/10.1214/07-EJS014 in the Electronic Journal of Statistics (http://www.i-journals.org/ejs/) by the Institute of Mathematical Statistics (http://www.imstat.org

Inversion of noisy Radon transform by SVD based needlet

A linear method for inverting noisy observations of the Radon transform is developed based on decomposition systems (needlets) with rapidly decaying elements induced by the Radon transform SVD basis. Upper bounds of the risk of the estimator are established in $L^p$ ($1\le p\le \infty$) norms for functions with Besov space smoothness. A practical implementation of the method is given and several examples are discussed

NEED-VD: a second-generation wavelet algorithm for estimation in inverse problems

We provide a new algorithm for the treatment of inverse problems which combines the traditional SVD inversion with an appropriate thresholding technique in a well chosen new basis. Our goal is to devise an inversion procedure which has the advantages of localization and multiscale analysis of wavelet representations without losing the stability and computability of the SVD decompositions. To this end we utilize the construction of localized frames (termed ``needlets") built upon the SVD bases. We consider two different situations : the ``wavelet" scenario, where the needlets are assumed to behave similarly to true wavelets, and the ``Jacobi-type" scenario, where we assume that the properties of the frame truly depend on the SVD basis at hand (hence on the operator). To illustrate each situation, we apply the estimation algorithm respectively to the deconvolution problem and to the Wicksell problem. In the latter case, where the SVD basis is a Jacobi polynomial basis, we show that our scheme is capable of achieving rates of convergence which are optimal in the $L_2$ case, we obtain interesting rates of convergence for other $L_p$ norms which are new (to the best of our knowledge) in the literature, and we also give a simulation study showing that the NEED-VD estimator outperforms other standard algorithms in almost all situations

Replicant compression coding in Besov spaces

We present here a new proof of the theorem of Birman and Solomyak on the metric entropy of the unit ball of a Besov space $B^s_{\pi,q}$ on a regular domain of ${\mathbb R}^d.$ The result is: if s - d(1/π - 1/p)+ > 0, then the Kolmogorov metric entropy satisfies H(ε) ~ ε-d/s. This proof takes advantage of the representation of such spaces on wavelet type bases and extends the result to more general spaces. The lower bound is a consequence of very simple probabilistic exponential inequalities. To prove the upper bound, we provide a new universal coding based on a thresholding-quantizing procedure using replication

Quelques contributions à l'estimation fonctionnelle par méthodes d'ondelettes

PARIS-BIUSJ-Thèses (751052125) / SudocSudocFranceF

Regression in Random Design and Warped Wavelets

We consider the problem of estimating an unknown function f in a regression setting with random design. Instead of expanding the function on a regular wavelet basis, we expand it on the basis jk (G), j, k} warped with the design. This allows to perform a very stable and computable thresholding algorithm. We investigate the properties of this new basis. In particular, we prove that if the design has a property of Muckenhoupt type, this new basis has a behavior quite similar to a regular wavelet basis. This enables us to prove that the associated thresholding procedure achieves rates of convergence which have been proved to be minimax in the uniform design case