Further results on the vecd operator and its applications

Abstract

In this paper, we consider the matrix vectorization operator termed the vecd operator, which has recently been introduced in the literature. This operator stacks up distinct elements of a symmetric matrix in a way that differs from that of the well-known vech operator; it stacks up not columns, but diagonals. We give further consideration to the vecd operator and related matrices, and derive their various useful properties. We provide some statistical applications of the vecd operator to illustrate its usefulness.     

PROPERTIES OF THE PATTERNED VECH OPERATOR

The vec operator arranges the columns of a matrix one below the other. When the matrix is symmetric such elements are not distinct but an extraction of only the distinct elements on or below the diagonal forms the operation denoted by vech. For other types of patterned matrices a ‘patterned vech’ operator is defined. The transformations from vech to vec are not uniquely defined. Here we examine properties of linear transformations which overcome the lack of uniqueness and develop properties of such linear transformations.     

Vec and vech operators for matrices,with some uses in jacobians and multivariate statistics

The vec of a matrix X stacks columns of X one under another in a single column; the vech of a square matrix X does the same thing but starting each column at its diagonal element. The Jacobian of a one-to-one transformation X → Y is then ∣∣?(vecX)/?(vecY) ∣∣ when X and Y each have functionally independent elements; it is ∣∣ ?(vechX)/?(vechY) ∣∣ when X and Y are symmetric; and there is a general form for when X and Y are other patterned matrices. Kronecker product properties of vec(ABC) permit easy evaluation of this determinant in many cases. The vec and vech operators are also very convenient in developing results in multivariate statistics.     

Some results on commutation matrices,with statistical applications

The commutation matrix P _mn changes the order of multiplication of a Kronecker matrix product. The vec operator stacks columns of a matrix one under another in a single column. It is possible to express the vec of a Kronecker matrix product in terms of a Kronecker product of vecs of matrices. The commutation matrix plays an important role here. “Super-vec-operators” like vec A ? vec A vec ( A ? A ), and vec{( A ? A ) P _nn} are very convenient. Several of their properties are being studied. Both the traditional commutation matrix and vec operator and the newer concepts developed from these are applied to multivariate statistical and related problems.     

Further identities for the Wishart distribution with applications in regression

Matrix analogues are given for a known scalar identity which relates certain expectations with respect to the Wishart distribution. (The scalar identity was independently derived by C. Stein and L. Haff.) The matrix analogues are more aptly called “matrix extensions.” They can be derived by using the scalar identity; nevertheless, they are seen (in quite elementary terms) to be more general than the latter. A method of doing multivariate calculations is developed from the identities, and several examples are worked in detail. We compute the first two moments of the regression coefficients and another matrix arising in regression analysis. Also, we give a new result for the matrix analogue of squared multiple correlation: the bias correction of Ezekiel (1930), a result often used in model building, is extended to the case of two or more dependent variables.     

A consistent estimator of the smoothing operator in the functional Hodrick–Prescott filter

In this article, we consider a version of the functional Hodrick–Prescott filter for functional time series. We show that the associated optimal smoothing operator preserves the “noise-to-signal ratio” structure. Moreover, as the main result, we propose a consistent estimator of this optimal smoothing operator.     

Stable spectral factorization with applications to the estimation of time series models

A method for generating a miniphase and inveitible spectral factor from an unstable v × v full rank polynomial matrix is proposed. The zeros inside the unit circle are reflected through the boundary |z|=1 using closed form algebraic manipulations. Also included in the procedure is a technique foi determining the stability of a polynomial operator that does not require the explicit construction of the determinant al equation. Application of the technique is illustrated and the implementation of the method in the statistical context of system estimation is discussed.     

Proof of phenomenon B

In their paper “Some application, properties and conjectures for higher order cumulants of a Markovian stepping-stone model”, Zheng and Matis make use of a conjecture known as “Phenomenon B” regarding the eigenvalues of a tridiagonal matrix having a certain form. While the conjecture was shown to hold for particular cases, it was not proven in general. To supplement the Zheng and Matis paper, a formal proof of Phenomenon B is given here.     

ESTIMATION OF REALIZED SIGNAL TO NOISE RATIO FOR A PAIR OF MULTIVARIATE SIGNALS

Consider the case of classifying an incoming message as one of two known p-dimension signals or as a pure noise. Let the noise co-variance matrix (assumed to be same in all the three cases) be unknown. We consider the problem of estimation of “realized signal to noise ratio matrix”, which is an index of discriminatory power, under various loss functions. Optimum estimators are obtained under these loss functions. Finally, an attempt is made to provide a lower confidence bound for the realized signal to noise ratio matrix. In the process, the probability distribution of the smaller eigenvalue of a 2 × 2 confluent hypergeometric random matrix is obtained.     

The Key Role of Statisticians in the Transformation of North American Industry

The role of Wikipedia for learning has been debated because it does not conform to the usual standards. Despite this, people use it, due to the ubiquity of Wikipedia entries in the outcomes from popular search engines. It is important for academic disciplines, including statistics, to ensure they are correctly represented in a medium where anyone can assume the role of discipline expert. In this context, we first develop a tool for evaluating Wikipedia articles for topics with a procedural component. Then, using this tool, five Wikipedia articles on basic statistical concepts are critiqued from the point of view of a self-learner: “arithmetic mean,” “standard deviation,” “standard error,” “confidence interval,” and “histogram.” We find that the articles, in general, are poor, and some articles contain inaccuracies. We propose that Wikipedia be actively discouraged for self-learning (using, for example, a classroom activity) except to give a brief overview; that in more formal learning environments, teachers be explicit about not using Wikipedia as a learning resource for course content; and, because Wikipedia is used regardless of considered advice or the organizational protocols in place, teachers move away from minimal contact with Wikipedia towards more constructive engagement.     

On the use of the selection matrix in the maximum likelihood estimation of normal distribution models with missing data

In this article, by using the constant and random selection matrices, several properties of the maximum likelihood (ML) estimates and the ML estimator of a normal distribution with missing data are derived. The constant selection matrix allows us to obtain an explicit form of the ML estimates and the exact relationship between the EM algorithm and the score function. The random selection matrix allows us to clarify how the missing-data mechanism works in the proof of the consistency of the ML estimator, to derive the asymptotic properties of the sequence by the EM algorithm, and to derive the information matrix.     

Computing the distribution of sequential Hölder norms of the Brownian motion

ABSTRACT

In this article, we give explicit formulas and study practical computations for the distribution function of sequential Hölder norms of a Brownian motion and of a Brownian bridge. We also discuss some statistical applications in the detection of some short “epidemic” changes in a sample.     

Detection and Estimation of Block Structure in Spatial Weight Matrix

In many economic applications, it is often of interest to categorize, classify, or label individuals by groups based on similarity of observed behavior. We propose a method that captures group affiliation or, equivalently, estimates the block structure of a neighboring matrix embedded in a Spatial Econometric model. The main results of the Least Absolute Shrinkage and Selection Operator (Lasso) estimator shows that off-diagonal block elements are estimated as zeros with high probability, property defined as “zero-block consistency.” Furthermore, we present and prove zero-block consistency for the estimated spatial weight matrix even under a thin margin of interaction between groups. The tool developed in this article can be used as a verification of block structure by applied researchers, or as an exploration tool for estimating unknown block structures. We analyzed the U.S. Senate voting data and correctly identified blocks based on party affiliations. Simulations also show that the method performs well.     

Central Limit Theorem approximations for the number of runs in Markov-dependent binary sequences

We consider Markov-dependent binary sequences and study various types of success runs (overlapping, non-overlapping, exact, etc.) by examining additive functionals based on state visits and transitions in an appropriate Markov chain. We establish a multivariate Central Limit Theorem for the number of these types of runs and obtain its covariance matrix by means of the recurrent potential matrix of the Markov chain. Explicit expressions for the covariance matrix are given in the Bernoulli and a simple Markov-dependent case by expressing the recurrent potential matrix in terms of the stationary distribution and the mean transition times in the chain. We also obtain a multivariate Central Limit Theorem for the joint number of non-overlapping runs of various sizes and give its covariance matrix in explicit form for Markov dependent trials.     

产业基本性与重点产业选择

在国家提出发展战略性新兴产业的大背景下,本文将技术结构意义上的“基本”性和技术进步潜力结合起来,归纳出重点产业选择的内在逻辑,并从理论的角度论证了其对经济增长的意义。本文进一步给出了基于投入产出表数据来辨别重点产业的数值方法。基于矩阵三角化方法的数值分析发现,我国的重点产业包含通信设备、计算机及其他电子设备制造业,通用与专用设备制造业,交通运输设备制造业。本文也同时计算出了我国重点产业的竞争力水平,并开展了国际比较。测算结果表明：通用与专用设备制造业,交通运输设备制造业的竞争力相对较强,而通信设备、计算机及其他电子设备制造业中的生产性投入品的竞争力则相对较弱。     

Characterization of information matrices for balanced two-level fractional factorial designs of odd resolution derived from two-symbol simple arrays

We consider a balanced fractional 2^m factorial design of resolution 2?+1 which permits estimation of all factorial effects up through ?-factor interactions under the situation in which all (?+1)-factor and higher order interactions are to be negligible for an integer satisfying [m/2]<lE;?m, where [x] denotes the greatest integer not exceeding x. This paper investigates algebraic structure of the information matrix of such a design derived from a simple array through that of an atomic array. We obtain an explicit expression for the irreducible matrix representation based on the above design and its algebraic properties. The results in this paper will be useful to characterize the designs under consideration.     

An iterative sparse algorithm for the penalized maximum likelihood estimator in mixed effects model

In this paper, we propose a new iterative sparse algorithm (ISA) to compute the maximum likelihood estimator (MLE) or penalized MLE of the mixed effects model. The sparse approximation based on the arrow-head (A-H) matrix is one solution which is popularly used in practice. The A-H method provides an easy computation of the inverse of the Hessian matrix and is computationally efficient. However, it often has non-negligible error in approximating the inverse of the Hessian matrix and in the estimation. Unlike the A-H method, in the ISA, the sparse approximation is applied “iteratively” to reduce the approximation error at each Newton Raphson step. The advantages of the ISA over the exact and A-H method are illustrated using several synthetic and real examples.     

Factor analysis regression

The paper describes two regression models—principal components and maximum-likelihood factor analysis—which may be used when the stochastic predictor varibles are highly intereorrelated and/or contain measurement error. The two problems can occur jointly, for example in social-survey data where the true (but unobserved) covariance matrix can be singular. Departure from singularity of the sample dispersion matrix is then due to measurement error. We first consider the more elementary principal components regression model, where it is shown that it can be derived as a special case of (i) canonical correlation, and (ii) restricted least squares. The second part consists of the more general maximum-likelihood factor-analysis regression model, which is derived from the generalized inverse of the product of two singular matrices. Also, it is proved that factor-analysis regression can be considered as an instrumental variables estimator and therefore does not depend on whether factors have been “properly” identified in terms of substantive behaviour. Consequently the additional task of rotating factors to “simple structure” does not arise.     

Fitting the additive model by recursion on dimension

We consider estimation for the homoscedastic additive model for multiple regression. A recursion is proposed in Opsomer (1999), and independently by the authors, for obtaining the estimators that solve the normal equations given by Hastie and Tibshirani (1990). The recursion can be exploited to obtain the asymptotic bias and variance expressions of the estimators for any p > 2 (Opsomer 1999) using repeated application of Opsomer and Ruppert (1997). Opsomer and Ruppert (1997) provide asymptotic bias and variance for the estimators when p = 2. Opsomer (1999) also uses the recursion to provide sufficient conditions for convergence of the backfitting algorithm to a unique solution of the normal equations. However, since explicit expressions for the solution to the normal equations are not given, he states, “The lemma does not provide a practical way of evaluating the existence and uniqueness of the backfitting estimators … ”. In this paper, explicit expressions for the estimators are derived. The explicit solution requires inverses of n × n matrices to solve the np × np system of normal equations. These matrix inverses are feasible to implement for moderate sample sizes and can be used in place of the backfitting algorithm.     

Exact Confidence Intervals,Based on the Z Statistic,for the Difference Between Two Proportions

We show that the confidence interval version of the extended exact unconditional Z test of Suissa and Shuster (1985) for testing the equality of two binomial proportions is due to general results of Buehler (1957), Sudakov and references cited there (1974), and Harris and Soms (1984). We apply these results to obtain exact unconditional confidence intervals for the difference between two proportions, deriving an explicit solution for the “best” outcome, make some comments on Buehler's (1957) method and give a numerical example. The Appendix contains a listing of the necessary FORTRAN programs.