Related papers: Largest eigenvalue statistics of sparse random adj…

Given $A_n:=\frac{1}{\sqrt{n}}(a_{ij})$ an $n\times n$ symmetric random matrix, with elements above the diagonal given by i.i.d. random variables having mean zero and unit variance. It is known that when…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be a diagonal matrix of the degrees of $G$. In 2017, Nikiforov defined the $A_{\alpha}$-matrix of $G$ as \begin{equation*} A_{\alpha}(G)=\alpha G)+(1-\alpha)A(G),…

Invariant ensemble, which are characterised by the joint distribution of eigenvalues $P(\lambda_1,\ldots,\lambda_N)$, play a central role in random matrix theory. We consider the truncated linear statistics $L_K = \sum_{n=1}^K f(\lambda_n)$…

Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…

This paper is the second chapter of three of the author's undergraduate thesis. In this paper, we consider the random matrix ensemble given by $(d_b, d_w)$-regular graphs on $M$ black vertices and $N$ white vertices, where $d_b \in…

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…

In this paper, we investigate the asymptotic spectrum of complex or real Deformed Wigner matrices $(M_N)_N$ defined by $M_N=W_N/\sqrt{N}+A_N$ where $W_N$ is an $N\times N$ Hermitian (resp., symmetric) Wigner matrix whose entries have a…

The eigendecomposition of the coupling matrix of large biological networks is central to the study of the dynamics of these networks. For neural networks, this matrix should reflect the topology of the network and conform with Dale's law…

We establish universal Gaussian fluctuations for the mesoscopic linear eigenvalue statistics in the vicinity of the cusp-like singularities of the limiting spectral density for Wigner-type random matrices. Prior to this work, the linear…

The Weibull--like distributions form a large class of probability distributions that belong to the domain of attraction for the maxima of the Gumbel law. Besides the Weibull distribution, it includes important distributions as the Gamma…

We consider the extreme eigenvalues of the sample covariance matrix $Q=YY^*$ under the generalized elliptical model that $Y=\Sigma^{1/2}XD.$ Here $\Sigma$ is a bounded $p \times p$ positive definite deterministic matrix representing the…

In this paper we focus on the large n probability distribution function of the largest eigenvalue in the Gaussian Orthogonal Ensemble of n by n matrices (GOEn). We prove an Edgeworth type Theorem for the largest eigenvalue probability…

This paper studies the asymptotic behavior of eigenvalues of random abelian G-circulant matrices, that is, matrices whose structure is related to a finite abelian group G in a way that naturally generalizes the relationship between…

The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…

Consider a high-dimensional Wishart matrix $\bd{W}=\bd{X}^T\bd{X}$ where the entries of $\bd{X}$ are i.i.d. random variables with mean zero, variance one, and a finite fourth moment $\eta$. Motivated by problems in signal processing and…

For a graph $G$, the spectral radius $\rho(G)$ of $G$ is the largest eigenvalue of its adjacency matrix. In this paper, we give three lammas on $\rho(G)$ when $G$ contains a spanning complete bipartite graph. Using these lemmas and typical…

We investigate spacing statistics $p(s)$ and distribution of eigenvalues $D(\epsilon)$ for ensembles of various real random matrices (of order $n \times n, n=2$ and $n>>2$) where the matrix-elements have various Probability Distribution…

The upper tail problem for the largest eigenvalue of the Erd\H{o}s--R\'enyi random graph $\mathcal{G}_{n,p}$ is to estimate the probability that the largest eigenvalue of the adjacency matrix of $\mathcal{G}_{n,p}$ exceeds its typical value…

Consider a $N\times n$ matrix $\Sigma_n=\frac{1}{\sqrt{n}}R_n^{1/2}X_n$, where $R_n$ is a nonnegative definite Hermitian matrix and $X_n$ is a random matrix with i.i.d. real or complex standardized entries. The fluctuations of the linear…

We study the spectral measure of large Euclidean random matrices. The entries of these matrices are determined by the relative position of $n$ random points in a compact set $\Omega_n$ of $\R^d$. Under various assumptions we establish the…