The strong convergence phenomenon

TL;DR

This survey analyzes the strong convergence phenomenon for noncommutative polynomials of random matrices and its deep connections to free probability, operator algebras, and geometric/combinatorial problems. It presents two central methodologies—the interpolation method and the polynomial method—along with the intrinsic freeness principle, showing how limiting free objects govern spectrum and norm behavior in broad settings. The work surveys key applications to optimal spectral gaps in random lifts of graphs and hyperbolic surfaces, tensor-models in von Neumann algebras, and minimal-surface constructions, while outlining major open problems such as strong convergence without freeness, deterministic constructions, and complex eigenvalue behavior. The results elucidate how operator-algebraic structures, exactness, and rapid decay underpin powerful nonasymptotic bounds and broad applicability across mathematics and mathematical physics.

Abstract

In a seminal 2005 paper, Haagerup and Thorbjørnsen discovered that the norm of any noncommutative polynomial of independent complex Gaussian random matrices converges to that of a limiting family of operators that arises from Voiculescu's free probability theory. In recent years, new methods have made it possible to establish such strong convergence properties in much more general situations, and to obtain even more powerful quantitative forms of the strong convergence phenomenon. These, in turn, have led to a number of spectacular applications to long-standing open problems on random graphs, hyperbolic surfaces, and operator algebras, and have provided flexible new tools that enable the study of random matrices in unexpected generality. This survey aims to provide an introduction to this circle of ideas.

Figures (8)

• Figure 1.1: Left figure: $4$-regular graph generated by two permutations. Right figure: $4$-regular tree generated by two free generators $a,b$ of the free group $\mathbf{F}_2$. The edges defined by the two generators are colored red and blue, respectively.
• Figure 1.2: Example of $P(H_1^N,H_2^N,H_3^N)$ where $H_i^N$ are independent $N\times N$ GUE (left plot) or $w$-sparse band matrices (right plot) with $N=1000$ and $w=27$. The histograms show the eigenvalues of a single realization of the random matrix, the solid line is the spectral density of $P(s_1,s_2,s_3)$ (computed using NCDist.jl).
• Figure 1.3: Staircase pattern of the large deviation probabilities in Friedman's Theorem \ref{['thm:friedman']} for the permutation model of random regular graphs. Here we define $I(x)=\lim_{N\to\infty} \frac{\log\mathbf{P}[\|A^N\|\,\ge\, x]}{\log N}$, $m_* = \lfloor \frac{1}{2}(\sqrt{d-1}+1)\rfloor$, and $\rho_m = 2m-1 + \frac{d-1}{2m-1}$.
• Figure 3.1: Graph $\Gamma$ associated to the term $\mathbf{E}[ (U_1^N)_{58} (U_2^N)_{86} (U_1^{N*})_{68} (U_2^{N*})_{85}]$. The vertices labelled $1,2,3$ correspond to the values $5,8,6$, respectively.
• Figure 4.1: Illustration of a noncrossing pairing $\pi_1$ and a crossing pairing $\pi_2$.

Theorems & Definitions (97)

• Definition 1.1
• Lemma 1.2: Alon--Boppana
• Theorem 1.3: Friedman
• Theorem 1.4: Bordenave--Collins
• Theorem 1.5: Haagerup--Thorbjørnsen
• Theorem 1.6: Intrinsic freeness
• Remark 1.7
• Definition 2.1: $C^*$-algebra
• Definition 2.2: Trace
• Definition 2.3: $C^*$-probability space