Related papers: Universality for the Toda algorithm to compute the…

We consider the uniform approximation of the smallest eigenvalue of a large parameter-dependent Hermitian matrix by that of a smaller counterpart obtained through projections. The projection subspaces are constructed iteratively by means of…

We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…

We exhibit a randomized algorithm which given a matrix $A\in \mathbb{C}^{n\times n}$ with $\|A\|\le 1$ and $\delta>0$, computes with high probability an invertible $V$ and diagonal $D$ such that $\|A-VDV^{-1}\|\le \delta$ using…

We present some applications of central limit theorems on mesoscopic scales for random matrices. When combined with the recent theory of "homogenization" for Dyson Brownian Motion, this yields the universality of quantities which depend on…

We consider the least singular value of $M = R^* X T + U^* YV$, where $R,T,U,V$ are independent Haar-distributed unitary matrices and $X, Y$ are deterministic diagonal matrices. Under weak conditions on $X$ and $Y$, we show that the…

Using large $N$ arguments, we propose a scheme for calculating the two-point eigenvector correlation function for non-normal random matrices in the large $N$ limit. The setting generalizes the quaternionic extension of free probability to…

For sample covariance matrices with iid entries with sub-Gaussian tails, when both the number of samples and the number of variables become large and the ratio approaches to one, it is a well-known result of A. Soshnikov that the limiting…

We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…

This paper studies the delocalized regime of an ultrametric random operator whose independent entries have variances decaying in a suitable hierarchical metric on $\mathbb{N}$. When the decay-rate of the off-diagonal variances is…

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…

Consider $N\times N$ Hermitian or symmetric random matrices $H$ where the distribution of the $(i,j)$ matrix element is given by a probability measure $\nu_{ij}$ with a subexponential decay. Let $\sigma_{ij}^2$ be the variance for the…

The classical infinite divisibility of distributions related to eigenvalues of some random matrix ensembles is investigated. It is proved that the $\beta$-Tracy-Widom distribution, which is the limiting distribution of the largest…

We compute analytically the probability density function (pdf) of the largest eigenvalue $\lambda_{\max}$ in rotationally invariant Cauchy ensembles of $N\times N$ matrices. We consider unitary ($\beta = 2$), orthogonal ($\beta =1$) and…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

The authors present empirical distributions for the halting time (measured by the number of iterations to reach a given accuracy) of optimization algorithms applied to two random systems: spin glasses and deep learning. Given an algorithm,…

For correlated real symmetric or complex Hermitian random matrices, we prove that the local eigenvalue statistics at any cusp singularity are universal. Since the density of states typically exhibits only square root edge or cubic root cusp…

The eigenvalues of quantum chaotic systems have been conjectured to follow, in the large energy limit, the statistical distribution of eigenvalues of random ensembles of matrices of size $N\rightarrow\infty$. Here we provide semiclassical…

This paper presents two universal algorithms for generalized Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.

We prove that the local eigenvalue statistics of real symmetric Wigner-type matrices near the cusp points of the eigenvalue density are universal. Together with the companion paper [arXiv:1809.03971], which proves the same result for the…

We consider $N\times N$ symmetric or hermitian random matrices with independent, identically distributed entries where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove…