Related papers: Eigenvalue approximation of sums of Hermitian matr…
Cooperative spectrum sensing based on the limiting eigenvalue ratio of the covariance matrix offers superior detection performance and overcomes the noise uncertainty problem. While an exact expression exists, it is complex and multiple…
The eigenvalue distribution is investigated for matrix models related via the localization to Chern-Simons-matter theories. An integral representation of the planar resolvent is used to derive the positions of the branch points of the…
We establish universality of local eigenvalue correlations in unitary random matrix ensembles (1/Z_n) |\det M|^{2\alpha} e^{-n\tr V(M)} dM near the origin of the spectrum. If V is even, and if the recurrence coefficients of the orthogonal…
The aim of this paper is to show how free probability theory sheds light on spectral properties of deformed matricial models and provides a unified understanding of various asymptotic phenomena such as spectral measure description,…
Results regarding probable bifurcations from fixed points are presented in the context of general dynamical systems (real, random matrices), time-delay dynamical systems (companion matrices), and a set of mappings known for their properties…
Consider a random matrix $\mathbf{A}\in\mathbb{C}^{m\times n}$ ($m \geq n$) containing independent complex Gaussian entries with zero mean and unit variance, and let $0<\lambda_1\leq \lambda_{2}\leq ...\leq \lambda_n<\infty$ denote the…
Covariance matrices are fundamental to the analysis and forecast of economic, physical and biological systems. Although the eigenvalues $\{\lambda_i\}$ and eigenvectors $\{{\bf u}_i\}$ of a covariance matrix are central to such endeavors,…
We study the phenomenon of "crowding" near the largest eigenvalue $\lambda_{\max}$ of random $N \times N$ matrices belonging to the Gaussian Unitary Ensemble (GUE) of random matrix theory. We focus on two distinct quantities: (i) the…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
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…
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 prove an optimal order delocalization estimate for the eigenvectors of general $N \times N$ non-Hermitian matrices $X$: $\| {\bf v } \|_\infty \leq C \sqrt{\frac{\log N}{N}}$ with very high probability, for any right or left eigenvector…
Recently, we have classified Hermitian random matrix ensembles that are invariant under the conjugate action of the unitary group and stable with respect to matrix addition. Apart from a scaling and a shift, the whole information of such an…
We study the distribution of eigenvalues of almost-Hermitian random matrices associated with the classical Gaussian and Laguerre unitary ensembles. In the almost-Hermitian setting, which was pioneered by Fyodorov, Khoruzhenko and Sommers in…
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such…
In this paper we present an efficient algorithm to compute the eigen decomposition of a matrix that is a weighted sum of the self outer products of vectors such as a covariance matrix of data. A well known algorithm to compute the eigen…
We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…
Traditional numerical methods for calculating matrix eigenvalues are prohibitively expensive for high-dimensional problems. Iterative random sparsification methods allow for the estimation of a single dominant eigenvalue at reduced cost by…
The eigenvalue densities of two random matrix ensembles, the Wigner Gaussian matrices and the Wishart covariant matrices, are decomposed in the contributions of each individual eigenvalue distribution. It is shown that the fluctuations of…
The spectral densities of ensembles of non-Hermitian sparse random matrices are analysed using the cavity method. We present a set of equations from which the spectral density of a given ensemble can be efficiently and exactly calculated.…