Finite-Step Bounds for Iterated Correlation Matrices
Abstract
We establish finite-step probabilistic upper bounds on the contraction ratios k = k+1/k for iterated Pearson correlation dynamics. Let (Pk)k 0 be the sequence generated by the Pearson update. Define k := \|Pk+1-Pk\|F, k := k+1/k for k > 0, and δk := k/n. Although k 0 along convergent trajectories, the ratios 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 P0 with i.i.d. U[-1,1] entries and let P be the induced measure. For k 2, we construct state-dependent bounds Bp : R+ R+ satisfying P(k Bp(δk)) p. The functions Bqp(δ) are empirical conditional p-quantiles of k given δk under logarithmic binning. Larger families BTCp,τ(δ) and Btolp,τ(δ) are obtained via multiplicative adjustments, yielding pointwise larger bounds that preserve the δ-dependence. Validation on held-out trajectories confirms the bounds hold with empirical coverage matching nominal levels for all n ∈ [3,2000]. The baseline 0.95-quantile bound Bq0.95(δ) yields two concrete results: P( 1 δ 0.03) 0.95 uniformly in n, and P( 1.7) 0.95 for 21 of 22 dimensions. The exception n = 69 attains 2.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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.