Related papers: Universality for the Toda algorithm to compute the…
We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We study the problem of estimating the covariance matrix of a high-dimensional distribution when a small constant fraction of the samples can be arbitrarily corrupted. Recent work gave the first polynomial time algorithms for this problem…
We extend a recent theory of parametric correlations in the spectrum of random matrices to study the response to an external perturbation of eigenvalues near the soft edge of the support. We demonstrate by explicit non-perturbative…
We find a sequence consisting of time dependent evolution vector fields whose time independent part corresponds to the master symmetries for the Toda equations. Each master symmetry decomposes as a sum consisting of a group symmetry and a…
We calculate analytically the probability of large deviations from its mean of the largest (smallest) eigenvalue of random matrices belonging to the Gaussian orthogonal, unitary and symplectic ensembles. In particular, we show that the…
We consider $N\times N$ random matrices of the form $H=W+V$ where $W$ is a real symmetric or complex Hermitian Wigner matrix and $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
We study multiplicative statistics for the eigenvalues of unitarily-invariant Hermitian random matrix models. We consider one-cut regular polynomial potentials and a large class of multiplicative statistics. We show that in the large matrix…
In this note we study the right large deviation of the top eigenvalue (or singular value) of the sum or product of two random matrices $\mathbf{A}$ and $\mathbf{B}$ as their dimensions goes to infinity. The matrices $\mathbf{A}$ and…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
We discuss an approach to compute the first and second moments of the number of eigenvalues $I_N$ that lie in an arbitrary interval of the real line for $N \times N$ Gaussian random matrices. The method combines the standard…
We analyze equilibration times of subsystems of a larger system under a random total Hamiltonian, in which the basis of the Hamiltonian is drawn from the Haar measure. We obtain that the time of equilibration is of the order of the inverse…
In order to have a better understanding of finite random matrices with non-Gaussian entries, we study the $1/N$ expansion of local eigenvalue statistics in both the bulk and at the hard edge of the spectrum of random matrices. This gives…
We prove multi-dimensional central limit theorems for the spectral moments (of arbitrary degrees) associated with random matrices with real-valued i.i.d. entries, satisfying some appropriate moment conditions. Our techniques rely on a…
We discuss a method of the asymptotic computation of moments of the normalized eigenvalue counting measure of random matrices of large order. The method is based on the resolvent identity and on some formulas relating expectations of…
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner…
The discrete-time Toda equation arises as a universal equation for the relevant Hankel determinants associated with one-variable orthogonal polynomials through the mechanism of adjacency, which amounts to the inclusion of shifted weight…
We study the Hermitian supermatrix model involving an external source. We derive the determinantal formula for the supermatrix partition function, and also for the expectation value of the characteristic polynomial ratio, which yields the…
We study the fluctuations of the largest eigenvalue $\lambda_{\max}$ of $N \times N$ random matrices in the limit of large $N$. The main focus is on Gaussian $\beta$-ensembles, including in particular the Gaussian orthogonal ($\beta=1$),…