Crisis cycles in the slightly unstable block random model

ABSTRACT

The paper proposes a new approach for studying the time to time appearing breakdowns in economy. Block random model can describe stability of large complicated systems with variable number of participants. Theoretical background of the model is given by a theorem about the eigenvalues of block random matrices [Juhász F. On the characteristic values of non-symmetric block random matrices. J Theoret Probab. 1990;67:199–205; On the structural eigenvalues of block random matrices. Linear Algebra Appl. 1996;246:225–231]. The model takes into account not only effects of participants but of groups formed from them as well. Slight instability means group level stability and participant level instability [Juhász F. On the turbulence of slightly unstable block random systems. In: Taylor C, et al., editors. Numerical methods for laminar and turbulent flow. Atlanta; 1995. p. 113–121]. Lability index of block random systems is introduced for measuring instability. It is showed that lability index of a slightly unstable block random model is growing while number of participants increases. Alteration in the number of participants makes it possible to describe crisis cycles.     

A limit theorem on moment convergence of centered spectral statistics of random matrices

ABSTRACT

The eigenvalues of a random matrix are a sequence of specific dependent random variables, the limiting properties of which are one of interesting topics in probability theory. The aim of the article is to extend some probability limiting properties of i.i.d. random variables in the context of the complete moment convergence to the centered spectral statistics of random matrices. Some precise asymptotic results related to the complete convergence of p-order conditional moment of Wigner matrices and sample covariance matrices are obtained. The proofs mainly depend on the central limit theorem and large deviation inequalities of spectral statistics.     

Transformation of non positive semidefinite correlation matrices

In multivariate statistics, estimation of the covariance or correlation matrix is of crucial importance. Computational and other arguments often lead to the use of coordinate-dependent estimators, yielding matrices that are symmetric but not positive semidefinite. We briefly discuss existing methods, based on shrinking, for transforming such matrices into positive semidefinite matrices, A simple method based on eigenvalues is also considered. Taking into account the geometric structure of correlation matrices, a new method is proposed which uses techniques similar to those of multidimensional scaling.     

Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections

ABSTRACT

This article describes a new algorithm for generating correlation matrices with specified eigenvalues. The algorithm uses the method of alternating projections (MAP) that was first described by Neumann. The MAP algorithm for generating correlation matrices is both easy to understand and to program in higher-level computer languages, making this method accessible to applied researchers with no formal training in advanced mathematics. Simulations indicate that the new algorithm has excellent convergence properties. Correlation matrices with specified eigenvalues can be profitably used in Monte Carlo research in statistics, psychometrics, computer science, and related disciplines. To encourage such use, R code (R Core Team) for implementing the algorithm is provided in the supplementary material.     

On the rank-deficient canonical correlation technique solved by analytic spectral decomposition

Regularization is a well-known and used statistical approach covering individual points or limit approximations. In this study, the canonical correlation analysis (CCA) process of the paths is discussed with partial least squares (PLS) as the other boundary covering transformation to a symmetric eigenvalue (or singular value) problem dependent on a parameter. Two regularizations of the original criterion in the parameterization domain are compared, i.e. using projection and by identity matrix. We discuss the existence and uniqueness of the analytic path for eigenvalues and corresponding elements of eigenvectors. Specifically, canonical analysis is applied to an ill-conditioned case of singular within-sets input matrices encompassing tourism accommodation data.KEYWORDS: Multivariate analysis, canonical correlation analysis, optimization, analytic decomposition, paths of eigenvalues and eigenvectors, tourismMSC Classifications: 62H20, 46N10, 62P20     

时变空间权重矩阵面板数据模型稳健LM检验有效性研究

空间权重矩阵是描述个体间空间关系的重要工具,通常基于个体间的地理距离构造不随时间而改变的空间权重矩阵。然而,当个体间的空间关系源自经济/社会/贸易距离或人口流动性/气候等特征时,空间权重矩阵本质上可能将随时间而改变。由此,本研究提出时变空间权重矩阵面板数据模型的稳健LM检验。大量Monte Carlo模拟结果显示：从检验水平和功效角度来看,基于误设的非时变空间权重矩阵的稳健LM检验存在较大偏差,但是基于时变空间权重矩阵的稳健LM检验能够有效地识别面板数据中的空间关系类型。尤其是,在时间较长和个体较多等情况下,时变空间权重矩阵的稳健LM检验功效更高。     

Comparison of designs equivalent under one or two criteria

Two designs equivalent under one or two criteria may be compared under other criteria. For certain configurations of eigenvalues of the information matrices, we decide which design is the better of the two for many other such criteria. The relationship to universal optimality (in the case of equivalence under one criterion) is indicated. For two criteria, applications are given to weighing and treatment-with-covariate settings.     

A hierarchical eigenmodel for pooled covariance estimation

Summary.  Although the covariance matrices corresponding to different populations are unlikely to be exactly equal they can still exhibit a high degree of similarity. For example, some pairs of variables may be positively correlated across most groups, whereas the correlation between other pairs may be consistently negative. In such cases much of the similarity across covariance matrices can be described by similarities in their principal axes, which are the axes that are defined by the eigenvectors of the covariance matrices. Estimating the degree of across-population eigenvector heterogeneity can be helpful for a variety of estimation tasks. For example, eigenvector matrices can be pooled to form a central set of principal axes and, to the extent that the axes are similar, covariance estimates for populations having small sample sizes can be stabilized by shrinking their principal axes towards the across-population centre. To this end, the paper develops a hierarchical model and estimation procedure for pooling principal axes across several populations. The model for the across-group heterogeneity is based on a matrix-valued antipodally symmetric Bingham distribution that can flexibly describe notions of 'centre' and 'spread' for a population of orthogonal matrices.     

基于矩阵式资金流量表的涉外交易考察

 资金流量核算是国民经济核算体系的重要组成部分,但中国已公布的账户式资金流量表不能反映机构部门间收入流量交易与金融投资交易状况,通过编制国民收入流量矩阵与金融资金流量矩阵,能够对机构部门间的收入分配交易与金融投资交易情况进行深入考察。本文通过编制1992年至2008年涉外交易国民收入流量矩阵和金融资金流量矩阵考察了国外部门参与国民收入分配、金融资金流动过程的情况,得出了一些账户式资金流量表难以呈现的结论。     

A Note on Comparison of (Non) Linear Estimators Using Pitman's Measure of Closeness

We present some sufficient and necessary conditions under which some linear (or nonlinear) estimators (see Sections 2 and 3) dominate (are better than) others in the sense of PMC. Its applications in linear regressions are also discussed. Furthermore, we obtain results about the eigenvalues of two matrices, which seem to be hard to be prove through pure matrix theory.     

Spatial circulants, with applications

The cumulants of quadratic forms associated to the so-called spatial design matrices are often needed for inference in the context of isotropic processes on uniform grids. Because the eigenvalues of the matrices involved are generally unknown, the computation of the cumulants can be very demanding if the grids are large. This paper first replaces the spatial design matrices with circular counterparts having known eigenvalues. It then studies some of the properties of the approximating matrices, and analyzes their performance in a number of applications to well-known inferential procedures.     

First-order autoregressive models: A method for obtaining eigenvalues for weighting matrices

Autoregressive models are useful for analysing agricultural field experiments. However, in order to formulate such models, there is a need to specify certain weights reflecting the degree of interaction between neighbouring plots. The eigenvalues for the matrices formed by such weights are usually needed. The paper describes a method for obtaining these eigenvalues, for certain regular patterns.     

The eigenstructure of block-structured correlation matrices and its implications for principal component analysis

Block-structured correlation matrices are correlation matrices in which the p variables are subdivided into homogeneous groups, with equal correlations for variables within each group, and equal correlations between any given pair of variables from different groups. Block-structured correlation matrices arise as approximations for certain data sets’ true correlation matrices. A block structure in a correlation matrix entails a certain number of properties regarding its eigendecomposition and, therefore, a principal component analysis of the underlying data. This paper explores these properties, both from an algebraic and a geometric perspective, and discusses their robustness. Suggestions are also made regarding the choice of variables to be subjected to a principal component analysis, when in the presence of (approximately) block-structured variables.     

Universal optimality of experimental designs: Definitions and a criterion

Several definitions of universal optimality of experimental designs are found in the Literature; we discuss the interrelations of these definitions using a recent characterization due to Friedland of convex functions of matrices. An easily checked criterion is given for a design to satisfy the main definition of universal optimality; this criterion says that a certain set of linear functions of the eigenvalues of the information matrix is maximized by the information matrix of a design if and only if that design is universally optimal. Examples are given; in particular we show that any universally optimal design is (M, S)-optimal in the sense of K. Shah.     

Further theoretical results and a comparison between two methods for approximating eigenvalues of perturbed covariance matrices

Covariance matrices, or in general matrices of sums of squares and cross-products, are used as input in many multivariate analyses techniques. The eigenvalues of these matrices play an important role in the statistical analysis of data including estimation and hypotheses testing. It has been recognized that one or few observations can exert an undue influence on the eigenvalues of a covariance matrix. The relationship between the eigenvalues of the covariance matrix computed from all data and the eigenvalues of the perturbed covariance matrix (a covariance matrix computed after a small subset of the observations has been deleted) cannot in general be written in closed-form. Two methods for approximating the eigenvalues of a perturbed covariance matrix have been suggested by Hadi (1988) and Wang and Nyquist (1991) for the case of a perturbation by a single observation. In this paper we improve on these two methods and give some additional theoretical results that may give further insight into the problem. We also compare the two improved approximations in terms of their accuracies.     

CONVERGENCE AND PREDICTION OF PRINCIPAL COMPONENT SCORES IN HIGH-DIMENSIONAL SETTINGS

A number of settings arise in which it is of interest to predict Principal Component (PC) scores for new observations using data from an initial sample. In this paper, we demonstrate that naive approaches to PC score prediction can be substantially biased towards 0 in the analysis of large matrices. This phenomenon is largely related to known inconsistency results for sample eigenvalues and eigenvectors as both dimensions of the matrix increase. For the spiked eigenvalue model for random matrices, we expand the generality of these results, and propose bias-adjusted PC score prediction. In addition, we compute the asymptotic correlation coefficient between PC scores from sample and population eigenvectors. Simulation and real data examples from the genetics literature show the improved bias and numerical properties of our estimators.     

A generalized scheffé method of multiple comparisons

Standard resulrs on the extrema of quotients of quadratic forms are extended to the non-negative definite case. The maximum and the set over which it is achieved are characterized explicitly both in terms of generalized inverse matrices and generalized eigenvalues. These results become the basis of Scheffe type multiple comparisons in the usual way. To demonstrate their application to statistics with singular covariance matrices, the method is detailed for Mantel-Haenszel, Breslow, and Cox statistics. An example is presented illustrating a situation where the proposed Scheffe type comparisons may be better than the pairwise method.     

Enriched biplots for canonical correlation analysis

This paper discusses biplots of the between-set correlation matrix obtained by canonical correlation analysis. It is shown that these biplots can be enriched with the representation of the cases of the original data matrices. A representation of the cases that is optimal in the generalized least squares sense is obtained by the superposition of a scatterplot of the canonical variates on the biplot of the between-set correlation matrix. Goodness of fit statistics for all correlation and data matrices involved in canonical correlation analysis are discussed. It is shown that adequacy and redundancy coefficients are in fact statistics that express the goodness of fit of the original data matrices in the biplot. The within-set correlation matrix that is represented in standard coordinates always has a better goodness of fit than the within-set correlation matrix that is represented in principal coordinates. Given certain scalings, the scalar products between variable vectors approximate correlations better than the cosines of angles between variable vectors. Several data sets are used to illustrate the results.     

Some applications,properties and conjectures for higher order cumulants of a markovian stepping-stone model

This paper investigates certain tridiagonal coefficient matrices from linear differential equations for the joint cumulants of a Markovian stepping-stone model. The model is used to describe the dynamics of insect population growth, and is illustrated with an application to the spread of Africanized honey bees. The coefficient matrices are shown to have certain structure. A conjecture concerning their eigenvalues is proven for a special case of interest, and is also investigated numerically and by symbolic mathematical analysis.