Asymptotic behavior of eigenvalues of large rank perturbations of large random matrices

Ievgenii Afanasiev, Leonid Berlyand, Mariia Kiyashko
7/16/2025
math-phcs.LGmath.PR

No confident code implementation found for this paper.

Abstract

The paper is concerned with deformed Wigner random matrices. These matrices are closely connected with Deep Neural Networks (DNNs): weight matrices of trained DNNs could be represented in the form $R + S$, where $R$ is random and $S$ is highly correlated. The spectrum of such matrices plays a key role in rigorous underpinning of the novel pruning technique based on Random Matrix Theory. Mathematics has been done only for finite-rank matrix $S$. However, in practice rank may grow. In this paper we develop asymptotic analysis for the case of growing rank.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{afanasiev2025asymptotic,
  title  = {Asymptotic behavior of eigenvalues of large rank perturbations of large random matrices},
  author = {Ievgenii Afanasiev and Leonid Berlyand and Mariia Kiyashko},
  year   = {2025},
  eprint = {2507.12182},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.12182v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.12182.svg)](https://codeofpaper.com/paper/2507.12182)

Discussion