Generalized bartlett correction

This paper provides a general method of modifying a statistic of interest in such a way that the distribution of the modified statistic can be approximated by an arbitrary reference distribution to an order of accuracy of O(n ^-1/2) or even O(n ^-1). The reference distribution is usually the asymptotic distribution of the original statistic. We prove that the multiplication of the statistic by a suitable stochastic correction improves the asymptotic approximation to its distribution. This paper extends the results of the closely related paper by Cordeiro and Ferrari (1991) to cope with several other statistical tests. The resulting expression for the adjustment factor requires knowledge of the Edgeworth-type expansion to order O(n^-1) for the distribution of the unmodified statistic. In practice its functional form involves some derivatives of the reference distribution. Certain difference between the cumulants of appropriate order in n of the unmodified statistic and those of its first-order approximation, and the unmodified statistic itself. Some applications are discussed.     

Efficient computation of location depth contours by methods of computational geometry

The concept of location depth was introduced as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. The depth contours form a collection of nested polygons, and the center of the deepest contour is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all bivariate depth contours in O(n ²) time and space, using topological sweep of the dual arrangement of lines. Once these contours are known, the location depth of any point can be computed in O(log² n) time with no additional preprocessing or in O(log n) time after O(n ²) preprocessing. We provide fast implementations of these algorithms to allow their use in everyday statistical practice.     

A Bayesian analysis for the Wilcoxon signed-rank statistic

A Bayesian analysis is provided for the Wilcoxon signed-rank statistic (T⁺). The Bayesian analysis is based on a sign-bias parameter φ on the (0, 1) interval. For the case of a uniform prior probability distribution for φ and for small sample sizes (i.e., 6 ? n ? 25), values for the statistic T⁺ are computed that enable probabilistic statements about φ. For larger sample sizes, approximations are provided for the asymptotic likelihood function P(T⁺|φ) as well as for the posterior distribution P(φ|T⁺). Power analyses are examined both for properly specified Gaussian sampling and for misspecified non Gaussian models. The new Bayesian metric has high power efficiency in the range of 0.9–1 relative to a standard t test when there is Gaussian sampling. But if the sampling is from an unknown and misspecified distribution, then the new statistic still has high power; in some cases, the power can be higher than the t test (especially for probability mixtures and heavy-tailed distributions). The new Bayesian analysis is thus a useful and robust method for applications where the usual parametric assumptions are questionable. These properties further enable a way to do a generic Bayesian analysis for many non Gaussian distributions that currently lack a formal Bayesian model.     

Improved Score Tests in Symmetric Linear Regression Models

The class of symmetric linear regression models has the normal linear regression model as a special case and includes several models that assume that the errors follow a symmetric distribution with longer-than-normal tails. An important member of this class is the t linear regression model, which is commonly used as an alternative to the usual normal regression model when the data contain extreme or outlying observations. In this article, we develop second-order asymptotic theory for score tests in this class of models. We obtain Bartlett-corrected score statistics for testing hypotheses on the regression and the dispersion parameters. The corrected statistics have chi-squared distributions with errors of order O(n ^?3/2), n being the sample size. The corrections represent an improvement over the corresponding original Rao's score statistics, which are chi-squared distributed up to errors of order O(n ^?1). Simulation results show that the corrected score tests perform much better than their uncorrected counterparts in samples of small or moderate size.     

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.     

Estimation and Inference for Linear Panel Data Models Under Misspecification When Both n and T are Large

This article considers fixed effects (FE) estimation for linear panel data models under possible model misspecification when both the number of individuals, n, and the number of time periods, T, are large. We first clarify the probability limit of the FE estimator and argue that this probability limit can be regarded as a pseudo-true parameter. We then establish the asymptotic distributional properties of the FE estimator around the pseudo-true parameter when n and T jointly go to infinity. Notably, we show that the FE estimator suffers from the incidental parameters bias of which the top order is O(T^{? 1}), and even after the incidental parameters bias is completely removed, the rate of convergence of the FE estimator depends on the degree of model misspecification and is either (nT)^{? 1/2} or n^{? 1/2}. Second, we establish asymptotically valid inference on the (pseudo-true) parameter. Specifically, we derive the asymptotic properties of the clustered covariance matrix (CCM) estimator and the cross-section bootstrap, and show that they are robust to model misspecification. This establishes a rigorous theoretical ground for the use of the CCM estimator and the cross-section bootstrap when model misspecification and the incidental parameters bias (in the coefficient estimate) are present. We conduct Monte Carlo simulations to evaluate the finite sample performance of the estimators and inference methods, together with a simple application to the unemployment dynamics in the U.S.     

Testing for normality in linear regression models

The importance of the normal distribution for fitting continuous data is well known. However, in many practical situations data distribution departs from normality. For example, the sample skewness and the sample kurtosis are far away from 0 and 3, respectively, which are nice properties of normal distributions. So, it is important to have formal tests of normality against any alternative. D'Agostino et al. [A suggestion for using powerful and informative tests of normality, Am. Statist. 44 (1990), pp. 316–321] review four procedures Z ²(g ₁), Z ²(g ₂), D and K ² for testing departure from normality. The first two of these procedures are tests of normality against departure due to skewness and kurtosis, respectively. The other two tests are omnibus tests. An alternative to the normal distribution is a class of skew-normal distributions (see [A. Azzalini, A class of distributions which includes the normal ones, Scand. J. Statist. 12 (1985), pp. 171–178]). In this paper, we obtain a score test (W) and a likelihood ratio test (LR) of goodness of fit of the normal regression model against the skew-normal family of regression models. It turns out that the score test is based on the sample skewness and is of very simple form. The performance of these six procedures, in terms of size and power, are compared using simulations. The level properties of the three statistics LR, W and Z ²(g ₁) are similar and close to the nominal level for moderate to large sample sizes. Also, their power properties are similar for small departure from normality due to skewness (γ₁≤0.4). Of these, the score test statistic has a very simple form and computationally much simpler than the other two statistics. The LR statistic, in general, has highest power, although it is computationally much complex as it requires estimates of the parameters under the normal model as well as those under the skew-normal model. So, the score test may be used to test for normality against small departure from normality due to skewness. Otherwise, the likelihood ratio statistic LR should be used as it detects general departure from normality (due to both skewness and kurtosis) with, in general, largest power.     

An extension of the Anderson–Darling k-sample test to arbitrary sample space partition sizes

In this paper we first show that the k-sample Anderson–Darling test is basically an average of Pearson statistics in 2?×?k contingency tables that are induced by observation-based partitions of the sample space. As an extension, we construct a family of rank test statistics, indexed by c?∈??, which is based on similarly constructed c?×?k partitions. An extensive simulation study, in which we compare the new test with others, suggests that generally very high powers are obtained with the new tests. Finally we propose a decomposition of the test statistic in interpretable components.     

Bias reduction of the maximum-likelihood estimator for a conditional Gaussian MA(1) model

In this paper, we consider an estimation for the unknown parameters of a conditional Gaussian MA(1) model. In the majority of cases, a maximum-likelihood estimator is chosen because the estimator is consistent. However, for small sample sizes the error is large, because the estimator has a bias of O(n^{? 1}). Therefore, we provide a bias of O(n^{? 1}) for the maximum-likelihood estimator for the conditional Gaussian MA(1) model. Moreover, we propose new estimators for the unknown parameters of the conditional Gaussian MA(1) model based on the bias of O(n^{? 1}). We investigate the properties of the bias, as well as the asymptotical variance of the maximum-likelihood estimators for the unknown parameters, by performing some simulations. Finally, we demonstrate the validity of the new estimators through this simulation study.     

Approximate and estimated saddlepoint approximations

Classical saddlepoint methods, which assume that the cumulant generating function is known, result in an approximation to the distribution that achieves an error of order O(n^?1). The authors give a general theorem to address the accuracy of saddlepoint approximations in which the cumulant generating function has been estimated or approximated. In practice, the resulting saddlepoint approximations are typically of the order O(n^?1/2). The authors give simulation results for small sample examples to compare estimated saddlepoint approximations.     

Robust test for means when population variances are unequal

We consider the problem of testing the equality of two population means when the population variances are not necessarily equal. We propose a Welch-type statistic, say T^* _c, based on Tiku!s ‘1967, 1980’ modified maximum likelihood estimators, and show that this statistic is robust to symmetric and moderately skew distributions. We investigate the power properties of the statistic T^* _c; T^* _c clearly seems to be more powerful than Yuen's ‘1974’ Welch-type robust statistic based on the trimmed sample means and the matching sample variances. We show that the analogous statistics based on the ‘adaptive’ robust estimators give misleading Type I errors. We generalize the results to testing linear contrasts among k population means     

The Pearson Score Statistic for Multinomial-Poisson Models

The score statistic S² is commonly used for general likelihood-based inference. Pearson’s Chi-squared statistic X² = ∑(O ? E)²/E is ubiquitous in contingency table inference. Because tests and confidence intervals based on S² have been shown to work well in practice and theory and because X² has such a simple and intuitively appealing form, it is of interest to know when S² is identical to X² and when X² has an approximate Chi-squared distribution. Toward these ends, this paper gives a simple proof that S² = X² for the broad class of multinomial-Poisson distributions when the alternative hypothesis is unrestricted in a certain sense. This paper also gives a sufficient condition under which the null distribution of the Pearson score statistic is approximately Chi-squared. Several examples illustrate the utility of the results and counter-examples highlight the importance of the sufficient conditions of the results.     

ON A SHARED ALLELE TEST OF RANDOM MATING

A simple random sample is observed from a population with a large number‘K’ of alleles, to test for random mating. Of n couples, n_ijkl have female genotype ij and male genotype kl (i, j, k, l{1,…, A‘}). The large contingency table is collapsed into three counts, n₀, n₁ and n₂ where n_p is the number of couples with s alleles in common (s = 0,1, 2). The counts are estimated by np?_o where n₀, is the estimated probability of a couple having s alleles in common under the hypothesis of random mating. The usual chi-square goodness of fit statistic X² compares observed (n_s) with expected (np?) over the three categories, s = 0,1,2. An empirical observation has suggested that X² is close to having a chi-square distribution with two degrees of freedom (X) despite a large number of parameters implicitly estimated in _e. This paper gives two theorems which show that x is indeed the approximate distribution of X² for large n and K₁“, provided that no allele type over-dominates the others.     

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 exponential inequalities for widely orthant-dependent random variables

ABSTRACT

In this work, we establish some exponential inequalities for widely orthant-dependent random variables. We also obtain the convergence rate O(n^{? 1/2}ln?^1/2n) for the strong law of large numbers for widely orthant-dependent random variables.     

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.     

Convergence Rates of Empirical Bayes Estimation for the Parameter of the Uniform Distribution U(0, θ) Under Random Censorship

ABSTRACT

This article considers the empirical Bayes estimation problem in the uniform distribution U(0, θ) with censored data. For the parameter θ, using the empirical Bayes (EB) approach, we propose an EB estimation of θ which possesses a rate of convergence can be arbitrarily close to O(n ^?1/2) when the historical samples are randomly censored from the right, where n is the number of historical sample. A sample and some simulation results are also presented.     

Convergence Rate of Strong Consistency of the Maximum Likelihood Estimator in Exponential Family Nonlinear Models

This article proposes some regularity conditions. On the basis of the proposed regularity conditions, we show the strong consistency of the maximum likelihood estimator (MLE) in exponential family nonlinear models (EFNM) and give its convergence rate. In an important case, we obtain the convergence rate O(n ^?1/2(log log n)^1/2)—the rate as that in the Law of the Iterated Logarithm (LIL) for iid partial sums and thus cannot be improved anymore.     

New results on the likelihood ratio and score tests for the von Mises distribution

In this paper, we derive Bartlett and Bartlett-type corrections [G.M. Cordeiro and S.L.P. Ferrari 1991, A modified score test statistic having chi-squared distribution to order n ^?1 , Biometrika 78 (1991), pp. 573–582] to improve the likelihood ratio and Rao's score statistics for testing the mean parameter and the concentration parameter in the von Mises distribution. Simple formulae are suggested for the corrections valid for small and large values of the concentration parameter that do not depend on the modified Bessel functions and can be useful in practical applications.     

Reduction of bias and skewness with applications to second order accuracy

Suppose [^(q)]{\widehat{\theta}} is an estimator of θ in \mathbbR{\mathbb{R}} that satisfies the central limit theorem. In general, inferences on θ are based on the central limit approximation. These have error O(n ^−1/2), where n is the sample size. Many unsuccessful attempts have been made at finding transformations which reduce this error to O(n ⁻¹). The variance stabilizing transformation fails to achieve this. We give alternative transformations that have bias O(n ⁻²), and skewness O(n ⁻³). Examples include the binomial, Poisson, chi-square and hypergeometric distributions.