The Multi-Sample Block-Scalar Sphericity Test: Exact and Near-Exact Distributions for Its Likelihood Ratio Test Statistic

In this article the authors show how by adequately decomposing the null hypothesis of the multi-sample block-scalar sphericity test it is possible to obtain the likelihood ratio test statistic as well as a different look over its exact distribution. This enables the construction of well-performing near-exact approximations for the distribution of the test statistic, whose exact distribution is quite elaborate and non-manageable. The near-exact distributions obtained are manageable and perform much better than the available asymptotic distributions, even for small sample sizes, and they show a good asymptotic behavior for increasing sample sizes as well as for increasing number of variables and/or populations involved.     

Study of the quality of several asymptotic and near-exact approximations based on moments for the distribution of the Wilks Lambda statistic

In this paper a measure of proximity of distributions, when moments are known, is proposed. Based on cases where the exact distribution is known, evidence is given that the proposed measure is accurate to evaluate the proximity of quantiles (exact vs. approximated). The measure may be applied to compare asymptotic and near-exact approximations to distributions, in situations where although being known the exact moments, the exact distribution is not known or the expression for its probability density function is not known or too complicated to handle. In this paper the measure is applied to compare newly proposed asymptotic and near-exact approximations to the distribution of the Wilks Lambda statistic when both groups of variables have an odd number of variables. This measure is also applied to the study of several cases of telescopic near-exact approximations to the exact distribution of the Wilks Lambda statistic based on mixtures of generalized near-integer gamma distributions.     

Approximating Matrix-Exponential Distributions by Global Randomization

Abstract

Based on the general concept of randomization, we develop linear-algebraic approximations for continuous probability distributions that involve the exponential of a matrix in their definitions, such as phase types and matrix-exponential distributions. The approximations themselves result in proper probability distributions. For such a global randomization with the Erlang-k distribution, we show that the sequences of true and consistent distribution and density functions converge uniformly on [0, ∞). Furthermore, we study the approximation errors in terms of the power moments and the coefficients of the Taylor series, from which the accuracy of the approximations can be determined apriori. Numerical experiments demonstrate the feasibility of the presented randomization technique – also in comparison with uniformization.     

Near-exact distributions for the sphericity likelihood ratio test statistic

In this paper three near-exact distributions are developed for the sphericity test statistic. The exact probability density function of this statistic is usually represented through the use of the Meijer G function, which renders the computation of quantiles impossible even for a moderately large number of variables. The main purpose of this paper is to obtain near-exact distributions that lie closer to the exact distribution than the asymptotic distributions while, at the same time, correspond to density and cumulative distribution functions practical to use, allowing for an easy determination of quantiles. In addition to this, two asymptotic distributions that lie closer to the exact distribution than the existing ones were developed. Two measures are considered to evaluate the proximity between the exact and the asymptotic and near-exact distributions developed. As a reference we use the saddlepoint approximations developed by Butler et al. [1993. Saddlepoint approximations for tests of block independence, sphericity and equal variances and covariances. J. Roy. Statist. Soc., Ser. B 55, 171–183] as well as the asymptotic distribution proposed by Box.     

Sequential Monte Carlo for counting vertex covers in general graphs

In this paper we describe a sequential importance sampling (SIS) procedure for counting the number of vertex covers in general graphs. The optimal SIS proposal distribution is the uniform over a suitably restricted set, but is not implementable. We will consider two proposal distributions as approximations to the optimal. Both proposals are based on randomization techniques. The first randomization is the classic probability model of random graphs, and in fact, the resulting SIS algorithm shows polynomial complexity for random graphs. The second randomization introduces a probabilistic relaxation technique that uses Dynamic Programming. The numerical experiments show that the resulting SIS algorithm enjoys excellent practical performance in comparison with existing methods. In particular the method is compared with cachet—an exact model counter, and the state of the art SampleSearch, which is based on Belief Networks and importance sampling.     

Estimating parametric semi-Markov models from panel data using phase-type approximations

Inference for semi-Markov models under panel data presents considerable computational difficulties. In general the likelihood is intractable, but a tractable likelihood with the form of a hidden Markov model can be obtained if the sojourn times in each of the states are assumed to have phase-type distributions. However, using phase-type distributions directly may be undesirable as they require estimation of parameters which may be poorly identified. In this article, an approach to fitting semi-Markov models with standard parametric sojourn distributions is developed. The method involves establishing a family of Coxian phase-type distribution approximations to the parametric distribution and merging approximations for different states to obtain an approximate semi-Markov process with a tractable likelihood. Approximations are developed for Weibull and Gamma distributions and demonstrated on data relating to post-lung-transplantation patients.     

DISTRIBUTION OF THE LEAST SQUARES ESTIMATOR IN A FIRST-ORDER AUTOREGRESSIVE MODEL

This paper investigates the finite sample distribution of the least squares estimator of the autoregressive parameter in a first-order autoregressive model. A uniform asymptotic expansion for the distribution applicable to both stationary and nonstationary cases is obtained. Accuracy of the approximation to the distribution by a first few terms of this expansion is then investigated. It is found that the leading term of this expansion approximates well the distribution. The approximation is, in almost all cases, accurate to the second decimal place throughout the distribution. In the literature, there exist a number of approximations to this distribution which are specifically designed to apply in some special cases of this model. The present approximation compares favorably with those approximations and in fact, its accuracy is, with almost no exception, as good as or better than these other approximations. Convenience of numerical computations seems also to favor the present approximations over the others. An application of the finding is illustrated with examples.     

Approximating the distribution of a renewal process using generalized poisson distributions

The exact distribution of a renewal counting process is not easy to compute and is rarely of closed form. In this article, we approximate the distribution of a renewal process using families of generalized Poisson distributions. We first compute approximations to the first several moments of the renewal process. In some cases, a closed form approximation is obtained. It is found that each family considered has its own strengths and weaknesses. Some new families of generalized Poisson distributions are recommended. Theorems are obtained determining when these variance to mean ratios are less than (or exceed) one without having to find the mean and variance. Some numerical comparisons are also made.     

Some theoretical results regarding the polygonal distribution

Polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. We demonstrate that the densities of polygonal distributions are dense in the class of continuous and concave densities with bounded second derivatives. Furthermore, we prove that polygonal density functions provide O(g^{? 2}) approximations (where g is the number of triangular distribution components), in the supremum distance, to any density function from the hypothesized class. Parametric consistency and Hellinger consistency results for the maximum likelihood (ML) estimator are obtained. A result regarding model selection via penalized ML estimation is proved.     

Improved auxiliary mixture sampling for hierarchical models of non-Gaussian data

The article considers Bayesian analysis of hierarchical models for count, binomial and multinomial data using efficient MCMC sampling procedures. To this end, an improved method of auxiliary mixture sampling is proposed. In contrast to previously proposed samplers the method uses a bounded number of latent variables per observation, independent of the intensity of the underlying Poisson process in the case of count data, or of the number of experiments in the case of binomial and multinomial data. The bounded number of latent variables results in a more general error distribution, which is a negative log-Gamma distribution with arbitrary integer shape parameter. The required approximations of these distributions by Gaussian mixtures have been computed. Overall, the improvement leads to a substantial increase in efficiency of auxiliary mixture sampling for highly structured models. The method is illustrated for finite mixtures of generalized linear models and an epidemiological case study.     

Saddlepoint Approximations for Stopped-Sum Distributions

One of the common used classes of distributions is the stopped-sum class. This class includes Hermite distribution, Polya–Aeppli distribution, Poisson-Gamma distribution, and Neyman type A. This article introduces the saddlepoint approximations to the stopped-sum class in continuous and discrete settings. We discuss approximations for mass/density and cumulative distribution functions of stopped-sum distributions. Examples of continuous and discrete distributions from the Poisson stopped-sum class are presented. Comparisons between saddlepoint approximations and the exact calculations show the great accuracy of the saddlepoint methods.     

Saddlepoint Approximations to the Density and the Distribution Functions of Linear Combinations of Ratios of Partial Sums

A class of ratios of partial sums, including Normal, Weibull, Gamma, and Exponential distributions, is considered. The distribution of a linear combination of ratios of partial sums from this class is characterized by the distribution of a linear combination of Dirichlet components. This article presents two saddlepoint approaches to calculate the density and the distribution function for such a class of linear combinations. A simulation study is conducted to assess the performance of the saddlepoint methods and shows the great accuracy of the approximations over the usual asymptotic approximation. Applications of the presented approximations in statistical inferences are discussed.     

A general approximation to quantiles

For many continuous distributions, a closed-form expression for their quantiles does not exist. Numerical approximations for their quantiles are developed on a distribution-by-distribution basis. This work develops a general approximation for quantiles using the Taylor expansion. Our method only requires that the distribution has a continuous probability density function and its derivatives can be derived to a certain order (usually 3 or 4). We demonstrate our unified approach by approximating the quantiles of the normal, exponential, and chi-square distributions. The approximation works well for these distributions.     

More Damned Lies and Statistics: How Numbers Confuse Public Issues and Chance: A Guide to Gambling,Love, the Stock Market, & Just About Everything Else

In this article we review two historical approximations to the Poisson and binomial cumulative distribution functions (CDFs); that is, the Wilson–Hilferty and Camp–Paulson approximations. Both of these approximations reduce to standard normal formulas that produce very accurate estimates of the Poisson and binomial CDFs, and are thus quite simple to implement. Additionally, in an upper-division undergraduate or master’s level probability and inference course, the derivation of these approximations presents a nice opportunity to introduce and study the distributional relationships between the gamma and Poisson CDFs, and the binomial, beta, and F CDFs. This article presents the basic theorems and lemmas needed to derive each approximation, along with some relevant examples that compare and contrast the precision of these approximations with their large-sample, limiting normal counterparts.     

Higher-order Bayesian Approximations for Pseudo-posterior Distributions

The theory of higher-order asymptotics provides accurate approximations to posterior distributions for a scalar parameter of interest, and to the corresponding tail area, for practical use in Bayesian analysis. The aim of this article is to extend these approximations to pseudo-posterior distributions, e.g., posterior distributions based on a pseudo-likelihood function and a suitable prior, which are proved to be particularly useful when the full likelihood is analytically or computationally infeasible. In particular, from a theoretical point of view, we derive the Laplace approximation for a pseudo-posterior distribution, and for the corresponding tail area, for a scalar parameter of interest, also in the presence of nuisance parameters. From a computational point of view, starting from these higher-order approximations, we discuss the higher-order tail area (HOTA) algorithm useful to approximate marginal posterior distributions, and related quantities. Compared to standard Markov chain Monte Carlo methods, the main advantage of the HOTA algorithm is that it gives independent samples at a negligible computational cost. The relevant computations are illustrated by two examples.     

Development and comparative study of two near-exact approximations to the distribution of the product of an odd number of independent Beta random variables

Using the concept of near-exact approximation to a distribution we developed two different near-exact approximations to the distribution of the product of an odd number of particular independent Beta random variables (r.v.'s). One of them is a particular generalized near-integer Gamma (GNIG) distribution and the other is a mixture of two GNIG distributions. These near-exact distributions are mostly adequate to be used as a basis for approximations of distributions of several statistics used in multivariate analysis. By factoring the characteristic function (c.f.) of the logarithm of the product of the Beta r.v.'s, and then replacing a suitably chosen factor of that c.f. by an adequate asymptotic result it is possible to obtain what we call a near-exact c.f., which gives rise to the near-exact approximation to the exact distribution. Depending on the asymptotic result used to replace the chosen parts of the c.f., one may obtain different near-exact approximations. Moments from the two near-exact approximations developed are compared with the exact ones. The two approximations are also compared with each other, namely in terms of moments and quantiles.     

Exact calculation of power and sample size in bioequivalence studies using two one‐sided tests

The number of subjects in a pharmacokinetic two‐period two‐treatment crossover bioequivalence study is typically small, most often less than 60. The most common approach to testing for bioequivalence is the two one‐sided tests procedure. No explicit mathematical formula for the power function in the context of the two one‐sided tests procedure exists in the statistical literature, although the exact power based on Owen's special case of bivariate noncentral t‐distribution has been tabulated and graphed. Several approximations have previously been published for the probability of rejection in the two one‐sided tests procedure for crossover bioequivalence studies. These approximations and associated sample size formulas are reviewed in this article and compared for various parameter combinations with exact power formulas derived here, which are computed analytically as univariate integrals and which have been validated by Monte Carlo simulations. The exact formulas for power and sample size are shown to improve markedly in realistic parameter settings over the previous approximations. Copyright © 2014 John Wiley & Sons, Ltd.     

On two asymptotic normal distributions for the generalized wilks lambda statistic

In this paper we.present a Normal asymptotic distribution for the logarithm of the generalized Wilks Lambda statistic based on an asymptotic distribution for the determinant of a Wishart matrix. This distribution is obtained through the combined use of Taylor expansions of random variables whose exponentials have chi-square distributions and the Lindeberg-Feller version of the Central Limit Theorem, Another asymptotic Normal distribution for the logarithm of the generalized Wilks Lambda statistic for the case when at most one of the sets has an odd number of variables is derived directly from the exact distribution. Both distributions are non-degenerate and non-singular. The first Normal distribution compares favorably with other known approximations and asymptotic distributions namely for large numbers of variables and small sample sizes, while the second Normal distribution, which has a more restricted application, compares in most cases highly favorably with other known asymptotic distributions and approximations. Finally, a method to compute approximate quantiles which lay very close and converge steadily to the exact ones is presented.     

Convergence of Monte Carlo distribution estimates from rival samplers

It is often necessary to make sampling-based statistical inference about many probability distributions in parallel. Given a finite computational resource, this article addresses how to optimally divide sampling effort between the samplers of the different distributions. Formally approaching this decision problem requires both the specification of an error criterion to assess how well each group of samples represent their underlying distribution, and a loss function to combine the errors into an overall performance score. For the first part, a new Monte Carlo divergence error criterion based on Jensen–Shannon divergence is proposed. Using results from information theory, approximations are derived for estimating this criterion for each target based on a single run, enabling adaptive sample size choices to be made during sampling.     

Implementation of saddlepoint approximations in resampling problems

In many situations saddlepoint approximations can replace the Monte Carlo simulation typically used to find the bootstrap distribution of a statistic. We explain how bootstrap and permutation distributions can be expressed as conditional distributions and how methods for linear programming and for fitting generalized linear models can be used to find saddlepoint approximations to these distributions. The ideas are illustrated using an example from insurance.