Resolvents of R-Diagonal Operators
Uffe Haagerup, Todd Kemp, Roland Speicher

TL;DR
This paper derives a universal asymptotic formula for the norm of the resolvent of R-diagonal operators in a II_1-factor, using complex analysis, combinatorics, and introducing new partition structure diagrams.
Contribution
It provides the first asymptotic formula for the resolvent norm of R-diagonal operators and introduces partition structure diagrams as a new combinatorial tool in free probability.
Findings
Universal asymptotic formula for resolvent norm
Calculation of R-transform of |λ-c|^2 for circular operator c
Asymptotic formulas for negative moments of |λ-a|^2
Abstract
We consider the resolvent of any -diagonal operator in a -factor. Our main theorem gives a universal asymptotic formula for the norm of such a resolvent. En route to its proof, we calculate the -transform of the operator where is Voiculescu's circular operator, and give an asymptotic formula for the negative moments of for any -diagonal . We use a mixture of complex analytic and combinatorial techniques, each giving finer information where the other can give only coarse detail. In particular, we introduce {\em partition structure diagrams}, a new combinatorial structure arising in free probability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Operator Algebra Research · Spectral Theory in Mathematical Physics
