Abstract
The correlational structure of a set of variables is often conveniently described by the pairwise partial correlations as they contain the same information as the Pearson correlations with the advantage of straightforward identifications of conditional linear independence. For mathematical convenience, multiple matrix representations of the pairwise partial correlations exist in the literature but their properties have not been investigated thoroughly. In this paper, we derive necessary and sufficient conditions for the eigenvalues of differently defined partial correlation matrices so that the correlation structure is a valid one. Equipped with these conditions, we will then emphasize the intricacies of algorithmic generations of correlation structures via partial correlation matrices. Furthermore, we examine the space of valid partial correlation structures and juxtapose it with the space of valid Pearson correlation structures. As these spaces turn out to be equal in volume for every dimension and equivalent with respect to rotation, a simple formula allows the creation of valid partial correlation matrices by the use of current algorithms for the generation and approximation of correlation matrices. Lastly, we derive simple conditions on the partial correlations for frequently assumed sparse structures.
Notes
1 Strictly speaking Lewis and Styan (Citation1981) only proved that However, by pre- and post-multiplying
with permutation matrices UT and U such that the i-th and j-th row/column respectively become the 1-st and 2-nd row/column we find that
since
2 These results were generated by repeatedly generating random partial correlation matrices in d dimensions in R (R Core Team Citation2018) via cor2pcor(rcorrmatrix(d)).