Related papers: Supersymmetry Approach to Almost Diagonal Random M…
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…
It is shown that the eigenproblem of any $2\times 2$ matrix Hamiltonian with discrete eigenvalues is involved with a supersymmetric quantum mechanics. The energy dependence of the superalgebra marks the disparity between the deduced…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
We study spectral statistics of a Gaussian unitary critical ensemble of almost diagonal Hermitian random matrices with off-diagonal entries $<|H_{ij}|^{2} > \sim b^{2} |i-j|^{-2}$ small compared to diagonal ones $<|H_{ii}|^{2} > \sim 1$.…
We show how to construct Hamiltonian lattice theories with one exact supersymmetry on arbitrary triangulations of curved space in any number of dimensions. Both bosons and fermions satisfy discrete K\"{a}hler-Dirac equations. The…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
We discuss non-Hermitian field theories where the spectrum of the Hamiltonian involves only real energies. We make three observations. (i) The theories obtained from supersymmetric theories by nonanticommutative deformations belong in many…
The Hamiltonian of a recently proposed supersymmetric matrix model has been shown to become block-diagonal in the large-N, infinite 't Hooft coupling limit. We show that (most of) these blocks can be mapped into seemingly non-supersymmetric…
We study the asymptotics of sums of matricially free random variables called random pseudomatrices, and we compare it with that of random matrices with block-identical variances. For objects of both types we find the limit joint…
We formulate the issue of minimality of self-adjoint operators on a Hilbert space as a semi-definite problem, linking the work by Overton in [1] to the characterization of minimal hermitian matrices. This motivates us to investigate the…
The class of norm-dependent Random Matrix Ensembles is studied in the presence of an external field. The probability density in those ensembles depends on the trace of the squared random matrices, but is otherwise arbitrary. An exact…
We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…
For a sufficiently nice 2 dimensional shape, we define its approximating matrix (or patterned matrix) as a random matrix with iid entries arranged according to a given pattern. For large approximating matrices, we observe that the…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
We consider the additive superimposition of an extensive number of independent Euclidean Random Matrices in the high-density regime. The resolvent is computed with techniques from free probability theory, as well as with the replica method…
Hypergeometric functions of complex matrices were introduced by James in multivariate statistics. These special functions play many roles in random matrix theory. The main goal of this paper is to suggest a new use for them as holomorphic…
We characterize general pseudo-harmonic morphisms from a Riemannian manifold to a Hermitian manifold as pseudo horizontally weakly conformal maps with an additional property. We study to what extent we can (locally) describe these…
Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…
Motivated by the recent work on asymptotic independence relations for random matrices with non-commutative entries, we investigate the limit distribution and independence relations for large matrices with identically distributed and Boolean…
A possibly fruitful extension of conventional random matrix ensembles is proposed by imposing symmetry constraints on conventional Hermitian matrices or parity-time- (PT-) symmetric matrices. To illustrate the main idea, we first study 2*2…