Computing probabilites of rectangles in case of multinormal distribution

In several stochastic programming models and statistical problems the computation of probabilities of n-dimensional rectangles is required in case of n-dimensional normal distribution. A recent simulation technique presented by the author for computing values of the distribution function can be modified to yield appropriate procedure for computing probabilities of rectangles. Some numerical work is provided to illustrate the use of the new algorithm.     

Matrix-analytic Models and their Analysis

We survey phase-type distributions and Markovian point processes, aspects of how to use such models in applied probability calculations and how to fit them to observed data. A phase-type distribution is defined as the time to absorption in a finite continuous time Markov process with one absorbing state. This class of distributions is dense and contains many standard examples like all combinations of exponential in series/parallel. A Markovian point process is governed by a finite continuous time Markov process (typically ergodic), such that points are generated at a Poisson intensity depending on the underlying state and at transitions; a main special case is a Markov-modulated Poisson process. In both cases, the analytic formulas typically contain matrix-exponentials, and the matrix formalism carried over when the models are used in applied probability calculations as in problems in renewal theory, random walks and queueing. The statistical analysis is typically based upon the EM algorithm, viewing the whole sample path of the background Markov process as the latent variable.     

The exact proability that the roots of quadratic,cubic, and quartic equations are all real if the equation coefficients are random

Suppose that the coefficients of a polynomial equation are Independent random variables defined on subsets of real numbers, The purpose of this paper is to find the exact probability that all roots of a random polynomial equation are real. Since a polynomial equation of degree higher than four with arbitrary coefficients cannot be solved algrebraically, this paper will consider quadratic, cubic and quartic equations only. The general results are obtained in each case, Also, a number of special cases are furnished.     

An introduction to hypergeometric functions for economists

Hypergeometric functions are a generalization of exponential functions. They are explicit, computable functions that can also be manipulated analytically. The functions and series we use in quantitative economics are all special cases of them. In this paper, a unified approach to hypergeometric functions is given. As a result, some potentially useful general applications emerge in a number of areas such as in econometrics and economic theory. The greatest benefit from using these functions stems from the fact that they provide parsimonious explicit (and interpretable) solutions to a wide range of general problems.     

Magic rectangles and modular magic rectangles

Magic rectangles are m × n matrices with entries 1, …, mn, all row sums being equal and all column sums being equal. Sun established necessary and sufficient conditions for the existence of magic (m, n) rectangles.We introduce modular magic rectangles, variants of magic rectangles, and study two classes of modular magic rectangles: Pseudomagic and complete magic rectangles. We construct classes of pseudomagic, modular magic rectangles that are not magic rectangles, and classes of complete, modular magic rectangles. This suggests the problem of determining the spectra of pseudomagic, modular magic rectangles that are not magic rectangles; complete, modular magic rectangles; and complete, magic rectangles.     

Bayesian inference for generalized additive mixed models based on Markov random field priors

Most regression problems in practice require flexible semiparametric forms of the predictor for modelling the dependence of responses on covariates. Moreover, it is often necessary to add random effects accounting for overdispersion caused by unobserved heterogeneity or for correlation in longitudinal or spatial data. We present a unified approach for Bayesian inference via Markov chain Monte Carlo simulation in generalized additive and semiparametric mixed models. Different types of covariates, such as the usual covariates with fixed effects, metrical covariates with non-linear effects, unstructured random effects, trend and seasonal components in longitudinal data and spatial covariates, are all treated within the same general framework by assigning appropriate Markov random field priors with different forms and degrees of smoothness. We applied the approach in several case-studies and consulting cases, showing that the methods are also computationally feasible in problems with many covariates and large data sets. In this paper, we choose two typical applications.     

Massively parallel computing: a statistical application

Massively parallel computing is a computing environment with thousands of subprocessors. It requires some special programming methods, but is well suited to certain imaging problems. One such statistical example is discussed in this paper. In addition there are other natural statistical problems for which this technology is well suited. This paper describes our experience, as statisticians, with a massively parallel computer in a problem of image correlation spectroscopy. Even with this computing environment some direct computations would still take in the order of a year to finish. It is shown that some of the algorithms of interest can be made parallel.     

An economical acceptance–rejection algorithm for uniform random variate generation over constrained simplexes

This paper develops an algorithm for uniform random generation over a constrained simplex, which is the intersection of a standard simplex and a given set. Uniform sampling from constrained simplexes has numerous applications in different fields, such as portfolio optimization, stochastic multi-criteria decision analysis, experimental design with mixtures and decision problems involving discrete joint distributions with imprecise probabilities. The proposed algorithm is developed by combining the acceptance–rejection and conditional methods along with the use of optimization tools. The acceptance rate of the algorithm is analytically compared to that of a crude acceptance–rejection algorithm, which generates points over the simplex and then rejects any points falling outside the intersecting set. Finally, using convex optimization, the setup phase of the algorithm is detailed for the special cases where the intersecting set is a general convex set, a convex set defined by a finite number of convex constraints or a polyhedron.     

On the Moments of Multivariate Discrete Distributions Using Finite Difference Operators

This article discusses a general approach to finding the moments of two classes of multivariate discrete distributions, which include those widely used in applied and theoretical statistics. The two classes of multivariate discrete distributions are the multivariate generalized power series distributions (GPSD) and the unified multivariate hypergeometric (UMH) Distributions. The results of Link (1981) follow as special cases.     

Relative error prediction via kernel regression smoothers

In this article, we introduce and study local constant and local linear nonparametric regression estimators when it is appropriate to assess performance in terms of mean squared relative error of prediction. We give asymptotic results for both boundary and non-boundary cases. These are special cases of more general asymptotic results that we provide concerning the estimation of the ratio of conditional expectations of two functions of the response variable. We also provide a good bandwidth selection method for the estimators. Examples of application, limited simulation results and discussion of related problems and approaches are also given.     

Some results on the truncated multivariate t distribution

The use of truncated distributions arises often in a wide variety of scientific problems. In the literature, there are a lot of sampling schemes and proposals developed for various specific truncated distributions. So far, however, the study of the truncated multivariate t (TMVT) distribution is rarely discussed. In this paper, we first present general formulae for computing the first two moments of the TMVT distribution under the double truncation. We formulate the results as analytic matrix expressions, which can be directly computed in existing software. Results for the left and right truncation can be viewed as special cases. We then apply the slice sampling algorithm to generate random variates from the TMVT distribution by introducing auxiliary variables. This strategic approach can result in a series of full conditional densities that are of uniform distributions. Finally, several examples and practical applications are given to illustrate the effectiveness and importance of the proposed results.     

D-optimal design for a quadratic log contrast model for experiments with mixtures

A practical method is suggested for solving complicated D-optimal design problems analytically. Using this method the author has solved the problem for a quadratic log contrast model for experiments with mixtures introduced by J. Aitchison and J. Bacon-Shone. It is found that for a symmetric subspace of the finite dimensional simplex, the vertices and the centroid of this subspace are the only possible support points for a D-optimal design. The weights that must be assigned to these support points contain irrational numbers and are constrained by a system of three simultaneous linear equations, except for the special cases of 1- and 2-dimensional simplexes where the situation is much simpler. Numerical values for the solution are given up to the 19-dimensional simplex     

Flexible mixture modelling using the multivariate skew-t-normal distribution

This paper presents a robust probabilistic mixture model based on the multivariate skew-t-normal distribution, a skew extension of the multivariate Student’s t distribution with more powerful abilities in modelling data whose distribution seriously deviates from normality. The proposed model includes mixtures of normal, t and skew-normal distributions as special cases and provides a flexible alternative to recently proposed skew t mixtures. We develop two analytically tractable EM-type algorithms for computing maximum likelihood estimates of model parameters in which the skewness parameters and degrees of freedom are asymptotically uncorrelated. Standard errors for the parameter estimates can be obtained via a general information-based method. We also present a procedure of merging mixture components to automatically identify the number of clusters by fitting piecewise linear regression to the rescaled entropy plot. The effectiveness and performance of the proposed methodology are illustrated by two real-life examples.     

Partially projected gradient algorithms for computing nonparametric maximum likelihood estimates of mixing distributions

There exist primarily three different types of algorithms for computing nonparametric maximum likelihood estimates (NPMLEs) of mixing distributions in the literature, which are the EM-type algorithms, the vertex direction algorithms such as VDM and VEM, and the algorithms based on general constrained optimization techniques such as the projected gradient method. It is known that the projected gradient algorithm may run into stagnation during iterations. When a stagnation occurs, VDM steps need to be added. We argue that the abrupt switch to VDM steps can significantly reduce the efficiency of the projected gradient algorithm, and is usually unnecessary. In this paper, we define a group of partially projected directions, which can be regarded as hybrids of ordinary projected gradient directions and VDM directions. Based on these directions, four new algorithms are proposed for computing NPMLEs of mixing distributions. The properties of the algorithms are discussed and their convergence is proved. Extensive numerical simulations show that the new algorithms outperform the existing methods, especially when a NPMLE has a large number of support points or when high accuracy is required.     

On the role of minque in testing of hypotheses under hiked linear models

Testing of hypotheses under balanced ANOVA models is fairly simple and generally based on the usual ANOVA sums of squares. Difficulties may arise in special cases when these sums of squares do not form a complete sufficient statistic. There is a huge literature on this subject which was recently surveyed in Seifert's contribution to the book of Mumak (1904). But there are only a few results about unbalanced models. In such models the consideration of likelihood ratios leads to more complex sums of squares known from MINQUE theory.

Uniform optimality of testsusually reduces to local optimality. Here we prespnt a small review of methods proposed for testing of hypotheses in unbalanced models. where MINQUEI playb a major role. We discuss the use of iterated MINQUE for the construction of asymptotically optimal tests described in Humak (1984) and approximate tests based on locally uncorrelated linear combinations of MINQUE estimators by Seifert (1985), We show that the latter tests coincide with robust locally optimal invariant tests proposeci by Kariya and Sinha and Das and Sinha, if the number of variance components is two. Explicit expressions for corresponding tests are given for the unbalanced two-way cross classification random model, which covers some other models as special cases. A simulation study under lines the relevance of MINQUE for testing of hypotheses problems.     

Genetic algorithms for numerical optimization

Genetic algorithms (GAs) are stochastic adaptive algorithms whose search method is based on simulation of natural genetic inheritance and Darwinian striving for survival. They can be used to find approximate solutions to numerical optimization problems in cases where finding the exact optimum is prohibitively expensive, or where no algorithm is known. However, such applications can encounter problems that sometimes delay, if not prevent, finding the optimal solutions with desired precision. In this paper we describe applications of GAs to numerical optimization, present three novel ways to handle such problems, and give some experimental results.     

Ordered Random Fractions For Chronological Sampling

The method was devised for use in reference testing under the Average Quantity System, but appears to be of more general interest. It is useful where a chronological list of sampling points is required, as in sampling over time or from items in a line.     

A stochastic approximation algorithm for maximum-likelihood estimation with incomplete data

We propose a new stochastic approximation (SA) algorithm for maximum-likelihood estimation (MLE) in the incomplete-data setting. This algorithm is most useful for problems when the EM algorithm is not possible due to an intractable E-step or M-step. Compared to other algorithm that have been proposed for intractable EM problems, such as the MCEM algorithm of Wei and Tanner (1990), our proposed algorithm appears more generally applicable and efficient. The approach we adopt is inspired by the Robbins-Monro (1951) stochastic approximation procedure, and we show that the proposed algorithm can be used to solve some of the long-standing problems in computing an MLE with incomplete data. We prove that in general O(n) simulation steps are required in computing the MLE with the SA algorithm and O(n log n) simulation steps are required in computing the MLE using the MCEM and/or the MCNR algorithm, where n is the sample size of the observations. Examples include computing the MLE in the nonlinear error-in-variable model and nonlinear regression model with random effects.     

Adaptive Bayesian Procedures Using Random Series Priors

We consider a general class of prior distributions for nonparametric Bayesian estimation which uses finite random series with a random number of terms. A prior is constructed through distributions on the number of basis functions and the associated coefficients. We derive a general result on adaptive posterior contraction rates for all smoothness levels of the target function in the true model by constructing an appropriate ‘sieve’ and applying the general theory of posterior contraction rates. We apply this general result on several statistical problems such as density estimation, various nonparametric regressions, classification, spectral density estimation and functional regression. The prior can be viewed as an alternative to the commonly used Gaussian process prior, but properties of the posterior distribution can be analysed by relatively simpler techniques. An interesting approximation property of B‐spline basis expansion established in this paper allows a canonical choice of prior on coefficients in a random series and allows a simple computational approach without using Markov chain Monte Carlo methods. A simulation study is conducted to show that the accuracy of the Bayesian estimators based on the random series prior and the Gaussian process prior are comparable. We apply the method on Tecator data using functional regression models.