Related papers: Solutions of loop equations are random matrices
For each irreducible module of the symmetric group $\mathcal{S}_{N}$ there is a set of parametrized nonsymmetric Jack polynomials in $N$ variables taking values in the module. These polynomials are simultaneous eigenfunctions of a…
Given a right eigenvector $x$ and a left eigenvector $y$ associated with the same eigenvalue of a matrix $A$, there is a Hermitian positive definite matrix $H$ for which $y=Hx$. The matrix $H$ defines an inner product and consequently also…
We show that the sequence of moduli of the eigenvalues of a matrix polynomial is log-majorized, up to universal constants, by a sequence of "tropical roots" depending only on the norms of the matrix coefficients. These tropical roots are…
The 2-matrix models can be defined in a setting more general than polynomial potentials, namely, the semiclassical matrix model. In this case, the potentials are such that their derivatives are rational functions, and the integration paths…
We have found an exact formula expressing a general correlation function containing both products and ratios of characteristic polynomials of random Hermitian matrices. The answer is given in the form of a determinant. An essential…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the…
Consider Ginibre's ensemble of $N \times N$ non-Hermitian random matrices in which all entries are independent complex Gaussians of mean zero and variance $\frac{1}{N}$. As $N \uparrow \infty$ the normalized counting measure of the…
If $A$ is an $n \times n$ Hermitian matrix with eigenvalues $\lambda_1(A),\dots,\lambda_n(A)$ and $i,j = 1,\dots,n$, then the $j^{\mathrm{th}}$ component $v_{i,j}$ of a unit eigenvector $v_i$ associated to the eigenvalue $\lambda_i(A)$ is…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
In this review we summarise recent results for the complex eigenvalues and singular values of finite products of finite size random matrices, their correlation functions and asymptotic limits. The matrices in the product are taken from…
In this article we consider products of real random matrices with fixed size. Let $A_1,A_2, \dots $ be i.i.d $k \times k$ real matrices, whose entries are independent and identically distributed from probability measure $\mu$. Let $X_n =…
Random matrices formed from i.i.d. standard real Gaussian entries have the feature that the expected number of real eigenvalues is non-zero. This property persists for products of such matrices, independently chosen, and moreover it is…
Duality identities in random matrix theory for products and powers of characteristic polynomials, and for moments, are reviewed. The structure of a typical duality identity for the average of a positive integer power $k$ of the…
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…
The Bethe ansatz in its several formulations is the common tool for the exact solution of one dimensional quantum Hamiltonians. This ansatz asserts that the several eigenfunctions of the Hamiltonians are given in terms of a sum of…
We study the normalized eigenvalue counting measure d\sigma of matrices of long-range percolation model. These are (2n+1)\times (2n+1) random real symmetric matrices H=\{H(i,j)\}_{i,j} whose elements are independent random variables taking…
Three ways of constructing a non-Hermitian matrix with possible all real eigenvalues are discussed. They are PT symmetry, pseudo-Hermiticity, and generalized PT symmetry. Parameter counting is provided for each class. All three classes of…
We obtain the explicit rate of convergence $N^{-1/2 + \epsilon}$ for the gaps of generalized Wigner matrices in the bulk of the spectrum, for distributions of matrix entries possibly atomic and supported on enough points. The proof proceeds…
For a general class of large non-Hermitian random block matrices $\mathbf{X}$ we prove that there are no eigenvalues away from a deterministic set with very high probability. This set is obtained from the Dyson equation of the Hermitization…