Renormalization group for spectral collapse in random matrices with power-law variance profiles

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.

arXiv comment18 pages, 9 figures, additional acknowledgements

References in corpus (13)

• Statistical mechanics of complex networks
• Level-Spacing Distributions and the Airy Kernel
• Noise Dressing of Financial Correlation Matrices
• Statistical mechanics for natural flocks of birds
• Random walks and diffusion on networks
• Linking connectivity, dynamics and computations in low-rank recurrent neural networks
• Statistical physics of inference: Thresholds and algorithms
• Mutual Information, Neural Networks and the Renormalization Group
• Coarse--graining, fixed points, and scaling in a large population of neurons
• PCA meets RG
• Stability of the Matrix Dyson Equation and Random Matrices with Correlations
• Testing the critical brain hypothesis using a phenomelogical renormalization group
• Statistical properties of large data sets with linear latent features