Related papers: Numerical Methods for Eigenvalue Distributions of …
Statistical properties of ensembles of random density matrices are investigated. We compute traces and von Neumann entropies averaged over ensembles of random density matrices distributed according to the Bures measure. The eigenvalues of…
We derive exact analytic expressions for the distributions of eigenvalues and singular values for the product of an arbitrary number of independent rectangular Gaussian random matrices in the limit of large matrix dimensions. We show that…
We calculate analytically, for finite-size matrices, joint probability densities of ratios of level spacings in ensembles of random matrices characterized by their associated confining potential. We focus on the ratios of two spacings…
We find the precise rate at which the empirical measure associated to a $\beta$-ensemble converges to its limiting measure. In our setting the $\beta$-ensemble is a random point process on a compact complex manifolds distributed according…
We compute the joint eigenvalue distribution for a multiplicative non-Hermitian perturbation $(I+i\Gamma)H$, $\operatorname{rank}\,\Gamma=1$ of a random matrix $H$ from the Gaussian, Laguerre, and chiral Gaussian $\beta$-ensembles.
We extend classical time-frequency limiting analysis, historically applied to one-dimensional finite signals, to the multidimensional discrete setting. This extension is relevant for images, videos, and other multidimensional signals, as it…
The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…
Random Matrix Theory is a powerful tool in applied mathematics. Three canonical models of random matrix distributions are the Gaussian Orthogonal, Unitary and Symplectic Ensembles. For matrix ensembles defined on k-fold tensor products of…
We compute statistical distributions of individual low-lying eigenvalues of random matrix ensembles interpolating chiral Gaussian symplectic and unitary ensembles. To this aim we use the Nystrom-type discretization of Fredholm Pfaffians and…
I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…
We examine the adjacency matrices of three-regular graphs representing one-face maps. Numerical studies reveal that the limiting eigenvalue statistics of these matrices are the same as those of much larger, and more widely studied classes…
Finding the eigenvalues connected to the covariance operator of a centred Hilbert-space valued Gaussian process is genuinely considered a hard problem in several mathematical disciplines. In statistics this problem arises for instance in…
We study CMV matrices (a discrete one-dimensional Dirac-type operator) with random decaying coefficients. Under mild assumptions we identify the local eigenvalue statistics in the natural scaling limit. For rapidly decreasing coefficients,…
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…
We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
We present a five-step method for the calculation of eigenvalue correlation functions for various ensembles of real random matrices, based upon the method of (skew-) orthogonal polynomials. This scheme systematises existing methods and also…
We consider $N\times N$ Hermitian or symmetric random matrices with independent entries. The distribution of the $(i,j)$-th matrix element is given by a probability measure $\nu_{ij}$ whose first two moments coincide with those of the…
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…