Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 38 min ago
PreprintCC BY 4.0arXiv

A Balanced Parametrization of Correlation Matrices

Abstract

We introduce the balanced correlation parametrization (BCP), which maps positive-definite correlation matrices one-to-one onto the set of symmetric hollow (zero-diagonal) matrices with unrestricted off-diagonal entries. A key feature of the parametrization is that both the transformation and its inverse are available in closed form. It can be viewed as a generalization of the transformation underlying the classical correlation t-statistic to higher dimensions. It has a direct interpretation as a scaled sum of marginal and partial correlations, is inverse-consistent and equivariant under variable permutations and sign changes, and preserves block structure. A novel property of BCP is that it preserves correlation sparsity as the dimension tends to infinity under suitable factor conditions, providing a basis for sparse high-dimensional correlation modeling. An empirical illustration using standardized idiosyncratic daily stock returns for 1,765 equities over 15 years shows that BCP retains the approximate sparsity pattern and magnitudes of shock correlations, and that it yields accurate positive-definite reconstructions under sparse coordinate restrictions.

Related

  1. Universality of the cokernels of random p-adic matrices with inhomogeneously balanced columns
    Jungin Lee, Sungjin Park
    arXivPreprintarXiv licenceFull textAlgebra & number theoryProbabilityarXiv
  2. Two short proofs of incompatibility for correlation matrices
    Cedric Phillips
    arXivPreprintCC BY 4.0Full textProbabilityStatisticsarXiv
  3. Asymptotic spectral properties and extreme eigenvalues of sample correlation matrices from nonstationary high-dimensional VAR processes
    Ruihan Liu, Chen Wang
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Regime-Aware Estimation of Large Equity Correlation Matrices: Tail-Pairwise Dependence and Dynamic Conditional Correlation Decomposition for Water and Energy Sectors
    Katherine B. Ensor, Quadri Popoola, Meredith Kruse +1
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  5. On the Geometry of Low Rank Correlation Matrices
    Olivier Bisson, David Loiseaux, Xavier Pennec
    arXivPreprintCC BY 4.0Full textGeometry & topologyarXiv
BibTeX
@misc{hansen2026balanced,
  title = {{A Balanced Parametrization of Correlation Matrices}},
  author = {Peter Reinhard Hansen and Chen Tong},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.14511},
  eprint = {2610.14511},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.14511},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - A Balanced Parametrization of Correlation Matrices
AU  - Peter Reinhard Hansen
AU  - Chen Tong
PY  - 2026
DA  - 2026/10/25
PB  - arXiv
DO  - 10.48550/arxiv.2610.14511
UR  - https://arxiv.org/abs/2610.14511
AB  - We introduce the balanced correlation parametrization (BCP), which maps positive-definite correlation matrices one-to-one onto the set of symmetric hollow (zero-diagonal) matrices with unrestricted off-diagonal entries. A key feature of the parametrization is that both the transformation and its inverse are available in closed form. It can be viewed as a generalization of the transformation underlying the classical correlation t-statistic to higher dimensions. It has a direct interpretation as a scaled sum of marginal and partial correlations, is inverse-consistent and equivariant under variable permutations and sign changes, and preserves block structure. A novel property of BCP is that it preserves correlation sparsity as the dimension tends to infinity under suitable factor conditions, providing a basis for sparse high-dimensional correlation modeling. An empirical illustration using standardized idiosyncratic daily stock returns for 1,765 equities over 15 years shows that BCP retains the approximate sparsity pattern and magnitudes of shock correlations, and that it yields accurate positive-definite reconstructions under sparse coordinate restrictions.
ER  -