English

Finite-Step Bounds for Iterated Correlation Matrices

Statistics Theory 2026-04-16 v1 Dynamical Systems Statistics Theory

Abstract

We establish finite-step probabilistic upper bounds on the contraction ratios ρk=Δk+1/Δk\rho_k = \Delta_{k+1}/\Delta_k for iterated Pearson correlation dynamics. Let (Pk)k0(P_k)_{k\ge 0} be the sequence generated by the Pearson update. Define Δk:=Pk+1PkF\Delta_k := \|P_{k+1}-P_k\|_F, ρk:=Δk+1/Δk\rho_k := \Delta_{k+1}/\Delta_k for Δk>0\Delta_k > 0, and δk:=Δk/n\delta_k := \Delta_k/n. Although Δk0\Delta_k \to 0 along convergent trajectories, the ratios ρk\rho_k may exceed unity in finitely many steps. This behavior is invisible to local linearization. Our main contribution is a probabilistic bounding framework that captures these finite-step expansions. We initialize P0P_0 with i.i.d. U[1,1]\mathcal{U}[-1,1] entries and let P\mathbb{P} be the induced measure. For k2k \ge 2, we construct state-dependent bounds Bp:R+R+B_p : \mathbb{R}_+ \to \mathbb{R}_+ satisfying P(ρkBp(δk))p\mathbb{P}(\rho_k \le B_p(\delta_k)) \ge p. The functions Bpq(δ)B^{\mathrm{q}}_p(\delta) are empirical conditional pp-quantiles of logρk\log \rho_k given δk\delta_k under logarithmic binning. Larger families Bp,τTC(δ)B^{\mathrm{TC}}_{p,\tau}(\delta) and Bp,τtol(δ)B^{\mathrm{tol}}_{p,\tau}(\delta) are obtained via multiplicative adjustments, yielding pointwise larger bounds that preserve the δ\delta-dependence. Validation on held-out trajectories confirms the bounds hold with empirical coverage matching nominal levels for all n[3,2000]n \in [3,2000]. The baseline 0.950.95-quantile bound B0.95q(δ)B^{\mathrm{q}}_{0.95}(\delta) yields two concrete results: P(ρ1δ0.03)0.95\mathbb{P}(\rho \le 1 \mid \delta \le 0.03) \ge 0.95 uniformly in nn, and P(ρ1.7)0.95\mathbb{P}(\rho \le 1.7) \ge 0.95 for 21 of 22 dimensions. The exception n=69n = 69 attains 2.352.35, revealing a rare extreme upper tail discontinuity not captured by asymptotic analysis. These are the first finite-step probabilistic bounds for Pearson correlation dynamics. The framework is fully reproducible with provided code and data.

Keywords

Cite

@article{arxiv.2604.14071,
  title  = {Finite-Step Bounds for Iterated Correlation Matrices},
  author = {Ishrak AlhajjHassan},
  journal= {arXiv preprint arXiv:2604.14071},
  year   = {2026}
}
R2 v1 2026-07-01T12:11:05.752Z