Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.09221

Pseudo-Hermitian Random Matrix Models: General Formalism

Joshua Feinberg·Roman Riser
View original source ↗Read source document ↗Export metadata ↓

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 $N$. As a concrete example, which is essentially an ensemble of elements of the non-compact unitary Lie algebra, we choose a particularly simple set of metrics, and compute the resulting resolvent and density of eigenvalues in closed form. The spectrum consists of a finite fraction of complex eigenvalues, which occupy uniformly two two-dimensional blobs, symmetric with respect to the real axis, as well as the complimentary fraction of real eigenvalues, condensed in a finite segment, with a known non-uniform density. The numbers of complex and real eigenvalues depend on the signature of the metric, that is, the numbers of its positive and negative eigenvalues. We have also carried thorough numerical analysis of the model for these particular metrics. Our numerical results converge rapidly towards the asymptotic analytical large-$N$ expressions.

Explore related subjects

math-phcond-mat.dis-nnhep-thmath.MPmath.PRnlin.CD

Keep this discovery

BibTeXRIS

Joshua Feinberg, Roman Riser. 2021-09-19. Pseudo-Hermitian Random Matrix Models: General Formalism. https://doi.org/10.1016/j.nuclphysb.2022.115678

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗