Empirical Laws for Iterated Correlation Matrices
Ishrak Alhajj Hassan

TL;DR
This paper investigates the iterative behavior of correlation matrices, revealing empirical laws that describe its stabilization patterns and decay properties across various dimensions, despite the lack of a complete theoretical convergence proof.
Contribution
It introduces a geometric framework to analyze the nonlinear iteration and uncovers four universal empirical laws governing its behavior across dimensions.
Findings
Iteration stabilizes at a block pattern
Displays finite total variation
Rapid decay near fixed points
Abstract
We study the discrete dynamical system obtained by repeatedly applying the Pearson correlation operator to a real matrix. Each step centers every row, normalizes each centered row to unit Euclidean norm, and forms the Gram matrix of the resulting rows. This produces a nonlinear map that underlies the classical CONCOR and GAP procedures. Despite its simple formulation and long history, the global behavior of this iteration has remained analytically unresolved. We present a geometric formulation that separates directions associated with changes in row means and row norms from directions that preserve them. This formulation clarifies why local analysis does not extend to a global convergence theorem: the iteration is nonlinear, the structure of its fixed-point set is not fully characterized, and standard uniform contractive or Fejer-type techniques do not directly apply. Empirically,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Stochastic Gradient Optimization Techniques · Random Matrices and Applications
