Pseudo-Hermitian Random Matrix Models: General Formalism
Joshua Feinberg, Roman Riser

TL;DR
This paper introduces a new class of pseudo-Hermitian random matrix models that depend on a metric, providing explicit formulas for their eigenvalue distributions and analyzing the spectrum's structure in the large matrix limit.
Contribution
The paper develops a formalism for pseudo-Hermitian random matrices, deriving explicit eigenvalue density functions and analyzing spectral properties depending on the metric signature.
Findings
Eigenvalues form two symmetric complex blobs and a real segment.
Eigenvalue distribution depends on the metric's signature.
Numerical results match analytical large-N predictions.
Abstract
Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite dimensional subspace. As such, they can be used, in the usual spirit of random matrix theory, to model chaotic or disordered PT-symmetric quantum systems, or their gain-loss-balanced classical analogs, in the phase of broken PT-symmetry. The eigenvalues of pseudo-hermitian matrices are either real, or come in complex-conjugate pairs. In this paper we introduce a family of pseudo-hermitian random matrix models, depending parametrically on their metric. We apply the diagrammatic method to obtain its averaged resolvent and density of eigenvalues as explicit functions of the metric, in the limit of large matrix size . As a concrete example, which is…
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.
