A new construction for skew multivariate distributions

This paper considers a new approach to develop a very general class of skew multivariate distributions. The approach is based on a linear combination of an elliptically distributed random variable with a linear constraint. Using this approach two different classes of multivariate distributions are constructed based on original distribution. These new classes include different types of skew normal (type A and type B) and other skew elliptical distributions, exist in the literature. We also derive the moment generating function, marginal and conditional density of our proposed classes of distributions. Straightforward explanations are applied to demonstrate the relationships among previous approaches by others with our proposed class of skew distributions.     

一般形式下斜正态随机向量的矩

本文给出一般形式下斜正态随机向量及其平方型的矩公式. 作为应用, 计算出了斜正态随机向量的多元偏度和峰度.     

A characterization of the multivariate normal distribution

Let X_j (j = 1,…,n) be i.i.d. random variables, and let Y′ = (Y₁,…,Y_m) and X′ = (X₁,…,X_n) be independently distributed, and A = (a_jk) be an n × n random coefficient matrix with a_jk = a_jk(Y) for j, k = 1,…,n. Consider the equation U = AX, Kingman and Graybill [Ann. Math. Statist.41 (1970)] have shown U ～ N(O,I) if and only if X ～ N(O,I). provided that certain conditions defined in terms of the a_jk are satisfied. The task of this paper is to delete the identical assumption on X₁,…,X_n and then generalize the results to the vector case. Furthermore, the condition of independence on the random components within each vector is relaxed, and also the question raised by the above authors is answered.     

Inferences in linear mixed models with skew-normal random effects

For the linear mixed model with skew-normal random effects, this paper gives the density function, moment generating function and independence conditions. The noncentral skew chi-square distribution is defined and its density function is shown. The necessary and sufficient conditions under which a quadratic form is distributed as noncentral skew chi-square distribution are obtained. Also, a version of Cochran's theorem is given, which modifies the result of Wang et al. (2009) and is used to set up exact tests for fixed effects and variance components of the proposed model. For illustration, our main results are applied to a real data problem.     

Minimax estimation of means of multivariate normal mixtures

Assume X = (X₁, …, X_p)′ is a normal mixture distribution with density w.r.t. Lebesgue measure, , where Σ is a known positive definite matrix and F is any known c.d.f. on (0, ∞). Estimation of the mean vector under an arbitrary known quadratic loss function _Q(θ, a) = (a − θ)′ Q(a − θ), Q a positive definite matrix, is considered. An unbiased estimator of risk is obatined for an arbitrary estimator, and a sufficient condition for estimators to be minimax is then achieved. The result is applied to modifying all the Stein estimators for the means of independent normal random variables to be minimax estimators for the problem considered here. In particular the results apply to the Stein class of limited translation estimators.     

On determination of multivariate distribution by its marginals for the Kagan class

For any distribution belonging to the Kagan class a general formula expressing its characteristic function in a neighbourhood of the origin in terms of the marginal characteristic functions is obtained. Also some applications are given.     

On the quadratic estimation of covariance matrices in multivariate linear models

This paper investigates the estimation of covariance matrices in multivariate mixed models. Some sufficient conditions are derived for a multivariate quadratic form and a linear combination of multivariate quadratic forms to be the BQUE (quadratic unbiased and severally minimum varianced) estimators of its expectations.     

一类带有MaxEMin评判的补偿型随机规划算法

补偿型随机规划一般假定随机变量的概率分布具有完备信息, 但实际情况往往只能获得部分信息. 针对离散概率具有一类线性部分信息条件而建立了带有MaxEMin评判的两阶段随机规划模型, 借助二次规划和对偶分解方法得到了可行性切割和最优切割, 给出了基于L-型的求解算法, 并证明了算法的收敛性. 通过数值实验表明了算法的有效性.     

A construction method of certain matrices required in the multivariate heteroscedastic method

Summary For statistical inference about several normal means, the heteroscedastic method was proposed by Dudewicz and Bishop (1979,Optimizing Methods in Statistics, Academic Press, 183–203). However, the practical application in the multivariate case was not possible because it had not been known how to construct the certain matrices required in the method. In this paper, a construction method of the matrices is given.     

The use of the tetrachoric series for evaluating multivariate normal probabilities

The tetrachoric series is a technique for evaluating multivariate normal probabilities frequently cited in the statistical literature. In this paper we have examined the convergence properties of the tetrachoric series and have established the following. For orthant probabilities, the tetrachoric series converges if $\text{|;?}{}_{\mathrm{ij}}\text{|; <}\text{1}\text{(k ? 1)}$, 1 ≤ i < j ≤ k, where ?_ij are the correlation coefficients of a k-variate normal distribution. The tetrachoric series for orthant probabilities diverges whenever k is even and $\text{?}{}_{\mathrm{ij}}\text{>}\text{1}\text{(k ? 1)}$ or k is odd and $\text{?}{}_{\mathrm{ij}}\text{>}\text{1}\text{(k ? 2)}$, 1 ≤ i < j ≤ k. Other specific results concerning the convergence or divergence of this series are also given. The principal point is that the assertion that the tetrachoric series converges for all k ≥ 2 and all ?_ij such that the correlation matrix is positive definite is false.     

On confidence sequences for the mean vector of a multivariate normal distribution

Let X₁, X₂,… be idd random vectors with a multivariate normal distribution N(μ, Σ). A sequence of subsets {R_n(a₁, a₂,…, a_n), n ≥ m} of the space of μ is said to be a (1 − α)-level sequence of confidence sets for μ if P(μ R_n(X₁, X₂,…, X_n) for every n ≥ m) ≥ 1 − α. In this note we use the ideas of Robbins Ann. Math. Statist. 41 (1970) to construct confidence sequences for the mean vector μ when Σ is either known or unknown. The constructed sequence R_n(X₁, X₂, …, X_n) depends on Mahalanobis' or Hotelling's according as Σ is known or unknown. Confidence sequences for the vector-valued parameter in the general linear model are also given.     

A characterization of the multivariate normal distribution by using the hazard gradient

We give a general result to characterize a multivariate distribution from a relationship between the left truncated mean function and the hazard gradient function. This result allows us to obtain new characterizations of multivariate distributions. In particular, we show that, for the multivariate normal distribution, the simple relationship, obtained in standardized form by McGill (1992,Communications in Statistics. Theory Methods,21(11), 3053–3060), actually characterizes the multivariate normal distribution. Supported by Ministerio de Ciencia y Tecnologia under grant BFM2000-0362.     

A new class of polynomials associated with Bernstein and beta polynomials

The purpose of this paper is to define a new class polynomials. Special cases of these polynomials give many famous family of the Bernstein type polynomials and beta polynomials. We also construct generating functions for these polynomials. We investigate some fundamental properties of these functions and polynomials. Using functional equations and generating functions, we derive various identities related to theses polynomials. We also construct interpolation function that interpolates these polynomials at negative integers. Finally, we give a matrix representations of these polynomials. Copyright © 2013 John Wiley & Sons, Ltd.     

A class of multiple shrinkage estimators

Based on a sample of size n, we investigate a class of estimators of the mean of a p-variate normal distribution with independent components having unknown covariance. This class includes the James-Stein estimator and Lindley's estimator as special cases and was proposed by Stein. The mean squares error improves on that of the sample mean for p3. Simple approximations imations for this improvement are given for large n or p. Lindley's estimator improves on that of James and Stein if either n is large, and the coefficient of variation of is less than a certain increasing function of p, or if p is large. An adaptive estimator is given which for large samples always performs at least as well as these two estimators.     

A class of generalized cyclic codes

1. IntroductionPrange was considered to be first person to study cyclic codes at the end of 1950s, seeIll and [2]. Since then, cyclic codes are the mostly studied of all codes, because they are easyto encode, and include an important family of BCH codes. A code C is cyclic if it is linearand if any cyclic shift of a codeword is also a codeword, i.e., whenever (co, of,' 1 on--l ) is inC then so is (c.--1, co j', c.--2). In fact, one could define a cyclic code to be an ideal in thering of…     

A new approach to Bezout equations derived from multivariate polynomial matrices and real entire functions

This paper focuses on Bezout equations derived from multivariate polynomial matrices in which relationships between one primary variable and other variables are described by real entire functions. We propose a method for obtaining a solution belonging to a set of multivariate rational function matrices in which all entries are real entire functions with respect to the primary variable. The proposed method is based on a new approach that overcomes the constraints and difficulties due to many variables by expanding a class of solutions to multivariate rational function matrices.     

The distribution of the sum of independent gamma random variables

Summary The distribution of the sum ofn independent gamma variates with different parameters is expressed as a single gamma-series whose coefficients are computed by simple recursive relations.     

A generalized Pólya urn model and related multivariate distributions

In this paper, we study of Pólya urn model containing balls of (m+1) different labels under a general replacement scheme, which is characterized by an (m+1) × (m+1) addition matrix of integers without constraints on the values of these (m+1)² integers other than non-negativity. LetX ₁,X ₂,...,X _n be trials obtained by the Pólya urn scheme (with possible outcomes: “O”, “1”,...“m”). We consider the multivariate distributions of the numbers of occurrences of runs of different types arising from the various enumeration schemes and give a recursive formula of the probability generating function. Some closed form expressions are derived as special cases, which have potential applications to various areas. Our methods for the derivation of the multivariate run-related distribution are very simple and suitable for numerical and symbolic calculations by means of computer algebra systems. The results presented here develop a general workable framework for the study of Pólya urn models. Our attempts are very useful for understanding non-classic urn models. Finally, numerical examples are also given in order to illustrate the feasibility of our results. This research was partially supported by the ISM Cooperative Research Program (2003-ISM·CRP-2007).     

On the finite series expansion of multivariate characteristic functions

Three theorems are obtained that relate the asymptotic behavior of a distribution function with the behavior of its characteristic function at the origin. These theorems generalize one dimensional results that have been obtained by the author and by others.     

A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix

Summary  This paper presents a heuristic approach for multivariate random number generation. Our aim is to generate multivariate samples with specified marginal distributions and correlation matrix, which can be incorporated into risk analysis models to conduct simulation studies. The proposed sampling approach involves two distinct steps: first a univariate random sample from each specified probability distribution is generated; then a heuristic combinatorial optimization procedure is used to rearrange the generated univariate samples, in order to obtain the desired correlations between them. The combinatorial optimization step is performed with a simulated annealing algorithm, which changes only the positions and not the values of the numbers generated in the first step. The proposed multivariate sampling approach can be used with any type of marginal distributions: continuous or discrete, parametric or non-parametric, etc.