Renormalization group for spectral collapse in random matrices with power-law variance profiles
Pith reviewed 2026-05-16 21:35 UTC · model grok-4.3
The pith
Running normalization collapses eigenvalue densities in power-law random matrices
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By defining an RG flow via successive matrix decimation, the authors obtain a beta function that governs the size dependence of the normalization; integrating this flow produces a rescaling under which the eigenvalue density becomes independent of system size for any fixed power-law exponent.
What carries the argument
The renormalization group transformation realized by matrix decimation, which yields a beta function for the running normalization as a function of the variance-profile exponent.
Load-bearing premise
The decimation procedure must define a valid RG transformation whose beta function correctly describes the flow of the normalization for the given variance profiles.
What would settle it
If numerical diagonalization of matrices at several widely separated sizes shows that the rescaled eigenvalue histograms do not converge to a single curve given by the fixed-point resolvent solution, the predicted collapse would be ruled out.
Figures
read the original abstract
We propose a renormalization group (RG) approach to compare and collapse eigenvalue densities of random matrix models of complex systems across different system sizes. The approach is to fix a natural spectral scale by letting the model normalization run with size, turning raw spectra into comparable, collapsed density curves. We demonstrate this approach on generalizations of two classic random matrix ensembles--Wigner and Wishart--modified to have power-law variance profiles. We use random matrix theory methods to derive self-consistent fixed-point equations for the resolvent to compute their eigenvalue densities, we define an RG scheme based on matrix decimation, and compute the Beta function controlling the RG flow as a function of the variance profile power-law exponent. The running normalization leads to spectral collapse which we confirm in simulations and solutions of the fixed-point equations. We expect this RG approach to carry over to other ensembles, providing a method for data analysis of a broad range of complex systems.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a renormalization group (RG) approach for collapsing eigenvalue densities of random matrices with power-law variance profiles (generalized Wigner and Wishart ensembles) across system sizes. Normalization is allowed to run with size via an RG scheme based on matrix decimation; self-consistent resolvent equations are derived for the eigenvalue densities, a beta function is computed as a function of the power-law exponent, and spectral collapse is verified in simulations and fixed-point solutions.
Significance. If the RG transformation is valid, the method supplies a systematic, parameter-controlled procedure for comparing and collapsing spectra in inhomogeneous random-matrix models of complex systems, extending classical RMT tools to position-dependent variances and offering a potential data-analysis framework for broad classes of empirical networks and matrices.
major comments (2)
- [RG scheme and beta function] The RG scheme section: the beta function is derived under the assumption that matrix decimation preserves the exact power-law form of the variance profile up to a global scale factor. No derivation or numerical test is supplied showing that the resulting submatrix variance profile remains a pure power law (rather than acquiring edge distortions or non-uniform sampling that alters the exponent). This invariance is load-bearing for the claimed RG flow and for the running normalization to produce collapse.
- [Fixed-point equations and numerical results] Fixed-point equations and simulations: the self-consistent resolvent equations are solved only for fixed profiles, yet the RG flow applies them after each decimation step. Without an explicit check that the profile form is preserved (or a modified flow equation accounting for distortion), the agreement between fixed-point solutions and simulations does not confirm that the beta function correctly drives the collapse.
minor comments (1)
- [Abstract and conclusions] The abstract states that the approach 'can carry over to other ensembles,' but the manuscript provides no concrete example or outline of how the decimation step would be adapted beyond Wigner/Wishart.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive comments on our renormalization group approach for spectral collapse. We address the major points below and have revised the manuscript to strengthen the justification for the key assumptions.
read point-by-point responses
-
Referee: [RG scheme and beta function] The RG scheme section: the beta function is derived under the assumption that matrix decimation preserves the exact power-law form of the variance profile up to a global scale factor. No derivation or numerical test is supplied showing that the resulting submatrix variance profile remains a pure power law (rather than acquiring edge distortions or non-uniform sampling that alters the exponent). This invariance is load-bearing for the claimed RG flow and for the running normalization to produce collapse.
Authors: We agree that explicit support for the invariance assumption is necessary. The beta function derivation relies on the statistical self-similarity of the power-law profile under random subsampling of rows and columns, which holds asymptotically for large N because the variance at each position is drawn independently from the global profile. In the revised manuscript we add both an analytic argument showing that the induced submatrix variances remain power-law distributed with unchanged exponent (boundary corrections are O(1/N) and vanish in the thermodynamic limit) and numerical tests that fit the exponent after successive decimation steps, confirming preservation within statistical error for the system sizes studied. revision: yes
-
Referee: [Fixed-point equations and numerical results] Fixed-point equations and numerical results: the self-consistent resolvent equations are solved only for fixed profiles, yet the RG flow applies them after each decimation step. Without an explicit check that the profile form is preserved (or a modified flow equation accounting for distortion), the agreement between fixed-point solutions and simulations does not confirm that the beta function correctly drives the collapse.
Authors: The fixed-point resolvent equations are solved for the instantaneous power-law profile at each RG scale; the beta function then supplies the running normalization that maps one scale to the next. Direct simulations implement the full decimation sequence and exhibit collapse consistent with this flow. To make the connection explicit, the revised version includes an iterative procedure in which the fixed-point solver is reapplied after each beta-driven rescaling and the resulting densities are compared with the simulated decimated matrices; the two agree to within sampling noise, thereby confirming that the beta function correctly drives the observed collapse under the maintained profile assumption. revision: yes
Circularity Check
No circularity: beta function and collapse derived from independent fixed-point and decimation equations
full rationale
The derivation begins with self-consistent resolvent equations solved for fixed power-law variance profiles to obtain eigenvalue densities. An RG scheme is then defined via matrix decimation, from which the beta function is computed directly as a function of the exponent. The running normalization is obtained by integrating this beta function, and spectral collapse is verified both by solving the resulting flow equations and by direct simulations. None of these steps reduces a claimed prediction to a fitted parameter or prior self-citation by construction; the fixed-point solutions and numerical checks supply independent content that can be falsified outside the RG flow itself.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Self-consistent fixed-point equations for the resolvent yield the eigenvalue density
- domain assumption Matrix decimation defines a renormalization group transformation
Reference graph
Works this paper leans on
-
[1]
Integration by parts We derive expressions for the expectation values of the different terms in Eq. (B2). We assume Gaussian entries and use integration by parts (IBP), which gives the stan- dard relation,E[X ab F(X)] = Var(X ab)E ∂F/∂X ab . The derivative of the resolvent is ∂G ∂Xab =G ∂X ∂Xab G,(B3) and for symmetricX: ∂X ∂Xik =E ik +E ki , ∂X ∂Xii =E i...
-
[2]
Mean-field closure We now pass from the empirical identity to a determin- istic site equation using self-averaging, cf. Appendix A. Taking expectations in Eq. (B2) gives zE[G emp ii (z)]− NX k=1 E Xik Gemp ki (z) = 1.(B8) On mesoscopic scales (η≥N −1+ε) off the real axis, the anisotropic local law implies self-averaging of diag- onal resolvent entries and...
-
[3]
Row decomposition and rank–one update We write thet-th row ofZasz t ∈R N and set bt := √vt γ zt ∼ N 0,(v t/γ2)I N ,(G2) so that the covariance matrix is a sum of rank–one outer products: C= TX t=1 btbT t .(G3) Starting from the resolvent identity (zI N −C)G N(z) =I N ,(G4) and taking the normalized trace, we obtain z GN(z)− 1 N TX t=1 bT t GN(z)b t = 1,(G...
-
[4]
Conditional Gaussian averaging The random objects we average are the quadratic forms in the numerator and denominator on the right- hand side of Eq. (G10). We condition on the leave–one–out(minor) resolventG (t) N (i.e., treatC (t) as fixed), and note thatb t is independent ofC (t). Since bt ∼ N(0,(v t/γ2)I) andG (t) N is fixed under the con- ditional exp...
-
[5]
Mean–field replacement and equation closure The anisotropic local law (cf. Appendix A and [32, 33]), asserts that, uniformly forz=x+iηwithη > 0, leave–one–out resolventsG (t) and full resolventsG N differ by subleading corrections in quadratic forms and traces: 1 N TrG(t) N (z) =G N(z) +O (N η)−1/2 .(G13) Substituting into the normalized trace identity yi...
-
[6]
Fixed-point algorithm for the Wishart-type ensemble We solve the self-consistent equations for the Wishart-type ensemble Eqs. (37)–(38), with the following fixed-point algorithm [49]: Algorithm 2:Fixed-point iteration forG N(z) (Wishart-type ensemble) Input:z=x+i ηwithη >0;α, N, T, γ 2; toleranceε >0; dampingθ∈(0,1]; stabilizationε stab >0 Init:v t ←t −2α...
-
[7]
RG fixed point approach We define the fixed-point normalization and coupling γ2 ⋆ := lim T→∞ γ2(T)∝ζ(2α), g ⋆ :=γ −2 ⋆ ,(H3) and measure the approach to the fixed point via the de- viation inγ 2 δ(T) :=γ 2 ⋆ −γ 2(T).(H4) Using a tail estimate for the convergent series, we obtain the asymptotic scaling of the deviation δ(T)∝ ∞X t=T+1 t−2α ∼ Z ∞ T t′−2α dt′...
-
[8]
Linearized Beta function A natural linearized Beta function is the logarithmic derivative of the deviation: βδ := dlogδ ds = dlogδ dlogT .(H7) Using Eq. (H5) we find βδ →1−2α <0, α >1/2.(H8) Thus, in the saturating regime the flow is irrelevant in the RG sense: as the scaleTincreases the deviation from the fixed point decays as a power law, and under deci...
-
[9]
J. P. Cunningham and B. M. Yu, Nature Neuroscience 17, 1500 (2014)
work page 2014
-
[10]
M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Bot- stein, Proceedings of the National Academy of Sciences 95, 14863 (1998)
work page 1998
-
[11]
N. W. Ashcroft and N. D. Mermin,Solid State Physics (Holt, Rinehart and Winston, New York, 1976)
work page 1976
-
[12]
R. Albert and A.-L. Barab´ asi, Reviews of Modern Physics 74, 47 (2002)
work page 2002
- [13]
-
[14]
E. P. Wigner, Annals of Mathematics67, 325 (1958)
work page 1958
-
[15]
V. A. Marˇ cenko and L. A. Pastur, Mathematics of the USSR-Sbornik1, 457 (1967)
work page 1967
-
[16]
H. Sompolinsky, A. Crisanti, and H. J. Sommers, Phys. Rev. Lett.61, 259 (1988)
work page 1988
- [17]
-
[18]
Z. D. Bai and J. W. Silverstein,Spectral Analysis of Large Dimensional Random Matrices, 2nd ed. (Springer, 2010)
work page 2010
-
[19]
G. W. Anderson, A. Guionnet, and O. Zeitouni,An In- troduction to Random Matrices, Cambridge Studies in Advanced Mathematics, Vol. 118 (Cambridge University Press, Cambridge, 2010)
work page 2010
-
[20]
M. Potters and J.-P. Bouchaud,A first course in random matrix theory: for physicists, engineers and data scien- tists(Cambridge University Press, 2020)
work page 2020
-
[21]
R. Couillet and M. Debbah,Random matrix methods for wireless communications(Cambridge University Press, 2011)
work page 2011
- [22]
- [23]
- [24]
-
[25]
T. Lesieur, L. Miolane, M. Lelarge, F. Krzakala, and L. Zdeborov´ a, in2017 ieee international symposium on information theory (isit)(IEEE, 2017) pp. 511–515
work page 2017
-
[26]
C. A. Tracy and H. Widom, Communications in Mathe- matical Physics159, 151 (1994)
work page 1994
-
[27]
L. P. Kadanoff, Physics Physique Fizika2, 263 (1966)
work page 1966
-
[28]
J. B. Kogut, Reviews of Modern Physics51, 659 (1979)
work page 1979
-
[29]
Goldenfeld,Lectures on phase transitions and the renormalization group(CRC Press, 2018)
N. Goldenfeld,Lectures on phase transitions and the renormalization group(CRC Press, 2018)
work page 2018
-
[30]
K. G. Wilson and J. Kogut, Physics Reports12, 75 (1974)
work page 1974
-
[31]
Scaling and renormalization in high-dimensional regression
A. Atanasov, J. A. Zavatone-Veth, and C. Pehlevan, arXiv preprint arXiv:2405.00592 (2024)
work page internal anchor Pith review Pith/arXiv arXiv 2024
-
[32]
G. Buzs´ aki and K. Mizuseki, Nature reviews neuroscience 15, 264 (2014)
work page 2014
- [33]
- [34]
- [35]
-
[36]
M. D. Luecken and F. J. Theis, Molecular systems biol- ogy15, e8746 (2019)
work page 2019
-
[37]
C. G. Callan, Physical Review D2, 1541 (1970)
work page 1970
-
[38]
Symanzik, Communications in Mathematical Physics 18, 227 (1970)
K. Symanzik, Communications in Mathematical Physics 18, 227 (1970)
work page 1970
-
[39]
O. H. Ajanki, L. Erd˝ os, and T. Kr¨ uger, Probability The- ory and Related Fields169, 667 (2017)
work page 2017
-
[40]
O. H. Ajanki, L. Erd˝ os, and T. Kr¨ uger, Probability The- ory and Related Fields173, 293 (2019)
work page 2019
-
[41]
A. Knowles and J. Yin, Probability Theory and Related Fields169, 257 (2017)
work page 2017
-
[42]
J. Alt, L. Erd˝ os, and T. Kr¨ uger, Documenta Mathemat- ica25, 1421 (2020). 18
work page 2020
-
[43]
M. M´ ezard, G. Parisi, and M. A. Virasoro,Spin Glass Theory and Beyond, World Scientific Lecture Notes in Physics, Vol. 9 (World Scientific, Singapore, 1987)
work page 1987
-
[44]
J. W. Silverstein and Z. D. Bai, Journal of Multivariate Analysis54, 175 (1995)
work page 1995
-
[45]
R. B. Dozier and J. W. Silverstein, Journal of Multivari- ate Analysis98, 678 (2007)
work page 2007
-
[46]
R. Olfati-Saber, J. A. Fax, and R. M. Murray, Proceed- ings of the IEEE95, 215 (2007)
work page 2007
- [47]
- [48]
-
[49]
H. von Storch and F. W. Zwiers,Statistical Analysis in Climate Research(Cambridge University Press, Cam- bridge, 1999)
work page 1999
-
[50]
R. M. May, Nature238, 413 (1972)
work page 1972
-
[51]
An exact mapping between the Variational Renormalization Group and Deep Learning
P. Mehta and D. J. Schwab, arXiv preprint arXiv:1410.3831 (2014)
work page internal anchor Pith review Pith/arXiv arXiv 2014
- [52]
- [53]
-
[54]
L. Meshulam, J. L. Gauthier, C. D. Brody, D. W. Tank, and W. Bialek, Phys. Rev. Lett.123, 178103 (2019)
work page 2019
-
[55]
G. Nicoletti, S. Suweis, and A. Maritan, Physical Review Research2, 023144 (2020)
work page 2020
- [56]
-
[57]
J. M. Ortega and W. C. Rheinboldt,Iterative solution of nonlinear equations in several variables(SIAM, 2000)
work page 2000
-
[58]
T. M. Apostol,Introduction to Analytic Number Theory, Undergraduate Texts in Mathematics (Springer, New York, 1976)
work page 1976
-
[59]
M. S. Bartlett, The Annals of Mathematical Statistics 22, 107 (1951)
work page 1951
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.