相关论文: Limit Correlation Functions for Fixed Trace Random…

We study the averaged product of characteristic polynomials of large random matrices in the Gaussian beta-ensemble perturbed by an external source of finite rank. We prove that at the edge of the spectrum, the limiting correlations involve…

This work derives extremal tail bounds for the Gaussian trace estimator applied to a real symmetric matrix. We define a partial ordering on the eigenvalues, so that when a matrix has greater spectrum under this ordering, its estimator will…

The limiting distribution of eigenvalues of N x N random matrices has many applications. One of the most studied ensembles are real symmetric matrices with independent entries iidrv; the limiting rescaled spectral measure (LRSM)…

We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…

We study existence and universality of scaling limits for the eigenvalues of a random normal matrix, in particular at points on the boundary of the spectrum. Our approach uses Ward's equation, which is an identity satisfied by the 1-point…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study…

The open problem of calculating the limiting spectrum (or its Shannon transform) of increasingly large random Hermitian finite-band matrices is described. In general, these matrices include a finite number of non-zero diagonals around their…

We introduce random matrix ensembles that correspond to the infinite families of irreducible Riemannian symmetric spaces of type I. In particular, we recover the Circular Orthogonal and Symplectic Ensembles of Dyson, and find other families…

It was shown roughly thirty years ago that the density correlations of eigenvalues of large random matrices display a universal form, independent of most of the details of the distribution of the random matrix itself. We show that when the…

A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…

The spectral statistics and entanglement within the eigenstates of generic spin chain Hamiltonians are analysed. A class of random matrix ensembles is defined which include the most general nearest-neighbour qubit chain Hamiltonians. For…

Signatures of universality are detected by comparing individual eigenvalue distributions and level spacings from financial covariance matrices to random matrix predictions. A chopping procedure is devised in order to produce a statistical…

This paper studies the extreme gaps between eigenvalues of random matrices. We give the joint limiting law of the smallest gaps for Haar-distributed unitary matrices and matrices from the Gaussian unitary ensemble. In particular, the kth…

The relative distance between eigenvalues of the compression of a not necessarily semibounded self-adjoint operator to a closed subspace and some of the eigenvalues of the original operator in a gap of the essential spectrum is considered.…

Determining the number of common factors is an important and practical topic in high dimensional factor models. The existing literatures are mainly based on the eigenvalues of the covariance matrix. Due to the incomparability of the…

The statistical behaviour of the smallest eigenvalue has important implications for systems which can be modeled using a Wishart-Laguerre ensemble, the regular one or the fixed trace one. For example, the density of the smallest eigenvalue…

We consider a class of rotationally invariant unitary random matrix ensembles where the eigenvalue density falls off as an inverse power law. Under a new scaling appropriate for such power law densities (different from the scaling required…

In this paper we study the concentration properties for the eigenvalues of kernel matrices, which are central objects in a wide range of kernel methods and, more recently, in network analysis. We present a set of concentration inequalities…

We calculate wide distance connected correlators in non-gaussian orthogonal, unitary and symplectic random matrix ensembles by solving the loop equation in the 1/N-expansion. The multi-level correlator is shown to be universal in large N…