Metraipolis › archive › dc_e4388ace5152

Inverse of a Sum of Random Matrices: A Dynamical Mean-Field Approach — arXiv:2609.21140

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21140
License (as archived)
CC0-1.0
Archived
2026-10-10T02:07:11.697Z
SHA-256 of the archived text
4c64f91d0b12aee5062a455f4b49892985da3b6f54736b8511262fdf9649c42b
Stable URL of this page
https://metraipolis.com/documento/dc_e4388ace5152

How to cite

Inverse of a Sum of Random Matrices: A Dynamical Mean-Field Approach — arXiv:2609.21140 — arXiv (en), https://arxiv.org/abs/2609.21140 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4388ace5152 (Metraipolis archive dc_e4388ace5152, sha256 4c64f91d0b12aee5062a455f4b49892985da3b6f54736b8511262fdf9649c42b)
BibTeX
@misc{dce4388ace5152,
  title = {Inverse of a Sum of Random Matrices: A Dynamical Mean-Field Approach — arXiv:2609.21140},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21140},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4388ace5152; sha256 4c64f91d0b12aee5062a455f4b49892985da3b6f54736b8511262fdf9649c42b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21140. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study $(\mathbf{O}^\top \mathbf{A} \mathbf{O} + \mathbf{B})^{-1}$, where $\mathbf{A}, \mathbf{B} \in \mathbb{R}^{N \times N}$ are symmetric positive definite, with limiting eigenvalue distributions ${\rm F}_{\mathbf{A}}, {\rm F}_{\mathbf{B}}$ and spectra bounded and bounded away from zero, and $\mathbf{O}$ is Haar orthogonal. We analyze the deviation of deterministic-equivalent-type approximation $\boldsymbol{\Delta}\doteq (\mathbf{O}^\top \mathbf{A} \mathbf{O} + \mathbf{B})^{-1}- \mathbf{S}^{-1}$ where $\mathbf{S} = \mathbf{B} - z^\star \mathbf{I}$. First, let $\mathbf{O}$ be independent of $(\mathbf{A}, \mathbf{B}, \mathbf{u})$, $\|\mathbf{u}\| = 1$. There is sequence of a standard Gaussian vectors $\mathbf{g}_N$ independent of $(\mathbf{A}, \mathbf{B}, \mathbf{u})$ with $\| \mathbf{S} \boldsymbol{\Delta} \mathbf{S} \mathbf{u} - \sqrt{\frac \tau N}\, \mathbf{g}_N \| \to 0$ a.s. Here $z^\star = -{\rm R}(-\chi)$ and $\tau = {\rm R}'(-\chi)(1 + \eta {\rm R}'(-\chi))$, where ${\rm R}$ is the R-transform of ${\rm F}_{\mathbf{A}}$ and $(\chi, \eta)$ are the first two inverse moments of the free additive convolution of ${\rm F}_{\mathbf{A}}, {\rm F}_{\mathbf{B}}$. Let $\mathbf{K} = \sum_{i \le \lfloor N^q \rfloor} \lambda_i \mathbf{u}_i \mathbf{v}_i^\top$, $q \in [0, C]$, with unit-norm, not necessarily orthogonal $\mathbf{u}_i, \mathbf{v}_i$ and $\limsup_N \max_i |\lambda_i| < \infty$ a.s. If $\mathbf{O}$ is independent of $(\mathbf{A}, \mathbf{B}, \{\mathbf{u}_i, \mathbf{v}_i\})$, then $N^{-q} {\rm tr}(\mathbf{K} \boldsymbol{\Delta}) \to 0$ a.s. The proofs use a dynamical mean-field approach: the generating functions of the free Appell polynomials give a linear dynamics approximating the quantity of interest in the iterated large-$N$, large-time limit, whose fluctuations we analyze.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.21140 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:47:50.184Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).