A Unified Approach to the Approximation of Multivariate Densities

Approximation of a density by another density is considered in the case of different dimensionalities of the distributions. The results have been derived by inverting expansions of characteristic functions with the help of matrix techniques. The approximations obtained are all functions of cumulant differences and derivatives of the approximating density. The multivariate Edgeworth expansion follows from the results as a special case. Furthermore, the density functions of the trace and eigenvalues of the sample covariance matrix are approximated by the multivariate normal density and a numerical example is given     

On characterizing the normal and poisson distributions

Multivariate normal, correlated multivariate Poisson and multiple Poisson distributions are characterized, in the class of exponential-type distributions, by the properties of the linear combinations of the variables, the properties of their cumulants and the recurance relation between the cumulants.     

On fractional moments of quadratic expressions in normal variables1

Fractional moments, product cumulants and product moments of general quadratic expressions in singular and nonsingular normal variables are explicitly evaluated. A general method of deriving such moments is also indicated. Particular cases art; shown to agree with known results.     

Estimation for the bivariate normal correlation coefficient using asymptotic expansions

Harley (1954) gave asymptotic expansions for the distributio function and for percentiles of the distribution of the bivariate normal sample correlation coefficient. To the stated order of approximation these expansions were incomplete in that contributions from some higher cumulants were not taken into account. In this article the completed expansions are given together with an asymptotic expansion yielding approximate confidence limits for the population correlation coefficient. Numerical comparisons indicate that asymptotic expansions are superior to other suggested approximate methods     

On the use of different metrics for assessing complex pattern reproductions

Nowadays, there is an increasing interest in multi-point models and their applications in Earth sciences. However, users not only ask for multi-point methods able to capture the uncertainties of complex structures and to reproduce the properties of a training image, but also they need quantitative tools for assessing whether a set of realizations have the properties required. Moreover, it is crucial to study the sensitivity of the realizations to the size of the data template and to analyze how fast realization-based statistics converge on average toward training-based statistics. In this paper, some similarity measures and convergence indexes, based on some physically measurable quantities and cumulants of high-order, are presented. In the case study, multi-point simulations of the spatial distribution of coarse-grained limestone and calcareous rock, generated by using three templates of different sizes, are compared and convergence toward training-based statistics is analyzed by taking into account increasing numbers of realizations.     

Using intersection matrices to identify graphical structure

Intersection matrices help identify the common graphical structure of two or more objects. They arise naturally in a variety of settings. Several examples of their use in a computer algebra environment are given. These include: simplifying an expression involving array products, automating cumulant calculations, determining the behaviour of an expected value operator and identifying model hierarchy in a factorial experiment. The emphasis is placed on the graphical structure, and the symmetry of arrays help reduce the complexity of the graphical problem.     

On approximating the distribution of indefinite quadratic forms

This paper provides a simple methodology for approximating the distribution of indefinite quadratic forms in normal random variables. It is shown that the density function of a positive definite quadratic form can be approximated in terms of the product of a gamma density function and a polynomial. An extension which makes use of a generalized gamma density function is also considered. Such representations are based on the moments of a quadratic form, which can be determined from its cumulants by means of a recursive formula. After expressing an indefinite quadratic form as the difference of two positive definite quadratic forms, one can obtain an approximation to its density function by means of the transformation of variable technique. An explicit representation of the resulting density approximant is given in terms of a degenerate hypergeometric function. An easily implementable algorithm is provided. The proposed approximants produce very accurate percentiles over the entire range of the distribution. Several numerical examples illustrate the results. In particular, the methodology is applied to the Durbin–Watson statistic which is expressible as the ratio of two quadratic forms in normal random variables. Quadratic forms being ubiquitous in statistics, the approximating technique introduced herewith has numerous potential applications. Some relevant computational considerations are also discussed.     

Moments of the trace of a noncentral wishart matrix

Several articles have appeared on the moments of the trace of a noncentral Wishart matrix. Partial results are given in these papers but the representations of these partial results are often too cumbersome for any practical use. In this paper general results are given in compact form which are readily usable in practical problems.     

A Dimensional CLT for Non-Central Wilks' Lambda in Multivariate Analysis

Abstract.  We consider the non-central distribution of the classical Wilks' lambda statistic for testing the general linear hypothesis in MANOVA. We prove that as the dimension of the observation vector goes to infinity, Wilks' lambda obeys a central limit theorem under simple growth conditions on the non-centrality matrix. In one case we also prove a stronger result: the saddlepoint cumulative distribution function (CDF) approximation for the standardized version of Wilks' lambda converges uniformly on compact sets to the standard normal CDF. These theoretical results go some way towards explaining why saddlepoint approximations to the distribution of Wilks' lambda retain excellent accuracy in high-dimensional cases.