Related papers: Universality for the Toda algorithm to compute the…
We prove localization with high probability on sets of size of order $N/\log N$ for the eigenvectors of non-Hermitian finitely banded $N\times N$ Toeplitz matrices $P_N$ subject to small random perturbations, in a very general setting. As…
The Toda equation is one of the most famous integrable systems, and its time-discretization is simply the recursion formula of the quotient-difference (qd) algorithm for computing eigenvalues of tridiagonal matrices. An extension of the…
In this note we describe the singular locus of diagonally-dominant Hermitian matrices with nonnegative diagonal entries over the reals, the complex numbers, and the quaternions. This yields explicit expressions for the probability that such…
We show that the maximum moments of the sum of independent positive semidefinite random matrices with given norm upper bounds and norms of expectations is attained when all the random matrices are the multiplications of certain random…
Results on the finite nonperiodic Toda lattice are extended to some generalizations of the system: The relativistic Toda lattice, the generalized Toda lattice associated with simple Lie groups and the full Kostant-Toda lattice. The areas…
The computation of eigenvalues of large-scale matrices arising from finite element discretizations has gained significant interest in the last decade. Here we present a new algorithm based on slicing the spectrum that takes advantage of the…
The empirical eigenvalue distribution of the elliptic random matrix ensemble tends to the uniform measure on an ellipse in the complex plane as its dimension tends to infinity. We show this convergence on all mesoscopic scales slightly…
We study the following generalized matrix rank estimation problem: given an $n \times n$ matrix and a constant $c \geq 0$, estimate the number of eigenvalues that are greater than $c$. In the distributed setting, the matrix of interest is…
The smallest singular value and condition number play important roles in numerical linear algebra and the analysis of algorithms. In numerical analysis with randomness, many previous works make Gaussian assumptions, which are not general…
We show that the fluctuations of the largest eigenvalue of any generalized Wigner matrix $H$ converge to the Tracy-Widom laws at a rate nearly $O(N^{-1/3})$, as the matrix dimension $N$ tends to infinity. We allow the variances of the…
We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…
We consider the standard overlap $\mathcal{O}_{ij}: =\langle \mathbf{r}_j, \mathbf{r}_i\rangle\langle \mathbf{l}_j, \mathbf{l}_i\rangle$ of any bi-orthogonal family of left and right eigenvectors of a large random matrix $X$ with centred…
We prove the edge and bulk universality of random Hermitian matrices with equi-spaced external source. One feature of our method is that we use neither a Christoffel-Darboux type formula, nor a double-contour formula, which are standard…
A Gaussian fluctuation formula is proved for linear statistics of complex random matrices in the case that the statistic is rotationally invariant. For a general linear statistic without this symmetry, Coulomb gas theory is used to predict…
In this paper, we survey some recent progress on rigorously establishing the universality of various spectral statistics of Wigner Hermitian random matrix ensembles, focusing on the Four Moment Theorem and its refinements and applications,…
The four moment theorem asserts, roughly speaking, that the joint distribution of a small number of eigenvalues of a Wigner random matrix (when measured at the scale of the mean eigenvalue spacing) depends only on the first four moments of…
In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
We study the fluctuations of the eigenvalues of real valued large centrosymmetric random matrices via its linear eigenvalue statistic. This is essentially a central limit theorem (CLT) for sums of dependent random variables. The dependence…
A generalized eigenvector of a hypermatrix, called the universal (U-) eigenvector, is proposed, which extended the notion of diagonal (D-) eigenvectors in the literature. Using the semi-tensor product, the homogeneous U-eigenequation can be…