Complex Random Vectors and ICA Models: Identifiability, Uniqueness and Separability

In this paper the conditions for identifiability, separability and uniqueness of linear complex valued independent component analysis (ICA) models are established. These results extend the well-known conditions for solving real-valued ICA problems to complex-valued models. Relevant properties of complex random vectors are described in order to extend the Darmois-Skitovich theorem for complex-valued models. This theorem is used to construct a proof of a theorem for each of the above ICA model concepts. Both circular and noncircular complex random vectors are covered. Examples clarifying the above concepts are presented.Comment: To appear in IEEE TR-IT March 200

Asymptotic regime for impropriety tests of complex random vectors

Impropriety testing for complex-valued vector has been considered lately due to potential applications ranging from digital communications to complex media imaging. This paper provides new results for such tests in the asymptotic regime, i.e. when the vector dimension and sample size grow commensurately to infinity. The studied tests are based on invariant statistics named impropriety coefficients. Limiting distributions for these statistics are derived, together with those of the Generalized Likelihood Ratio Test (GLRT) and Roy's test, in the Gaussian case. This characterization in the asymptotic regime allows also to identify a phase transition in Roy's test with potential application in detection of complex-valued low-rank subspace corrupted by proper noise in large datasets. Simulations illustrate the accuracy of the proposed asymptotic approximations.Comment: 11 pages, 8 figures, submitted to IEEE TS

Gradient Pattern Analysis of Cosmic Structure Formation: Norm and Phase Statistics

This paper presents the preliminary results of the characterization of pattern evolution in the process of cosmic structure formation. We are applying on N-body cosmological simulations data the technique proposed by Rosa, Sharma & Valdivia (1999) and Ramos et al. (2000) to estimate the time behavior of asymmetries in the gradient field. The gradient pattern analysis is a well tested tool, used to build asymmetrical fragmentation parameters estimated over a gradient field of an image matrix able to quantify a complexity measure of nonlinear extended systems. In this investigation we work with the high resolution cosmological data simulated by the Virgo consortium, in different time steps, in order to obtain a diagnostic of the spatio-temporal disorder in the matter density field. We perform the calculations of the gradient vectors statistics, such as mean, variance, skewness, kurtosis, and correlations on the gradient field. Our main goal is to determine different dynamical regimes through the analysis of complex patterns arising from the evolutionary process of structure formation. The results show that the gradient pattern technique, specially the statistical analysis of second and third gradient moment, may represent a very useful tool to describe the matter clustering in the Universe.Comment: Accepted for publication in Physica

Uncertainty-Aware Principal Component Analysis

We present a technique to perform dimensionality reduction on data that is subject to uncertainty. Our method is a generalization of traditional principal component analysis (PCA) to multivariate probability distributions. In comparison to non-linear methods, linear dimensionality reduction techniques have the advantage that the characteristics of such probability distributions remain intact after projection. We derive a representation of the PCA sample covariance matrix that respects potential uncertainty in each of the inputs, building the mathematical foundation of our new method: uncertainty-aware PCA. In addition to the accuracy and performance gained by our approach over sampling-based strategies, our formulation allows us to perform sensitivity analysis with regard to the uncertainty in the data. For this, we propose factor traces as a novel visualization that enables to better understand the influence of uncertainty on the chosen principal components. We provide multiple examples of our technique using real-world datasets. As a special case, we show how to propagate multivariate normal distributions through PCA in closed form. Furthermore, we discuss extensions and limitations of our approach

Algebraic statistical models

Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the parameter space of a reference model with nice properties, such as for example a regular exponential family. This observation leads to the definition of an `algebraic exponential family'. This new definition provides a unified framework for the study of statistical models with algebraic structure. In this paper we review the ingredients to this definition and illustrate in examples how computational algebraic geometry can be used to solve problems arising in statistical inference in algebraic models