Pointwise consistency of the hermite series density estimate

The Hermite series estimate of a density f?L_p, p > 1, convergessin the mean square to f (x) for almost all x? |R, ifN (n) → ∞ and N (n) / n² → ) as n → ∞, where N is the number of the Hermite functions in the estimate while n is the number of observations. Moreover, the mean square and weak consistency are equivalent. For m times differentiable densities, the mean squares convergence rate is O(n^?(2m?1)/2m). Results for complete convergence are also given.     

Characterization of Wishart-Laplace distributions via Jordan algebra homomorphisms

For a real, Hermitian, or quaternion normal random matrix Y with mean zero, necessary and sufficient conditions for a quadratic form Q(Y) to have a Wishart-Laplace distribution (the distribution of the difference of two independent central Wishart W_p(m_i,Σ) random matrices) are given in terms of a certain Jordan algebra homomorphism ρ. Further, it is shown that {Q_k(Y)} is independent Laplace-Wishart if and only if in addition to the aforementioned conditions, the images ρ_k(Σ⁺) of the Moore-Penrose inverse Σ⁺ of Σ are mutually orthogonal: ρ_k(Σ⁺)ρ_?(Σ⁺)=0 for k≠?.     

A test of location for exchangeable multivariate normal data with unknown correlation

We consider the problem of testing whether the common mean of a single n-vector of multivariate normal random variables with known variance and unknown common correlation ρ is zero. We derive the standardized likelihood ratio test for known ρ and explore different ways of proceeding with ρ unknown. We evaluate the performance of the standardized statistic where ρ is replaced with an estimate of ρ and determine the critical value c_n that controls the type I error rate for the least favorable ρ in [0,1]. The constant c_n increases with n and this procedure has pathological behavior if ρ depends on n and ρ_n converges to zero at a certain rate. As an alternate approach, we replace ρ with the upper limit of a (1−β_n) confidence interval chosen so that c_n=c for all n. We determine β_n so that the type I error rate is exactly controlled for all ρ in [0,1]. We also investigate a simpler approach where we bound the type I error rate. The former method performs well for all n while the less powerful bound method may be a useful in some settings as a simple approach. The proposed tests can be used in different applications, including within-cluster resampling and combining exchangeable p-values.     

Asymptotic confidence intervals for Poisson regression

Let (X,Y) be a R^d×N₀-valued random vector where the conditional distribution of Y given X=x is a Poisson distribution with mean m(x). We estimate m by a local polynomial kernel estimate defined by maximizing a localized log-likelihood function. We use this estimate of m(x) to estimate the conditional distribution of Y given X=x by a corresponding Poisson distribution and to construct confidence intervals of level α of Y given X=x. Under mild regularity conditions on m(x) and on the distribution of X we show strong convergence of the integrated L₁ distance between Poisson distribution and its estimate. We also demonstrate that the corresponding confidence interval has asymptotically (i.e., for sample size tending to infinity) level α, and that the probability that the length of this confidence interval deviates from the optimal length by more than one converges to zero with the number of samples tending to infinity.     

On the connection between weak and strong convergencies in Cm

In this work wome connections are pursued between weak and strong convergence in the spaces C^m (m-times continuously differentiable functions on Rⁿ). Let f_n, f?C^{m + 1}, where n = 1, 2,…, and m is a nonnegative integer. Suppose that the sequence {f_n} converges to f relative to the weak topology of C^{m + 1}. It is shown that this implies the convergence of {f_n} to f with respect to the strong topology of C^m. Several corollaries to this theorem are established; among them is a sufficient condition for uniform convergence. A stronger result is shown to exist when the sequence constitutes an output sequence of a linear weakly continuous operator.     

Krengel-Lin decomposition for probability measures on hypergroups

A Markov operator P on a σ-finite measure space (X,Σ,m) with invariant measure m is said to have Krengel-Lin decomposition if L²(X)=E₀⊕L²(X,Σ_d) where E₀={f∈L²(X)∣‖Pⁿ(f)‖→0} and Σ_d is the deterministic σ-field of P. We consider convolution operators and we show that a measure λ on a hypergroup has Krengel-Lin decomposition if and only if the sequence converges to an idempotent or λ is scattered. We verify this condition for probabilities on Tortrat groups, on commutative hypergroups and on central hypergroups. We give a counter-example to show that the decomposition is not true for measures on discrete hypergroups.     

Adaptive estimation of the transition density of a particular hidden Markov chain

We study the following model of hidden Markov chain: with (X_i) a real-valued positive recurrent and stationary Markov chain, and (?_i)_1?i?n+1 a noise independent of the sequence (X_i) having a known distribution. We present an adaptive estimator of the transition density based on the quotient of a deconvolution estimator of the density of X_i and an estimator of the density of (X_i,X_i+1). These estimators are obtained by contrast minimization and model selection. We evaluate the L² risk and its rate of convergence for ordinary smooth and supersmooth noise with regard to ordinary smooth and supersmooth chains. Some examples are also detailed.     

Nonparametric estimation of mixed partial derivatives of a multivariate density

On the basis of a random sample of size n on an m-dimensional random vector X, this note proposes a class of estimators f_n^(p) of f^(p), where f is a density of X w.r.t. a σ-finite measure dominated by the Lebesgue measure on R^m, p = (p₁,…,p_m), p_j ≥ 0, fixed integers, and for x = (x₁,…,x_m) in R^m, f^(p)(x) = ?^p₁+…+p_m f(x)/(?^p₁x₁ … ?^p_mx_m). Asymptotic unbiasedness as well as both almost sure and mean square consistencies of f_n^(p) are examined. Further, a necessary and sufficient condition for uniform asymptotic unbisedness or for uniform mean square consistency of f_n^(p) is given. Finally, applications of estimators of this note to certain statistical problems are pointed out.     

On Bayes estimators with uniform priors on spheres and their comparative performance with maximum likelihood estimators for estimating bounded multivariate normal means

For independently distributed observables: X_i∼N(θ_i,σ²),i=1,…,p, we consider estimating the vector θ=(θ₁,…,θ_p)^′ with loss ‖d−θ‖² under the constraint , with known τ₁,…,τ_p,σ²,m. In comparing the risk performance of Bayesian estimators δ_α associated with uniform priors on spheres of radius α centered at (τ₁,…,τ_p) with that of the maximum likelihood estimator , we make use of Stein’s unbiased estimate of risk technique, Karlin’s sign change arguments, and a conditional risk analysis to obtain for a fixed (m,p) necessary and sufficient conditions on α for δ_α to dominate . Large sample determinations of these conditions are provided. Both cases where all such δ_α’s and cases where no such δ_α’s dominate are elicited. We establish, as a particular case, that the boundary uniform Bayes estimator δ_m dominates if and only if m≤k(p) with , improving on the previously known sufficient condition of Marchand and Perron (2001) [3] for which . Finally, we improve upon a universal dominance condition due to Marchand and Perron, by establishing that all Bayesian estimators δ_π with π spherically symmetric and supported on the parameter space dominate whenever m≤c₁(p) with .     

Strong law for the bootstrap

Let X₁, X₂, X₃, … be i.i.d. r.v. with E|X₁| < ∞, E X₁ = μ. Given a realization X = (X₁,X₂,…) and integers n and m, construct Y_n,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution $\text{P}{}^1\text{(Y}{}_{\mathrm{n,i}}\text{= X}{}_{\mathrm{j}}\text{) =}\text{1}\text{n}$ for 1 ? j ? n. ($\text{P}{}^1$ denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X₁ are given to ensure the almost sure convergence of $\text{(}\text{1}\text{m}\text{)Σ}{}^{\mathrm{m}}{}_{\mathrm{i=1}}\text{Y}{}_{\mathrm{n,i}}$ toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).     

Asymptotic expansions for distributions of latent roots in multivariate analysis

Asymptotic expansions are given for the distributions of latent roots of matrices in three multivariate situations. The distribution of the roots of the matrix S₁(S₁ + S₂)^?1, where S₁ is $\text{W}{}_{\mathrm{<mtext>m</mtext>}}\text{(n}{}_1\text{, Σ, Ω)}$ and S₂ is W_m(n₂, Σ), is studied in detail and asymptotic series for the distribution are obtained which are valid for some or all of the roots of the noncentrality matrix Ω large. These expansions are obtained using partial-differential equations satisfied by the distribution. Asymptotic series are also obtained for the distributions of the roots of n^?1S, where S in W_m(n, Σ), for large n, and S₁S₂^?1, where S₁ is W_m(n₁, Σ) and S₂ is W_m(n₂, Σ), for large n₁ + n₂.     

The increment ratio statistic

We introduce a new statistic written as a sum of certain ratios of second-order increments of partial sums process of observations, which we call the increment ratio (IR) statistic. The IR statistic can be used for testing nonparametric hypotheses for d-integrated () behavior of time series X_t, including short memory (d=0), (stationary) long-memory and unit roots (d=1). If S_n behaves asymptotically as an (integrated) fractional Brownian motion with parameter , the IR statistic converges to a monotone function Λ(d) of as both the sample size N and the window parameter m increase so that N/m→∞. For Gaussian observations X_t, we obtain a rate of decay of the bias EIR-Λ(d) and a central limit theorem (N/m)^1/2(IR-EIR)→N(0,σ²(d)), in the region . Graphs of the functions Λ(d) and σ(d) are included. A simulation study shows that the IR test for short memory (d=0) against stationary long-memory alternatives has good size and power properties and is robust against changes in mean, slowly varying trends and nonstationarities. We apply this statistic to sequences of squares of returns on financial assets and obtain a nuanced picture of the presence of long-memory in asset price volatility.     

The use of the tetrachoric series for evaluating multivariate normal probabilities

The tetrachoric series is a technique for evaluating multivariate normal probabilities frequently cited in the statistical literature. In this paper we have examined the convergence properties of the tetrachoric series and have established the following. For orthant probabilities, the tetrachoric series converges if $\text{|;?}{}_{\mathrm{ij}}\text{|; <}\text{1}\text{(k ? 1)}$, 1 ≤ i < j ≤ k, where ?_ij are the correlation coefficients of a k-variate normal distribution. The tetrachoric series for orthant probabilities diverges whenever k is even and $\text{?}{}_{\mathrm{ij}}\text{>}\text{1}\text{(k ? 1)}$ or k is odd and $\text{?}{}_{\mathrm{ij}}\text{>}\text{1}\text{(k ? 2)}$, 1 ≤ i < j ≤ k. Other specific results concerning the convergence or divergence of this series are also given. The principal point is that the assertion that the tetrachoric series converges for all k ≥ 2 and all ?_ij such that the correlation matrix is positive definite is false.     

Robustness of A-optimal designs

Suppose that Y=(Y_i) is a normal random vector with mean Xb and covariance σ²I_n, where b is a p-dimensional vector (b_j),X=(X_ij) is an n×p matrix. A-optimal designs X are chosen from the traditional set D of A-optimal designs for ρ=0 such that X is still A-optimal in D when the components Y_i are dependent, i.e., for i≠i′, the covariance of Y_i,Y_i^′ is ρ with ρ≠0. Such designs depend on the sign of ρ. The general results are applied to X=(X_ij), where X_ij∈{-1,1}; this corresponds to a factorial design with -1,1 representing low level or high level respectively, or corresponds to a weighing design with -1,1 representing an object j with weight b_j being weighed on the left and right of a chemical balance respectively.     

Optimum two level fractional factorial plans for model identification and discrimination

Model identification and discrimination are two major statistical challenges. In this paper we consider a set of models M_k for factorial experiments with the parameters representing the general mean, main effects, and only k out of all two-factor interactions. We consider the class D of all fractional factorial plans with the same number of runs having the ability to identify all the models in M_k, i.e., the full estimation capacity.The fractional factorial plans in D with the full estimation capacity for k?2 are able to discriminate between models in M_u for u?k^*, where k^*=(k/2) when k is even, k^*=((k-1)/2) when k is odd. We obtain fractional factorial plans in D satisfying the six optimality criterion functions AD, AT, AMCR, GD, GT, and GMCR for 2^m factorial experiments when m=4 and 5. Both single stage and multi-stage (hierarchical) designs are given. Some results on estimation capacity of a fractional factorial plan for identifying models in M_k are also given. Our designs D4.1 and D10 stand out in their performances relative to the designs given in Li and Nachtsheim [Model-robust factorial designs, Technometrics 42(4) (2000) 345-352.] for m=4 and 5 with respect to the criterion functions AD, AT, AMCR, GD, GT, and GMCR. Our design D4.2 stands out in its performance relative the Li-Nachtsheim design for m=4 with respect to the four criterion functions AT, AMCR, GT, and GMCR. However, the Li-Nachtsheim design for m=4 stands out in its performance relative to our design D4.2 with respect to the criterion functions AD and GD. Our design D14 does have the full estimation capacity for k=5 but the twelve run Li-Nachtsheim design does not have the full estimation capacity for k=5.     

Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property

We develop a new one-to-one correspondence between a two-dimensional (m × n, k, ρ) optical orthogonal code (2-D (m × n, k, ρ)-OOC) with AM-OPPTS (at most one-pulse per time slot) property and a certain combinatorial subject, called an n-cyclic holey packing of type m ⁿ . By this link, an upper bound on the size of a 2-D (m × n, k, ρ)-OOC with AM-OPPTS property is derived. Afterwards, we employ combinatorial methods to construct infinitely many 2-D (m × n, k, 1)-OOCs with AM-OPPTS property, whose existence was previously unknown. All these constructions meet the upper bounds with equality and are thus optimal.     

More on the inadmissibility of step-up

Cohen and Sackrowitz [Characterization of Bayes procedures for multiple endpoint problems and inadmissibility of the step-up procedure, Ann. Statist. 33 (2005) 145-158] proved that the step-up multiple testing procedure is inadmissible for a multivariate normal model with unknown mean vector and known intraclass covariance matrix. The hypotheses tested are each mean is zero vs. each mean is positive. The risk function is a 2×1 vector where one component is average size and the other component is one minus average power. In this paper, we extend the inadmissibility result to several different models, to two-sided alternatives, and to other risk functions. The models include one-parameter exponential families, independent t-variables, independent χ²-variables, t-tests arising from the analysis of variance, and t-tests arising from testing treatments against a control. The additional risk functions are linear combinations where one component is the false discovery rate (FDR).     

On the power of Wilks' U-test for MANOVA

Let V₁,…, V_m, W₁,…, W_n be independent p × 1 random vectors having multivariate normal distributions with common nonsingular covariance matrix Σ and with EW_α = 0, α = 1,…, n. In this canonical form of the multivariate linear model, the problem is to test H: EV_αazμ_α = 0, α = 1,…, m vs K: not H. It is shown that when the rank of the noncentrality matrix (μ₁…μ_m) Σ^?1 (μ₁…μ_m) is one, the power of Wilks' U-test (the likelihood ratio test) strictly decreases with the dimension p and the hypothesis degrees of freedom m. This generalizes results known for the noncentral F-test in the univariate case.