Search results for " MATRIX"
showing 10 items of 2053 documents
Joint Graph Learning and Signal Recovery via Kalman Filter for Multivariate Auto-Regressive Processes
2018
In this paper, an adaptive Kalman filter algorithm is proposed for simultaneous graph topology learning and graph signal recovery from noisy time series. Each time series corresponds to one node of the graph and underlying graph edges express the causality among nodes. We assume that graph signals are generated via a multivariate auto-regressive processes (MAR), generated by an innovation noise and graph weight matrices. Then we relate the state transition matrix of Kalman filter to the graph weight matrices since both of them can play the role of signal propagation and transition. Our proposed Kalman filter for MAR processes, called KF-MAR, runs three main steps; prediction, update, and le…
On the geometry of the characteristic class of a star product on a symplectic manifold
2001
The characteristic class of a star product on a symplectic manifold appears as the class of a deformation of a given symplectic connection, as described by Fedosov. In contrast, one usually thinks of the characteristic class of a star product as the class of a deformation of the Poisson structure (as in Kontsevich's work). In this paper, we present, in the symplectic framework, a natural procedure for constructing a star product by directly quantizing a deformation of the symplectic structure. Basically, in Fedosov's recursive formula for the star product with zero characteristic class, we replace the symplectic structure by one of its formal deformations in the parameter $\hbar$. We then s…
Derived variables calculated from similar joint responses: some characteristics and examples
1995
Abstract A technique (Cox and Wermuth, 1992) is reviewed for finding linear combinations of a set of response variables having special relations of linear conditional independence with a set of explanatory variables. A theorem in linear algebra is used both to examine conditions in which the derived variables take a specially simple form and lead to reduced computations. Examples are discussed of medical and psychological investigations in which the method has aided interpretation.
Tests against stationary and explosive alternatives in vector autoregressive models
2008
. The article proposes new tests for the number of unit roots in vector autoregressive models based on the eigenvalues of the companion matrix. Both stationary and explosive alternatives are considered. The limiting distributions of test statistics depend only on the number of unit roots. Size and power are investigated, and it is found that the new test against some stationary alternatives compares favourably with the widely used likelihood ratio test for the cointegrating rank. The powers are prominently higher against explosive than against stationary alternatives. Some empirical examples are provided to show how to use the new tests with real data.
Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?
2017
Summary Principal component analysis (PCA) is a method of choice for dimension reduction. In the current context of data explosion, online techniques that do not require storing all data in memory are indispensable to perform the PCA of streaming data and/or massive data. Despite the wide availability of recursive algorithms that can efficiently update the PCA when new data are observed, the literature offers little guidance on how to select a suitable algorithm for a given application. This paper reviews the main approaches to online PCA, namely, perturbation techniques, incremental methods and stochastic optimisation, and compares the most widely employed techniques in terms statistical a…
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
Archetypoids: A new approach to define representative archetypal data
2015
[EN] The new concept archetypoids is introduced. Archetypoid analysis represents each observation in a dataset as a mixture of actual observations in the dataset, which are pure type or archetypoids. Unlike archetype analysis, archetypoids are real observations, not a mixture of observations. This is relevant when existing archetypal observations are needed, rather than fictitious ones. An algorithm is proposed to find them and some of their theoretical properties are introduced. It is also shown how they can be obtained when only dissimilarities between observations are known (features are unavailable). Archetypoid analysis is illustrated in two design problems and several examples, compar…
Sign and rank covariance matrices
2000
The robust estimation of multivariate location and shape is one of the most challenging problems in statistics and crucial in many application areas. The objective is to find highly efficient, robust, computable and affine equivariant location and covariance matrix estimates. In this paper, three different concepts of multivariate sign and rank are considered and their ability to carry information about the geometry of the underlying distribution (or data cloud) are discussed. New techniques for robust covariance matrix estimation based on different sign and rank concepts are proposed and algorithms for computing them outlined. In addition, new tools for evaluating the qualitative and quant…
The affine equivariant sign covariance matrix: asymptotic behavior and efficiencies
2003
We consider the affine equivariant sign covariance matrix (SCM) introduced by Visuri et al. (J. Statist. Plann. Inference 91 (2000) 557). The population SCM is shown to be proportional to the inverse of the regular covariance matrix. The eigenvectors and standardized eigenvalues of the covariance, matrix can thus be derived from the SCM. We also construct an estimate of the covariance and correlation matrix based on the SCM. The influence functions and limiting distributions of the SCM and its eigenvectors and eigenvalues are found. Limiting efficiencies are given in multivariate normal and t-distribution cases. The estimates are highly efficient in the multivariate normal case and perform …
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.