2018
DOI: 10.1007/978-3-030-01593-0_19
|View full text |Cite
|
Sign up to set email alerts
|

Free Probability, Random Matrices, and Representations of Non-commutative Rational Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…explicit speed of convergence) or possibly N dependent test functions (like mesoscopic linear statistics) usually requires high (N -dependent) degree for the polynomials that, in turn, are increasingly difficult for the moment method as well as for the analytic subordination method [7]. Thus the extension of the moment method to more general functions has natural limitations, although there is a remarkable recent development for rational functions [24,28,38,14]. The trace of a smooth cut-off function of a polynomial in GUE and deterministic matrices has been analysed via the Master equation and linearization in [23,29] for the purpose of identifying the norm of the polynomial.…”
Section: A(t)b ≈ a Bmentioning
confidence: 99%
“…explicit speed of convergence) or possibly N dependent test functions (like mesoscopic linear statistics) usually requires high (N -dependent) degree for the polynomials that, in turn, are increasingly difficult for the moment method as well as for the analytic subordination method [7]. Thus the extension of the moment method to more general functions has natural limitations, although there is a remarkable recent development for rational functions [24,28,38,14]. The trace of a smooth cut-off function of a polynomial in GUE and deterministic matrices has been analysed via the Master equation and linearization in [23,29] for the purpose of identifying the norm of the polynomial.…”
Section: A(t)b ≈ a Bmentioning
confidence: 99%
“…In this section, we are going to give a brief introduction to linearization techniques. What became known in the free probability community as the "linearization trick" [51,22,21,3,4,9,39] turned out some years ago to be used extensively also in other branches of mathematics, ranging from system engineering over automata theory to the theory of non-commutative rings ; see [24,32] and the references collected therein. In fact, linearization works equally well for noncommutative rational functions, but we will restrict here to the case of noncommutative polynomials.…”
Section: Appendix a Linearizations Of Operator-valued Noncommutative ...mentioning
confidence: 99%