Related papers: Largest eigenvalue statistics of sparse random adj…

A Laplacian matrix is a real symmetric matrix whose row and column sums are zero. We investigate the limiting distribution of the largest eigenvalues of a Laplacian random matrix with Gaussian entries. Unlike many classical matrix…

Let G be a random subgraph of the n-cube where each edge appears randomly and independently with probability p. We prove that the largest eigenvalue of the adjacency matrix of G is almost surely \lambda_1(G)= (1+o(1))…

Let $\mathcal A$ be the adjacency matrix of the Erd\H{o}s-R\'{e}nyi directed graph $\mathscr G(N,p)$. We denote the eigenvalues of $\mathcal A$ by $\lambda_1^{\cal A},...,\lambda^{\cal A}_N$, and $|\lambda_1^{\cal A}|=\max_i|\lambda_i^{\cal…

In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…

Given a large sample covariance matrix $S_N=\frac 1n\Gamma_N^{1/2}Z_N Z_N^*\Gamma_N^{1/2}\, ,$ where $Z_N$ is a $N\times n$ matrix with i.i.d. centered entries, and $\Gamma_N$ is a $N\times N$ deterministic Hermitian positive semidefinite…

We consider the statistics of the extreme eigenvalues of sparse random matrices, a class of random matrices that includes the normalized adjacency matrices of the Erd{\H o}s-R{\'e}nyi graph $G(N,p)$. Recently, it was shown by Lee, up to an…

In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…

Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…

Let $\boldsymbol{\Sigma}_N$ be a $M \times N$ random matrix defined by $\boldsymbol{\Sigma}_N = \mathbf{B}_N + \sigma \mathbf{W}_N$ where $\mathbf{B}_N$ is a uniformly bounded deterministic matrix and where $\mathbf{W}_N$ is an independent…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

We consider the adjacency matrices of sparse random graphs from the Chung-Lu model, where edges are added independently between the $N$ vertices with varying probabilities $p_{ij}$. The rank of the matrix $(p_{ij})$ is some fixed positive…

We study the largest eigenvalue of a Gaussian random symmetric matrix $X_n$, with zero-mean, unit variance entries satisfying the condition $\sup_{(i, j) \ne (i', j')}|\mathbb{E}[X_{ij} X_{i'j'}]| = O(n^{-(1 + \varepsilon)})$, where…

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…

Let $\sqrt{N}+\lambda_{max}$ be the largest real eigenvalue of a random $N\times N$ matrix with independent $N(0,1)$ entries (the `real Ginibre matrix'). We study the large deviations behaviour of the limiting $N\rightarrow \infty$…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

Euclidean random matrices arise in a wide range of physical systems where interactions are determined by spatial configurations, including disordered media and cooperative phenomena in atomic ensembles. Unlike classical random matrix…

We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of…

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.…

Let $X$ be a $p\times n$ independent identically distributed real Gaussian matrix with positive mean $\mu $ and variance $\sigma^2$ entries. The goal of this paper is to investigate the largest eigenvalue of the noncentral sample covariance…