Related papers: Limit Correlation Functions for Fixed Trace Random…
A formalism for study of spectral correlations in non-Gaussian, unitary invariant ensembles of large random matrices with strong level confinement is reviewed. It is based on the Shohat method in the theory of orthogonal polynomials. The…
Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which…
We describe a method to determine the eigenvalue density of empirical covariance matrix in the presence of correlations between samples. This is a straightforward generalization of the method developed earlier by the authors for…
We show that several statistics of the number of intersections between random eigenfunctions of general eigenvalues with a given smooth curve in flat tori are universal under various families of randomness.
We consider ensembles of random matrices, known as biorthogonal ensembles, whose eigenvalue probability density function can be written as a product of two determinants. These systems are closely related to multiple orthogonal functions. It…
We study the effect of highly oscillatory potentials to the eigenvalues of a random matrix. Consider the circular unitary ensembles with an external potential which is periodic with the period comparable to the average spacing of the…
The usual procedure of including a finite number of vertices in Non Perturbative Renormalization Group equations in order to obtain $n$-point correlation functions at finite momenta is analyzed. This is done by exploiting a general method…
We consider the empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…
The goal of this article is to study how much the eigenvalues of large Hermitian random matrices deviate from certain deterministic locations -- or in other words, to investigate optimal rigidity estimates for the eigenvalues. We do this in…
The usual formulas for the correlation functions in orthogonal and symplectic matrix models express them as quaternion determinants. From this representation one can deduce formulas for spacing probabilities in terms of Fredholm…
We construct a correlation matrix based financial network for a set of New York Stock Exchange (NYSE) traded stocks with stocks corresponding to nodes and the links between them added one after the other, according to the strength of the…
One object of interest in random matrix theory is a family of point ensembles (random point configurations) related to various systems of classical orthogonal polynomials. The paper deals with a one--parametric deformation of these…
We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
For random systems subject to a constraint, the microcanonical ensemble requires the constraint to be met by every realisation ("hard constraint"), while the canonical ensemble requires the constraint to be met only on average ("soft…
We investigate the universality of microscopic eigenvalue correlations for Random Matrix Theories with the global symmetries of the QCD partition function. In this article we analyze the case of real valued chiral Random Matrix Theories…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
Exploiting the explicit bijection between the density of singular values and the density of eigenvalues for bi-unitarily invariant complex random matrix ensembles of finite matrix size, we aim at finding the induced probability measure on…
We show how positive unital linear maps can be used to obtain some bounds for the eigenvalues of nonnegative matrices.
We present a concentration inequality for linear functionals of noncommutative polynomials in random matrices. Our hypotheses cover most standard ensembles, including Gaussian matrices, matrices with independent uniformly bounded entries…