Related papers: Roy's largest root under rank-one alternatives:The…
The paper "An efficient sampling scheme for the eigenvalues of dual Wishart matrices", by I.~Santamar\'ia and V.~Elvira, [\emph{IEEE Signal Processing Letters}, vol.~28, pp.~2177--2181, 2021] \cite{SE21}, poses the question of efficient…
This paper proposes a unified approach that enables the Wishart distribution to be studied simultaneously in the real, complex, quaternion and octonion cases. In particular, the noncentral generalised Wishart distribution, the joint density…
Eigenvalues of Wigner matrices has been a major topic of investigation. A particularly important subclass of such random matrices is formed by the adjacency matrix of an Erd\H{o}s-R\'{e}nyi graph $\mathcal{G}_{n,p}$ equipped with i.i.d.…
A Wishart matrix is said to be spiked when the underlying covariance matrix has a single eigenvalue $b$ different from unity. As $b$ increases through $b=2$, a gap forms from the largest eigenvalue to the rest of the spectrum, and with…
We present an analytical technique to compute the probability of rare events in which the largest eigenvalue of a random matrix is atypically large (i.e.\ the right tail of its large deviations). The results also transfer to the left tail…
We discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank technique.…
With the pervasiveness of Stochastic Shortest-Path (SSP) problems in high-risk industries, such as last-mile autonomous delivery and supply chain management, robust planning algorithms are crucial for ensuring successful task completion…
As in random matrix theories, eigenvector/value distributions are important quantities of random tensors in their applications. Recently, real eigenvector/value distributions of Gaussian random tensors have been explicitly computed by…
The sum of Wishart matrices has an important role in multiuser communication employing multiantenna elements, such as multiple-input multiple-output (MIMO) multiple access channel (MAC), MIMO Relay channel, and other multiuser channels…
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…
This work analyzes singular-value spectra of weight matrices in pretrained transformer models to understand how information is stored at both ends of the spectrum. Using Random Matrix Theory (RMT) as a zero information hypothesis, we…
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…
We study the distribution of the largest eigenvalue in formal Hermitian one-matrix models at multicriticality, where the spectral density acquires an extra number of k-1 zeros at the edge. The distributions are directly expressed through…
This paper deals with symmetric random matrices whose upper diagonal entries are obtained from a linear random field with heavy tailed noise. It is shown that the maximum eigenvalue and the spectral radius of such a random matrix with…
We analytically compute the large-deviation probability of a diagonal matrix element of two cases of random matrices, namely $\beta=[\vec H^\dagger\vec H]^{-1}_{11}$ and $\gamma=[\vec I_N+\rho\vec H^\dagger\vec H]^{-1}_{11}$, where $\vec H$…
Received signal strength (RSS)-based wireless localization is easy to implement at low cost. In practice,exact positions of anchors may not be available. This paper focuses on determining the location of a source in the presence of…
We study the probability distribution function $P(\lambda)$ of the largest eigenvalue $\lambda_{\rm max}$ of $N \times N$ random matrices of the form $H + V$, where $H$ belongs to the GOE/GUE ensemble and $V$ is a full rank deterministic…
We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and the corresponding…
A number of random matrix ensembles permitting exact determination of their eigenvalue and eigenvector statistics maintain this property under a rank $1$ perturbation. Considered in this review are the additive rank $1$ perturbation of the…
The paper is concerned with deformed Wigner random matrices. These matrices are closely related to Deep Neural Networks (DNNs): weight matrices of trained DNNs could be represented in the form $R + S$, where $R$ is random and $S$ is highly…