Structured random matrices and cyclic cumulants: A free probability approach
arXiv:2309.14315 · doi:10.1142/S201032632450014X
Abstract
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an efficient method, based on an extremization problem, for computing the spectrum of subblocks of such large structured random matrices. We present different proofs -- combinatorial or algebraic -- of the validity of this method, which all have some connection with free probability. We illustrate this method with well known examples of unstructured matrices, including Haar randomly rotated matrices, as well as with the example of structured random matrices arising in the quantum symmetric simple exclusion process. tured random matrices arising in the quantum symmetric simple exclusion process.
30 pages main text, 2 pages appendix. There is an addition/comment to this paper: arXiv:2505.21376
References in corpus (9)
- The Eigenstate Thermalization Hypothesis and Out of Time Order Correlators
- Eigenstate Thermalization Hypothesis and Free Probability
- Open Quantum Symmetric Simple Exclusion Process
- On some integrals over the U(N) unitary group and their large N limit
- High-temperature Expansions and Message Passing Algorithms
- Structured Random Matrices
- Solution to the Quantum Symmetric Simple Exclusion Process : the Continuous Case
- Eigenvalue distribution of nonlinear models of random matrices
- Exact Entanglement in the Driven Quantum Symmetric Simple Exclusion Process