A self-validating numerical method for computation of central and non-central F probabilities and percentiles

A self-validating numerical method based on interval analysis for the computation of central and non-central F probabilities and percentiles is reported. The major advantage of this approach is that there are guaranteed error bounds associated with the computed values (or intervals), i.e. the computed values satisfy the user-specified accuracy requirements. The methodology reported in this paper can be adapted to approximate the probabilities and percentiles for other commonly used distribution functions.     

Multiple Comparisons Among Mean Vectors When the Dimension is Larger Than the Total Sample Size

We consider pairwise multiple comparisons and multiple comparisons with a control among mean vectors for high-dimensional data under the multivariate normality. For such cases, the statistics based on the Dempster trace criterion are given, and also their approximate upper percentiles are derived by using the Bonferroni’s inequality. Finally, the accuracy of their approximate values is evaluated by Monte Carlo simulation.     

Modified Normal-based Approximation to the Percentiles of Linear Combination of Independent Random Variables with Applications

A modified normal-based approximation for calculating the percentiles of a linear combination of independent random variables is proposed. This approximation is applicable in situations where expectations and percentiles of the individual random variables can be readily obtained. The merits of the approximation are evaluated for the chi-square and beta distributions using Monte Carlo simulation. An approximation to the percentiles of the ratio of two independent random variables is also given. Solutions based on the approximations are given for some classical problems such as interval estimation of the normal coefficient of variation, survival probability, the difference between or the ratio of two binomial proportions, and for some other problems. Furthermore, approximation to the percentiles of a doubly noncentral F distribution is also given. For all the problems considered, the approximation provides simple satisfactory solutions. Two examples are given to show applications of the approximation.     

Closed-Form Approximation for the AOQL of Attributes Acceptance Sample Plans

We derive upper and lower bounds at the point at which the average outgoing quality limit (AOQL) of an attributes acceptance sampling plan is achieved. Using a simple average of these bounds to approximate the ordinate of the AOQL, we develop an accurate, closed-form approximation to the AOQL. The bounds and approximation show how the parameters of a sampling plan affect the AOQL and can be used to study the behavior of the AOQL and other measures of the plan's performance.     

Simultaneous confidence bands and regions for log-location-scale distributions with censored data

In many areas of application, especially life testing and reliability, it is often of interest to estimate an unknown cumulative distribution (cdf). A simultaneous confidence band (SCB) of the cdf can be used to assess the statistical uncertainty of the estimated cdf over the entire range of the distribution. Cheng and Iles [1983. Confidence bands for cumulative distribution functions of continuous random variables. Technometrics 25 (1), 77–86] presented an approach to construct an SCB for the cdf of a continuous random variable. For the log-location-scale family of distributions, they gave explicit forms for the upper and lower boundaries of the SCB based on expected information. In this article, we extend the work of Cheng and Iles [1983. Confidence bands for cumulative distribution functions of continuous random variables. Technometrics 25 (1), 77–86] in several directions. We study the SCBs based on local information, expected information, and estimated expected information for both the “cdf method” and the “quantile method.” We also study the effects of exceptional cases where a simple SCB does not exist. We describe calibration of the bands to provide exact coverage for complete data and type II censoring and better approximate coverage for other kinds of censoring. We also discuss how to extend these procedures to regression analysis.     

Comments on zacks' recent paper on one-sided cusum procedures

The goal of this paper is to propose approximations for the cdf and the inverse cdf of the normal sample median. The presented methodology, which seems to not have been investigated before, suggests to fit the normal sample median distribution with a symmetrical Johnson S_U: distribution having ap-proximatively the same second and fourth moments. The results obtained with this approach, compared with the normal approximation, are very impressive, especially for the inverse cdf. One important application of the inverse cdf approximation of the normal sample median is the computation of accurate α‐level median/range control limits for any value of α (and not only for the popular value α = 0.0027). This paper can be also viewed as an homage to Professor N.L. Johnson's works by making a link between two of his major papers.     

On group sequential tests for data in unequally sized groups and with unknown variance

We present a method to generalise the scope of application of group sequential tests designed for equally sized groups of normal observations with known variance. Preserving the significance levels against which standardised statistics are compared leads to tests for unequally grouped data which maintain Type I error probabilities to a high degree of accuracy. The same approach can be followed when observations have unknown variance by setting critical values for Studentised statistics at percentiles of the appropriate t-distributions. This significance level approach is equally applicable to group sequential one-sided tests and two-sided tests, possibly with early stopping permitted to accept the null hypothesis. In applications to equivalence testing, tests are required to maintain a specified power, rather than Type I error rate: such tests can be constructed by defining the standardised test statistics used in the significance level approach with respect to appropriately chosen hypotheses.     

Projection de hájek et polynômes de bernstein

Under the hypothesis of white noise, the authors derive the explicit form of the asymptotic representation of linear rank statistics resulting from Hájek's (1968) celebrated projection lemma for linear rank statistics in the so‐called approximate score case. This representation based on Bernstein polynomials is better, in the quadratic mean sense, than the traditional one due to Hájek (1961, 1962). The polynomial representation allows for a new derivation of classical asymptotic results (asymptotic normality, Berry‐Essten bounds). Moreover, a simulation study shows that the quality of the polynomial approximation to the exact finite‐sample distributions of rank statistics is sizeably better than that resulting from the traditional approach.     

A new approximation for the distribution of the difference of two t-variables

A mixture representation for the distribution of the difference of two independent t-varlables is provided to approximate the probabilities and percentiles The mixture of normal and standardized t is found to be quite suitable in terms of the accuracy and simplicity as it compares favorably to the best known approximation namelyt that due to Ghosh (1975). The idea of the mixture distribution is also extended to provide an approximation to the distribution of a linear combination of independent t-variables which provides an approximation to the Behrens-Fisher distribution in particular.     

Maximum Entropy Approximations for Asymptotic Distributions of Smooth Functions of Sample Means

Abstract. We propose an information‐theoretic approach to approximate asymptotic distributions of statistics using the maximum entropy (ME) densities. Conventional ME densities are typically defined on a bounded support. For distributions defined on unbounded supports, we use an asymptotically negligible dampening function for the ME approximation such that it is well defined on the real line. We establish order n^?1 asymptotic equivalence between the proposed method and the classical Edgeworth approximation for general statistics that are smooth functions of sample means. Numerical examples are provided to demonstrate the efficacy of the proposed method.     

ESTIMATION OF A DISTRIBUTION FUNCTION DOMINATING STOCHASTICALLY A KNOWN DISTRIBUTION FUNCTION

This paper considers the problem of estimating a cumulative distribution function (cdf), when it is known a priori to dominate a known cdf. The estimator considered is obtained by adjusting the empirical cdf using the prior information. This adjusted estimator is shown to be consistent, its limiting distribution is found, and its mean squared error (MSE) is shown to be smaller than the MSE of the empirical cdf. Its asymptotic efficiency (compared to the empirical cdf) is also found.     

Optimal bounds on l-statistics based on samples drawn with replacement from finite populations

We describe a method of establishing optimal bounds on the expectations of arbitrary linear combinations of order statistics based on iid samples drawn with replacement from finite populations of a fixed size. The bounds are expressed in terms of the population size, mean, central absolute moments, and coefficients of the combination. The bounds are precisely determined for the trimmed means and their differences, and single order statistics and their differences in particular. We also show that with increase in population size, our bounds approach the respective universal ones for arbitrary iid samples.     

A comparison of efficient approximations for a weighted sum of chi-squared random variables

In many applications, the cumulative distribution function (cdf) \(F_{Q_N}\) of a positively weighted sum of N i.i.d. chi-squared random variables \(Q_N\) is required. Although there is no known closed-form solution for \(F_{Q_N}\), there are many good approximations. When computational efficiency is not an issue, Imhof’s method provides a good solution. However, when both the accuracy of the approximation and the speed of its computation are a concern, there is no clear preferred choice. Previous comparisons between approximate methods could be considered insufficient. Furthermore, in streaming data applications where the computation needs to be both sequential and efficient, only a few of the available methods may be suitable. Streaming data problems are becoming ubiquitous and provide the motivation for this paper. We develop a framework to enable a much more extensive comparison between approximate methods for computing the cdf of weighted sums of an arbitrary random variable. Utilising this framework, a new and comprehensive analysis of four efficient approximate methods for computing \(F_{Q_N}\) is performed. This analysis procedure is much more thorough and statistically valid than previous approaches described in the literature. A surprising result of this analysis is that the accuracy of these approximate methods increases with N.     

Estimation of error rate in multiple group logistic discrimination. the approximate leaving-one-out method

We present an approximate leaving-one-out technique for estimating the error rate in logistic discrimination. The new measure is based on the one-step approximation of a(i), the maximum likelihood estimate of the parameter vector based on the sample without the ith case. Some inequalities between the resubstitution error rate, the approximate and exact leaving-one-out error rates for the multiple group logistic model are investigated. Monte-Carlo simulations assess the adequacy of the approximate leaving-one-out method as an estimate of the actual error rate. The usefulness of this approach is demonstrated by means of two medical examples.     

Generalized linear models with covariate measurement error and unknown link function

Generalized linear models (GLMs) with error-in-covariates are useful in epidemiological research due to the ubiquity of non-normal response variables and inaccurate measurements. The link function in GLMs is chosen by the user depending on the type of response variable, frequently the canonical link function. When covariates are measured with error, incorrect inference can be made, compounded by incorrect choice of link function. In this article we propose three flexible approaches for handling error-in-covariates and estimating an unknown link simultaneously. The first approach uses a fully Bayesian (FB) hierarchical framework, treating the unobserved covariate as a latent variable to be integrated over. The second and third are approximate Bayesian approach which use a Laplace approximation to marginalize the variables measured with error out of the likelihood. Our simulation results show support that the FB approach is often a better choice than the approximate Bayesian approaches for adjusting for measurement error, particularly when the measurement error distribution is misspecified. These approaches are demonstrated on an application with binary response.     

Testing the equality of several multivariate normal mean vectors under heteroscedasticity: A fiducial approach and an approximate test

We consider the problem of testing the equality of several multivariate normal mean vectors under heteroscedasticity. We first construct a fiducial confidence region (FCR) for the differences between normal mean vectors and we then propose a fiducial test for comparing mean vectors by inverting the FCR. We also propose a simple approximate test that is based on a modification of the χ² approximation. This simple test avoids the complications of simulation-based inference methods. We show that the proposed fiducial test has correct type one error rate asymptotically. We compare the proposed fiducial and approximate tests with the parametric bootstrap test in terms of controlling the type one error rate via an extensive simulation study. Our simulation results show that the proposed fiducial and approximate tests control the type one error rate, while there are cases that the parametric bootstrap test is out of control. We also discuss the power performance of the tests. Finally, we illustrate with a real example how our proposed methods are applicable in analyzing repeated measure designs including a single grouping variable.     

Half-normal approximation for statistics of symmetric simple random walk

In 2013, Döbler used Stein’s method to obtain the uniform bounds in half-normal approximation for three statistics of a symmetric simple random walk; the maximum value, the number of returns to the origin and the number of sign changes up to a given time n. In this paper, we give the non-uniform bounds for these statistics by using Stein’s method and the concentration inequality approach.     

Exact distribution of a linear combination of a variable and order statistics from the other two variables of a trivariate elliptical random vector as a mixture of skew-elliptical distributions

We consider here a univariate skew-elliptical distribution, which is a special case of the unified multivariate skew-elliptical distribution studied recently by Arellano-Valle and Azzalini (2006) [1]. We then derive the exact distribution of a linear combination of a variable and order statistics from the other two variables in the case of a trivariate elliptical distribution. We show that the cumulative distribution function (cdf) of this linear combination is a mixture of the univariate skew-elliptical distribution functions.     

Approximations for a fixed sample size selection procedure for negative binomial populations

A large sample approximation of the least favorable configuration for a fixed sample size selection procedure for negative binomial populations is proposed. A normal approximation of the selection procedure is also presented. Optimal sample sizes required to be drawn from each population and the bounds for the sample sizes are tabulated. Sample sizes obtained using the approximate least favorable configuration are compared with those obtained using the exact least favorable configuration. Alternate form of the normal approximation to the probability of correct selection is also presented. The relation between the required sample size and the number of populations involved is studied.