On the Breakdown Properties of Some Multivariate M‐Functionals*

Abstract. For probability distributions on ? ^q, a detailed study of the breakdown properties of some multivariate M‐functionals related to Tyler's [Ann. Statist. 15 (1987) 234] ‘distribution‐free’ M‐functional of scatter is given. These include a symmetrized version of Tyler's M‐functional of scatter, and the multivariate t M‐functionals of location and scatter. It is shown that for ‘smooth’ distributions, the (contamination) breakdown point of Tyler's M‐functional of scatter and of its symmetrized version are 1/q and , respectively. For the multivariate t M‐functional which arises from the maximum likelihood estimate for the parameters of an elliptical t distribution on ν ≥ 1 degrees of freedom the breakdown point at smooth distributions is 1/( q + ν). Breakdown points are also obtained for general distributions, including empirical distributions. Finally, the sources of breakdown are investigated. It turns out that breakdown can only be caused by contaminating distributions that are concentrated near low‐dimensional subspaces.     

Asymptotic Tail Properties of Student's t-Distribution

We investigate the asymptotic behavior of the probability density function (pdf) and the cumulative distribution function (cdf) of Student's t-distribution with ν > 0 degrees of freedom (t _ν for short) for ν tending to infinity when the argument x = x _ν of the pdf (cdf) depends on ν and tends to ± ∞ (?∞). To this end, we consider the ratio of the pdf's (cdf's) of the t _ν- and the standard normal distribution. Depending on the choice of the argument x _ν, the pdf-ratio (cdf-ratio) tends to 1, a fixed value greater than 1, or to ∞. As a byproduct, we obtain a result for Mill' ratio when x _ν → ?∞.     

Zur abschätzung von lösungen linearer integralgleichungen mit hilfe der monte-carlo-methode

Let X₁, X₂, … be i.i.d.r.v. and write (X₁+…X_n?A_n)/B_n?F_n, where B_n >0.A_nER₁, n≥1. It is known that solely one–sided asymptotic assumptions imposed on F_n imply F_n0. In the present note we show that stronger one–sided assumptions lead even to the existence of EX₁ ³ so that the BERRY-ESSEEN inequalities hold true.     

Empirical Bayes testing for guarantee lifetime: Non identical components case

This article considers an empirical Bayes testing problem for the guarantee lifetime in the two-parameter exponential distributions with non identical components. We study a method of constructing empirical Bayes tests under a class of unknown prior distributions for the sequence of the component testing problems. The asymptotic optimality of the sequence of empirical Bayes tests is studied. Under certain regularity conditions on the prior distributions, it is shown that the sequence of the constructed empirical Bayes tests is asymptotically optimal, and the associated sequence of regrets converges to zero at a rate O(n^{? 1 + 1/[2(r + α) + 1]}) for some integer r ? 0 and 0 ? α ? 1 depending on the unknown prior distributions, where n is the number of past data available when the (n + 1)st component testing problem is considered.     

Estimation of the location of a 0-type or ∞-type singularity by Poisson observations

We consider an inhomogeneous Poisson process X on [0, T]. The intensity function of X is supposed to be strictly positive and smooth on [0, T] except at the point θ, in which it has either a 0-type singularity (tends to 0 like |x| ^p , p∈(0, 1)), or an ∞-type singularity (tends to ∞ like |x| ^p , p∈(?1, 0)). We suppose that we know the shape of the intensity function, but not the location of the singularity. We consider the problem of estimation of this location (shift) parameter θ based on n observations of the process X. We study the Bayesian estimators and, in the case p>0, the maximum-likelihood estimator. We show that these estimators are consistent, their rate of convergence is n ^1/(p+1), they have different limit distributions, and the Bayesian estimators are asymptotically efficient.     

EMPIRICAL LIKELIHOOD‐BASED INFERENCES FOR PARTIALLY LINEAR MODELS WITH MISSING COVARIATES

This paper considers statistical inference for partially linear models Y = X ^? β +ν(Z) +? when the linear covariate X is missing with missing probability π depending upon (Y, Z). We propose empirical likelihood‐based statistics to construct confidence regions for β and ν(z). The resulting empirical likelihood ratio statistics are shown to be asymptotically chi‐squared‐distributed. The finite‐sample performance of the proposed statistics is assessed by simulation experiments. The proposed methods are applied to a dataset from an AIDS clinical trial.     

Accurate inference for scale and location families

A great deal of inference in statistics is based on making the approximation that a statistic is normally distributed. The error in doing so is generally O(n^?1/2), where n is the sample size and can be considered when the distribution of the statistic is heavily biased or skewed. This note shows how one may reduce the error to O(n^?(j+1)/2), where j is a given integer. The case considered is when the statistic is the mean of the sample values of a continuous distribution with a scale or location change after the sample has undergone an initial transformation, which may depend on an unknown parameter. The transformation corresponding to Fisher's score function yields an asymptotically efficient procedure.     

Empirical Bayes Testing for the Mean Lifetime of Exponential Distributions: Unequal Sample Sizes Case

This paper deals with an empirical Bayes testing problem for the mean lifetimes of exponential distributions with unequal sample sizes. We study a method to construct empirical Bayes tests {δ* _nl + 1,n }^∞ _n = 1 for the sequence of the testing problems. The asymptotic optimality of {δ* _nl + 1,n }^∞ _n = 1 is studied. It is shown that the sequence of empirical Bayes tests {δ* _nl + 1,n }^∞ _n = 1 is asymptotically optimal, and its associated sequence of regrets converges to zero at a rate (ln n)^4M?1/n, where M is an upper bound of sample sizes.     

Modified kolmogorov-smirnov tests of goodness of fit

The Kolmogorov-Smirnov (K–S) one-sided and two-sided tests of goodness of fit based on the test statistics D⁺ _n D^? _n and D_n are equivalent to tests based on taking the cumulative probability of the i–th order statistic of a sample of size n to be (i–.5)/n. Modified test statistics C⁺ _n, C^? _n and C_n are obtained by taking the cumulative probability to be i/(n+l). More generally, the cumula-tive probability may be taken to be (i?δ)/(n+l?2δ), as suggested by Blom (1958), where 0 less than or equal δ less than or equal .5. Critical values of the test statis-tics can be found by interpolating inversely in tables of the proba-bility integrals obtained by setting a=l/(n+l?2δ) in an expression given by Pyke (1959). Critical values for the D's (corresponding to δ=.5) have been tabulated to 5DP by Miller (1956) for n=1(1)100. The authors have made analogous tabulations for the C's (corresponding to δ=0) [previously tabulated by Durbin (1969) for n=1(1)60(2)100] and for the test statistics E⁺ _n, E^? _n and E_n corresponding to δ f.3. They have also made a Monte Carlo comparison of the power of the modified tests with that of the K–S test for several hypothetical distributions. In a number of cases, the power of the modified tests is greater than that of the K–S test, especially when the standard deviation is greater under the alternative than under the null hypo-thesis.     

On the asymptotic expectation and variance of the number of boundary crossings

Let X₁,X₂,… be independent and identically distributed nonnegative random variables with mean μ, and let S_n = X₁ + … + X_n. For each λ > 0 and each n ≥ 1, let A_n be the interval [λn^Y, ∞), where γ > 1 is a constant. The number of times that S_n is in A_n is denoted by N. As λ tends to zero, the asymtotic behavior of N is studied. Specifically under suitable conditions, the expectation of N is shown to be (μλ^?1)^β + o(λ^?β/2 where β = 1/(γ-1) and the variance of N is shown to be (μλ^?1)^β(βμ¹)²σ² + o(λ^?β) where σ² is the variance of X_n.     

The asymptotic behavior of monotone percentile regression estimates

The least-absolute-deviation estimate of a monotone regression function on an interval has been studied in the literature. If the observation points become dense in the interval, the almost sure rate of convergence has been shown to be O(n^1/4). Applying the techniques used by Brunk (1970, Nonparametric, Techniques in Statistical Inference. Cambridge Univ. Press), the asymptotic distribution of the l₁ estimator at a point is obtained. If the underlying regression function has positive slope at the point, the rate of convergence is seen to be O(n^1/3). Monotone percentile regression estimates are also considered.     

On the uniformly asymptotic normality of frequency polygons for ψ-mixing samples

The uniformly asymptotical normality of frequency polygons for ψ-mixing samples is investigated under the given conditions. Moreover, the corresponding rate of convergence is also derived, which is nearly O(n^{? 1/6}) for the given assumptions.     

On the Rate of Convergence of STSD Extremes

Denote M _n the largest of n independent STSD variables. This article shows the rate of convergence of (M _n  ? b _n )/a _n to the extreme value distribution exp (?e ^?x ) which is characterized by the supremum metric.     

Computationally efficient classes of higher-order kernel functions

Classes of higher-order kernels for estimation of a probability density are constructed by iterating the twicing procedure. Given a kernel K of order l, we build a family of kernels K_m of orders l(m + 1) with the attractive property that their Fourier transforms are simply 1 — {1 —$(.)}^m+1, where ? is the Fourier transform of K. These families of higher-order kernels are well suited when the fast Fourier transform is used to speed up the calculation of the kernel estimate or the least-squares cross-validation procedure for selection of the window width. We also compare the theoretical performance of the optimal polynomial-based kernels with that of the iterative twicing kernels constructed from some popular second-order kernels.     

Polynomial Histograms for Multivariate Density and Mode Estimation

Abstract. We consider the problem of efficiently estimating multivariate densities and their modes for moderate dimensions and an abundance of data. We propose polynomial histograms to solve this estimation problem. We present first‐ and second‐order polynomial histogram estimators for a general d‐dimensional setting. Our theoretical results include pointwise bias and variance of these estimators, their asymptotic mean integrated square error (AMISE), and optimal binwidth. The asymptotic performance of the first‐order estimator matches that of the kernel density estimator, while the second order has the faster rate of O(n^?6/(d+6)). For a bivariate normal setting, we present explicit expressions for the AMISE constants which show the much larger binwidths of the second order estimator and hence also more efficient computations of multivariate densities. We apply polynomial histogram estimators to real data from biotechnology and find the number and location of modes in such data.     

Computing factors for exact two-sided tolerance limits for a normal distribution

A self-contained FORTRAN subroutine is provided which computes factors for Wald-Wolfowitz type tolerance limits allowing arbitrary combinations of sample size n and degrees of freedom ν. The exact calculations from our program reveal inadequacies of two existing approximations, especially when ν ? n. Numerous applications where ν ≠ n ? 1 are cited; two of these are discussed and illustrated.     

The inverse gaussian distribution: Some properties and characterizations

This article presents some structural properties of the inverse Gaussian distribution, together with several new characterizations based on constancy of regression of suitable functions on the sum of n independent identically distributed random variables. A decomposition of the statistic λσ (X^?1_i?X^?1) into n - 1 independent chi-squared random variables, each with one degree of freedom, is given when n is of the form 2^r.     

Confidence intervals for the length of a vector mean

Suppose we have a random sample of size n from a multivariate distribution with finite moments, for which a parametric form is not available. We wish to obtain a confidence interval (CI) for the length of its mean. The usual method is to Studentize. The resulting CIs are not exact. The error in their nominal levels is ～n ^?1/2 and ～n ^?1 in the one-sided and two-sided cases. We show how to reduce these errors to ～n ^?3/2 and ～n ^?2.