2020
DOI: 10.48550/arxiv.2006.09356
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Spectral deconvolution of unitarily invariant matrix models

Pierre Tarrago

Abstract: In this paper, we implement a complex analytic method to recover the spectrum of a matrix perturbed by either the addition or the multiplication of a random matrix noise, under the assumption that the distribution of the noise is unitarily invariant. This method, which has been previously introduced by Arizmendi, Tarrago and Vargas, is done in two steps : the first step consists in a fixed point method to compute the Stieltjes transform of the desired distribution in a certain domain, and the second step is a … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…The subordination function w f p in (2.13) is estimated using the second equality of Lemma 2.7. In parallel with our work, Tarrago [26] has used the formula (2.13) to perform spectral deconvolution in a more general setting (including the multiplicative free convolution), but neither the approximation of w f p by its estimator w n f p defined Theorem-Definition 2.8 below nor the (classical) deconvolution of the Cauchy distribution are treated, which are key difficulties encountered in our paper. Tarrago uses a different approach based on concentration inequalities when we use fluctuations in view of the work of Février and Dallaporta [16].…”
Section: Construction Of the Estimator Of Pmentioning
confidence: 99%
“…The subordination function w f p in (2.13) is estimated using the second equality of Lemma 2.7. In parallel with our work, Tarrago [26] has used the formula (2.13) to perform spectral deconvolution in a more general setting (including the multiplicative free convolution), but neither the approximation of w f p by its estimator w n f p defined Theorem-Definition 2.8 below nor the (classical) deconvolution of the Cauchy distribution are treated, which are key difficulties encountered in our paper. Tarrago uses a different approach based on concentration inequalities when we use fluctuations in view of the work of Février and Dallaporta [16].…”
Section: Construction Of the Estimator Of Pmentioning
confidence: 99%
“…This calculus was implemented symbolically as RTNI [FKN19] with Mathematica and Python, for tensor networks with some of nodes being Haardistributed unitary matrices of symbolic dimensions. So far, RTNI has been used for quantum neural networks and quantum circuits [CSV + 21, PCW + 21, SCCC22, LNS + 23, WLL + 22, LLH + 22], more broadly quantum information and quantum physics [FK19, Liu20, KNP + 21, RGPA21, IEH + 23, HBS23, CKF23] and mathematics [Tar20]. Now, we make further steps to develop Python-based PyRTNI2.…”
Section: Introductionmentioning
confidence: 99%