REVIEW 3 major objections 4 minor 40 references
Eigenvector Overlaps of Random Covariance Matrices and their Submatrices
T0 review · 3 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash
Pith's one-line read For Gaussian covariance matrices and their row/column submatrices, this paper derives explicit asymptotic formulas for the rescaled mean squared singular-vector overlaps in the bulk, reducing in the zero-signal case to Cauchy-like…
desk verdict A genuinely new set of explicit overlap formulas for Wishart submatrices, built on a clean but not fully rigorous resolvent argument; the missing convergence proof is the price of admission. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The argument is carried by three double Stieltjes transforms of the squared overlaps, $S_V,S_U,S_W$, with poles at the eigenvalues of the full and truncated matrices; these resolvents smooth the microscopic oscillations and encode all overlap information. Using the Brownian dynamics of the singular values and vectors, the paper derives a deterministic coupled system of partial differential equations for the limiting resolvents (system (3.1)), and solves it explicitly by the method of characteristics, whose characteristics coincide with those of the Burgers equations satisfied by the spectral densities. An inversion formula then extracts the overlap functions $\bar V,\bar U,\bar W$ from the resolvents. In the zero-initial-matrix case the resolvents at time zero are simple rational functions, and the inversion reduces to elementary algebra involving the Hilbert transforms of the two Marchenko-Pastur densities.
What would settle it
For $A=0$, fix $q=0.9$, $\alpha=0.4$, $\beta=0.8$, $t=3$, choose two bulk quantiles $x,y$, and for $N=100,400,1600$ simulate many independent Gaussian matrices; compute the sample mean of $N\langle \tilde v_i|v_j\rangle^2$ and compare with the right side of (3.3). If the finite-$N$ values do not approach the predicted rational function, or approach a different denominator, the claimed limit is false.
Extended reading notes
Core claim
On the paper's own terms, the discovery is that the limiting rescaled mean squared overlaps are explicit, parameterized by the macroscopic ratios $q=\lim N/M$, $\alpha=\lim n/N$, $\beta=\lim m/M$ and the observation time $t$ (the variance of the added noise). For $A=0$, for $\lambda,\mu>0$ in the bulk, it derives $$N\mathbb{E}[\langle \tilde v_i|v_j\$rangle^{2}$]\to q\,\frac{(1-\$\alpha$)t\bar{\mu}+\$\alpha$(1-\$\beta$)t\bar{\$\lambda$}+(1-\$\alpha$\$\beta$)(\$\alpha$+1/q)$t^{2}$}{(1-\$\alpha$\$\beta$)^$2t^{2}$+q(\bar{\$\lambda$}-\bar{\mu})(\$\alpha$\$\beta$\bar{\$\lambda$}-\bar{\mu})},$$ with $\bar{\lambda}=\lambda-(1+1/q)t$ and $\bar{\mu}=\mu-(\alpha+\beta/q)t$; the left-overlap $\bar U$ and cross-overlap $\bar W$ satisfy analogous formulas with the same denominator, the cross-overlap having numerator $q(1-\alpha\beta)t\sqrt{\lambda\mu}$. The same machinery gives formulas for any deterministic initial matrix $A$, expressed through the initial values of three resolvents, so a nonzero $A$ changes the overlap formulas only through those initial resolvent data.
Load-bearing premise
The load-bearing premise is that the three resolvents converge to deterministic limits satisfying the closed PDE system (3.1); the paper shows several error terms vanish through variance bounds, but it gives no separate tightness or uniqueness proof for the limiting stochastic processes, and the inversion step would fail if that convergence did not hold.
Editorial extensions
If this is right
- Deleting a fraction $1-\beta$ of the $M$ rows and $1-\alpha$ of the $N$ columns preserves singular-vector alignment at order $1/N$ in the bulk, with a universal prefactor fixed by $q,\alpha,\beta$ and the two limiting densities.
- For fixed bulk eigenvalues $\lambda,\mu$, the overlap formulas depend on the deletion fractions only through the shifted variables $\bar{\lambda},\bar{\mu}$ and explicit pre-factors, so the structure of the decay is read off without simulation.
- Incremental and missing-data PCA can compute the expected squared alignment between full-data and submatrix principal components for large Gaussian data directly from the rational expressions.
- For nonzero initial matrix $A$, the method yields explicit overlaps whenever the initial resolvents $S_V,S_U,S_W(\cdot,\cdot,0)$ are computable, covering noisy observations of a deterministic signal.
Reading between the lines
- Beyond the paper: the rational formulas could be turned into a finite-sample diagnostic for PCA with missing data, substituting observed bulk eigenvalues into the expression and comparing predicted with measured squared overlaps.
- A testable extension is whether the leading Cauchy-like form survives for non-Gaussian entries with matching covariance; the Brownian-dynamics proof may change subleading terms while preserving the limiting rational function.
- Because the null-space overlap formulas in (3.4) depend on the chosen basis for the null space, applications tracking zero singular values will need a basis-independent summary rather than the raw formulas.
- The resolvent system identifies the limiting overlap field, not just its expectation, so one could push the same characteristic method to derive fluctuations or joint laws of the overlaps.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the overlaps between singular vectors of a rectangular Gaussian matrix X_t = A + N^{-1/2}B_t and of its m x n submatrix \tilde X_t, in the macroscopic regime N/M -> q, n/N -> alpha, m/M -> beta. It introduces the squared overlaps V, U, W and their double Stieltjes transforms S_V, S_U, S_W, derives Itô dynamics, and claims that in the scaling limit these transforms satisfy the deterministic PDE system (3.1). Solving this system and applying an inversion formula yields explicit formulas for the limiting rescaled mean squared overlaps for a general initial matrix A, formulas (3.2), which in the case A=0 reduce to the Marchenko-Pastur expressions (3.3). The paper also reports numerical simulations that agree well with the A=0 formulas.
Significance. The main formulas are explicit and parameter-free: q, alpha, beta and t are model inputs, not fitted constants, and the A=0 result gives Cauchy-like closed forms for bulk overlaps that are directly testable by simulation. This extends the authors' earlier Wigner/submatrix analysis to Wishart-type covariance matrices and to left/right/cross overlaps, and addresses a natural question with applications to PCA of submatrices, missing data and incremental PCA. The algebraic resolution of the PDE system and the appendix computations are detailed and internally coherent. The main weakness is that the rigorous justification of the convergence step is missing, so the central claim currently rests on an ansatz.
major comments (3)
- [Section 3.1 and Appendix D] The load-bearing step is the claim that the empirical double resolvents S_V^(N), S_U^(N), S_W^(N) converge to deterministic limits and that these limits solve (3.1). Section 3.1 only states that 'We typically expect these quantities to converge to deterministic integrals', and Appendix D derives the PDE by replacing finite-N products such as S_V^(N)S_W^(N) by products of limiting values, for example in the convergence of I_mu_lambda to 2 S_W S_V. No tightness, uniform-integrability, or uniqueness argument is supplied for the processes, and no variance bound for S^(N) - E S^(N) is given. Since the inversion formulas for \bar V, \bar U, \bar W are valid only if the empirical resolvents actually converge to the objects being inverted, this gap is load-bearing for (3.2) and (3.3).
- [Appendix D, paragraph on Brownian terms] The Borel-Cantelli argument for the martingale increments dI_w is not sufficient. The bound E|dI_w|^2 = O(1/N^2) controls the square of the increment over an infinitesimal time interval at a fixed time, not the time-uniform convergence of the integrated process needed to identify the limiting PDE. To drop these terms in the limit equation one would need a maximal inequality or a convergence theorem for the semimartingales S^(N).
- [Section 2 and Appendix B] For the general-initial-condition formulas (3.2), the derivation also assumes that the empirical eigenvalue densities converge and satisfy the limiting Burgers equations (2.4) and (2.6). Appendix B computes the Itô formula and then passes to the limit formally. For A=0 this is known Marchenko-Pastur theory, but for arbitrary A the propagation of convergence of the empirical spectral measure is not proved, so the 'any initial matrix A' claim is not fully established.
minor comments (4)
- [Section 3.2] The text states that the three expressions in (3.3) 'are still valid in any other case', but the derivation is carried out only under M >= N and m >= n; please state the precise symmetry argument or mark this as a conjecture.
- [Section 3.1, after (3.1)] The notation S0(t) introduced after (3.1) is ambiguous because S0 is used for each of the three transforms; use S0_V, S0_U, S0_W in the displayed solution.
- [Figure 1] The figure would be more informative with error bars or a quantitative discrepancy measure; the caption's 'fit is excellent' is not supported by numbers.
- [Equations (3.3)] The indexing in the limit statements (3.3) should make the bulk positions explicit: i_N/n -> x and j_N/N -> y, with mu and lambda the limiting quantile values, rather than merely mu_iN -> mu.
Circularity Check
No significant circularity: formulas (3.3) follow from explicit t=0 resolvents and standard Marchenko-Pastur data; the unproven resolvent convergence is a correctness gap, not a circular reduction.
full rationale
The derivation of (3.3) is self-contained and free of fitted inputs. In the Marchenko-Pastur case, the limiting resolvents are obtained by solving the coupled system (3.1) with explicit initial values SV(z,~z,0)=alpha/(z~z), SU(z,~z,0)=beta/(q z~z), SW(z,~z,0)=0, which follow from X0=0 and the chosen orthonormal bases, and with spectral densities and Stieltjes transforms given by the standard Marchenko-Pastur law. The parameters q, alpha, beta and t are model inputs, not fitted constants, so the headline overlap formulas are genuine predictions rather than re-parameterized data. The inversion formulas are attributed to the independent work [10] (Bun-Bouchaud-Potters) and to the authors' previous paper [4] only as a methodological template; the resolvent construction is re-derived here in Appendices C-D, so the self-citation is not load-bearing. The paper's main limitation is that Section 3.1 states 'We typically expect these quantities to converge to deterministic integrals,' and Appendix D proves bounds on selected Brownian and remainder terms but does not supply a full tightness/uniqueness argument identifying finite-N resolvents with the solution of (3.1). This is a missing convergence proof and therefore a correctness risk, but it is not circularity: no final formula is equal by construction to an input, and no fitted parameter is renamed as a prediction. Independent numerical simulations reported in Figure 1 provide external support for the closed forms.
Assumptions & free parameters
assumptions (4)
- domain assumption The empirical spectra of A^T A and of the submatrix initial condition converge to continuous densities rho(lambda,0) and tilde_rho(mu,0).
- standard math The eigenvalue and eigenvector dynamics of X_t are given by Bru's equations (2.1)-(2.2), including the zero-eigenvalue convention for the left singular vectors.
- ad hoc to paper The double resolvent processes S_V, S_U, S_W self-average to deterministic limits, and products of empirical limits converge to products of the limits.
- standard math The double-Stieltjes inversion formula from [10] recovers bar_V, bar_U, bar_W from the limiting resolvents.
Cite this review
Pith. "Pith review of Eigenvector Overlaps of Random Covariance Matrices and their Submatrices." pith.science (2026). https://pith.science/paper/HWSPCRVA
@misc{pith2026250108768,
author = {Pith},
title = {Pith review of: Eigenvector Overlaps of Random Covariance Matrices and their Submatrices},
year = {2026},
howpublished = {\url{https://pith.science/paper/HWSPCRVA}},
note = {Machine review of arXiv:2501.08768}
}
abstract
We consider the singular vectors of any $m \times n$ submatrix of a rectangular $M \times N$ Gaussian matrix and study their asymptotic overlaps with those of the full matrix, in the macroscopic regime where $N \,/\, M\,$, $m \,/\, M$ as well as $n \,/\, N$ converge to fixed ratios. Our method makes use of the dynamics of the singular vectors and of specific resolvents when the matrix coefficients follow Brownian trajectories. We obtain explicit forms for the limiting rescaled mean squared overlaps for right and left singular vectors in the bulk of both spectra, for any initial matrix $A\,$. When it is null, this corresponds to the Marchenko-Pastur setup for covariance matrices, and our formulas simplify into Cauchy-like functions.
Figures
Reference graph
Works this paper leans on
-
[4]
Elie Attal and Romain Allez. Interlacing eigenvectors of large gaussian matrices.Journal of Physics A: Mathematical and Theoretical, 2024
work page 2024
-
[1]
Mark Adler, Pierre Van Moerbeke, and Dong Wang. Random matrix minor processes related to percolation theory.Random Matrices: Theory and Applications, 2(04):1350008, 2013
work page 2013
-
[2]
The eigenvectors of gaussian matri- ces with an external source.arXiv preprint arXiv:1412.7108, 2014
Romain Allez, Joël Bun, and Jean-Philippe Bouchaud. The eigenvectors of gaussian matri- ces with an external source.arXiv preprint arXiv:1412.7108, 2014
arXiv 2014
-
[3]
Incremental pca for on-line visual learning and recognition
Matej Artac, Matjaz Jogan, and Ales Leonardis. Incremental pca for on-line visual learning and recognition. In2002 International Conference on Pattern Recognition, volume 3, pages 781–784. IEEE, 2002
work page 2002
-
[5]
Spectral analysis of large dimensional random matrices, volume 20
ZhidongBaiandJackWSilverstein. Spectral analysis of large dimensional random matrices, volume 20. Springer, 2010
work page 2010
-
[6]
Phase transition of the largest eigen- value for nonnull complex sample covariance matrices
Jinho Baik, Gérard Ben Arous, and Sandrine Péché. Phase transition of the largest eigen- value for nonnull complex sample covariance matrices. 2005
work page 2005
-
[7]
Financial applications of random matrix theory: a short review.arXiv preprint arXiv:0910.1205, 2009
Jean-Philippe Bouchaud and Marc Potters. Financial applications of random matrix theory: a short review.arXiv preprint arXiv:0910.1205, 2009
arXiv 2009
-
[8]
Marie-France Bru. Diffusions of perturbed principal component analysis.Journal of mul- tivariate analysis, 29(1):127–136, 1989. 30
work page 1989
Show all 40 references
-
[9]
Rotational invari- ant estimator for general noisy matrices
Joël Bun, Romain Allez, Jean-Philippe Bouchaud, and Marc Potters. Rotational invari- ant estimator for general noisy matrices. IEEE Transactions on Information Theory, 62(12):7475–7490, 2016
2016
-
[10]
Overlaps between eigenvectors of correlated random matrices.Physical Review E, 98(5):052145, 2018
Joël Bun, Jean-Philippe Bouchaud, and Marc Potters. Overlaps between eigenvectors of correlated random matrices.Physical Review E, 98(5):052145, 2018
2018
-
[11]
Asymptotic analysis for extreme eigenvalues of principal minors of random matrices.The Annals of Applied Probability, 31(6):2953–2990, 2021
T Tony Cai, Tiefeng Jiang, and Xiaoou Li. Asymptotic analysis for extreme eigenvalues of principal minors of random matrices.The Annals of Applied Probability, 31(6):2953–2990, 2021
2021
-
[12]
Overviewofpca-basedstatisticalprocess- monitoring methods for time-dependent, high-dimensional data.Journal of Quality Tech- nology, 47(4):318–335, 2015
BartDeKetelaere, MiaHubert, andEricSchmitt. Overviewofpca-basedstatisticalprocess- monitoring methods for time-dependent, high-dimensional data.Journal of Quality Tech- nology, 47(4):318–335, 2015
2015
-
[13]
Sectoral portfolio optimization by judicious selection of financial ratios via pca.Optimization and Engineering, 25(3):1431– 1468, 2024
Vrinda Dhingra, Amita Sharma, and Shiv K Gupta. Sectoral portfolio optimization by judicious selection of financial ratios via pca.Optimization and Engineering, 25(3):1431– 1468, 2024
2024
-
[14]
On the largest-eigenvalue process for generalized wishart random matrices
AB Dieker and J Warren. On the largest-eigenvalue process for generalized wishart random matrices. arXiv preprint arXiv:0812.1504, 2008
2008 arXiv
-
[15]
Moments of minors of wishart matrices
Mathias Drton, Hélène Massam, and Ingram Olkin. Moments of minors of wishart matrices. 2008
2008
-
[16]
Largedeviationsupperboundsforthelawsofmatrix- valued processes and non-communicative entropies.The Annals of Probability, 29(3):1205– 1261, 2001
TCabanalDuvillardandAGuionnet. Largedeviationsupperboundsforthelawsofmatrix- valued processes and non-communicative entropies.The Annals of Probability, 29(3):1205– 1261, 2001
2001
-
[17]
A brownian-motion model for the eigenvalues of a random matrix
Freeman J Dyson. A brownian-motion model for the eigenvalues of a random matrix. Journal of Mathematical Physics, 3(6):1191–1198, 1962
1962
-
[18]
Pca model building with miss- ing data: New proposals and a comparative study.Chemometrics and Intelligent Laboratory Systems, 146:77–88, 2015
Abel Folch-Fortuny, Francisco Arteaga, and Alberto Ferrer. Pca model building with miss- ing data: New proposals and a comparative study.Chemometrics and Intelligent Laboratory Systems, 146:77–88, 2015
2015
-
[19]
Brownian motion in a weyl chamber, non-colliding particles, and random matrices
David J Grabiner. Brownian motion in a weyl chamber, non-colliding particles, and random matrices. In Annales de l’IHP Probabilités et statistiques, volume 35, pages 177–204, 1999
1999
-
[20]
Incremental eigenanalysis for classification
Peter M Hall, A David Marshall, and Ralph R Martin. Incremental eigenanalysis for classification. In BMVC, volume 98, pages 286–295. Citeseer, 1998
1998
-
[21]
Largest eigenvalues of principal minors of deformed gaussian orthogonal ensembles and wishart matrices
Tiefeng Jiang and Yongcheng Qi. Largest eigenvalues of principal minors of deformed gaussian orthogonal ensembles and wishart matrices. arXiv preprint arXiv:2410.15160, 2024
2024 arXiv
-
[22]
On the distribution of the largest eigenvalue in principal components analysis
Iain M Johnstone. On the distribution of the largest eigenvalue in principal components analysis. The Annals of statistics, 29(2):295–327, 2001
2001
-
[23]
Randommatrix theory and financial correlations.International Journal of Theoretical and Applied Finance, 3(03):391–397, 2000
LaurentLaloux, Pierre Cizeau, MarcPotters, andJean-PhilippeBouchaud. Randommatrix theory and financial correlations.International Journal of Theoretical and Applied Finance, 3(03):391–397, 2000
2000
-
[24]
Eigenvectors of some large sample covariance matrix ensembles
Olivier Ledoit and Sandrine Péché. Eigenvectors of some large sample covariance matrix ensembles. Probability Theory and Related Fields, 151(1):233–264, 2011
2011
-
[25]
Recursive pca for adaptive process monitoring
Weihua Li, H Henry Yue, Sergio Valle-Cervantes, and S Joe Qin. Recursive pca for adaptive process monitoring. Journal of process control, 10(5):471–486, 2000. 31
2000
-
[26]
Eigenvector overlaps in large sample covariance matrices and nonlinear shrinkage estimators.arXiv preprint arXiv:2404.18173, 2024
Zeqin Lin and Guangming Pan. Eigenvector overlaps in large sample covariance matrices and nonlinear shrinkage estimators.arXiv preprint arXiv:2404.18173, 2024
2024 arXiv
-
[27]
Extreme eigenvalues of wishart matrices: application to entangled bipartite system
Satya N Majumdar. Extreme eigenvalues of wishart matrices: application to entangled bipartite system. arXiv preprint arXiv:1005.4515, 2010
2010 arXiv
-
[28]
Distribution of eigen- values for some sets of random matrices.Matematicheskii Sbornik, 114(4):507–536, 1967
Vladimir Alexandrovich Marchenko and Leonid Andreevich Pastur. Distribution of eigen- values for some sets of random matrices.Matematicheskii Sbornik, 114(4):507–536, 1967
1967
-
[29]
Improved estimation of eigenvalues and eigenvectors of covariance matrices using their sample estimates.IEEE Transactions on Information Theory, 54(11):5113–5129, 2008
Xavier Mestre. Improved estimation of eigenvalues and eigenvectors of covariance matrices using their sample estimates.IEEE Transactions on Information Theory, 54(11):5113–5129, 2008
2008
-
[30]
Missing data methods in pca and pls: Score calculations with incomplete observations
Philip RC Nelson, Paul A Taylor, and John F MacGregor. Missing data methods in pca and pls: Score calculations with incomplete observations. Chemometrics and intelligent laboratory systems, 35(1):45–65, 1996
1996
-
[31]
Overlaps between eigenvectors of spiked, correlated random matrices: From matrix principal component analysis to random gaussian land- scapes
Alessandro Pacco and Valentina Ros. Overlaps between eigenvectors of spiked, correlated random matrices: From matrix principal component analysis to random gaussian land- scapes. Physical Review E, 108(2):024145, 2023
2023
-
[32]
Population structure and eigenanalysis
Nick Patterson, Alkes L Price, and David Reich. Population structure and eigenanalysis. PLoS genetics, 2(12):e190, 2006
2006
-
[33]
A first course in random matrix theory: for physicists, engineers and data scientists
Marc Potters and Jean-Philippe Bouchaud. A first course in random matrix theory: for physicists, engineers and data scientists. Cambridge University Press, 2020
2020
-
[34]
American Mathematical Soc., 2012
Terence Tao.Topics in random matrix theory, volume 132. American Mathematical Soc., 2012
2012
-
[35]
Randommatrixtheoryandwirelesscommunications
AntoniaMTulino, SergioVerdú, etal. Randommatrixtheoryandwirelesscommunications. Foundations and Trends® in Communications and Information Theory, 1(1):1–182, 2004
2004
-
[36]
Random matrix theory analysis of cross correlations in financial markets.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 70(2):026110, 2004
Akihiko Utsugi, Kazusumi Ino, and Masaki Oshikawa. Random matrix theory analysis of cross correlations in financial markets.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics, 70(2):026110, 2004
2004
-
[37]
Diffusion mri noise mapping using random matrix theory.Magnetic resonance in medicine, 76(5):1582–1593, 2016
Jelle Veraart, Els Fieremans, and Dmitry S Novikov. Diffusion mri noise mapping using random matrix theory.Magnetic resonance in medicine, 76(5):1582–1593, 2016
2016
-
[38]
Denoising of diffusion mri using random matrix theory.Neuroimage, 142:394–406, 2016
Jelle Veraart, Dmitry S Novikov, Daan Christiaens, Benjamin Ades-Aron, Jan Sijbers, and Els Fieremans. Denoising of diffusion mri using random matrix theory.Neuroimage, 142:394–406, 2016
2016
-
[39]
Candid covariance-free incremental principal component analysis.IEEE Transactions on Pattern Analysis and Machine Intel- ligence, 25(8):1034–1040, 2003
Juyang Weng, Yilu Zhang, and Wey-Shiuan Hwang. Candid covariance-free incremental principal component analysis.IEEE Transactions on Pattern Analysis and Machine Intel- ligence, 25(8):1034–1040, 2003
2003
-
[40]
Denoise functional magnetic resonance imaging with random matrix theory based principal component analysis
Wei Zhu, Xiaodong Ma, Xiao-Hong Zhu, Kamil Ugurbil, Wei Chen, and Xiaoping Wu. Denoise functional magnetic resonance imaging with random matrix theory based principal component analysis. IEEE Transactions on Biomedical Engineering, 69(11):3377–3388, 2022. 32
2022
Reviewed August 10, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.