Related papers: Largest eigenvalue statistics of sparse random adj…
In this paper, we investigate the eigenvalue distribution of a class of kernel random matrices whose $(i,j)$-th entry is $f(X_i,X_j)$ where $f$ is a symmetric function belonging to the Paley-Wiener space $\mathcal{B}_c$ and $(X_i)_{1\leq i…
The focus of this survey paper is on the distribution function for the largest eigenvalue in the finite N Gaussian ensembles (GOE,GUE,GSE) in the edge scaling limit of N->infinity. These limiting distribution functions are expressible in…
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…
We characterize the phenomenon of "crowding" near the largest eigenvalue $\lambda_{\max}$ of random $N \times N$ matrices belonging to the Gaussian $\beta$-ensemble of random matrix theory, including in particular the Gaussian orthogonal…
We consider a spiked random matrix model obtained by applying a function entrywise to a signal-plus-noise symmetric data matrix. We prove that the largest eigenvalue of this model, which we call a transformed spiked Wigner matrix, exhibits…
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…
We study the asymptotic distributions of the spiked eigenvalues and the largest nonspiked eigenvalue of the sample covariance matrix under a general covariance matrix model with divergent spiked eigenvalues, while the other eigenvalues are…
Let $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$ denote the adjacency eigenvalues of a graph $G$ of order $n$. We prove that for every $k\geq 2$ and every graph $G$ on $n\geq k$ vertices, $$ \lambda_k(G)\le…
We study the asymptotic behavior of the eigenvalues of Gaussian perturbations of large Hermitian random matrices for which the limiting eigenvalue density vanishes at a singular interior point or vanishes faster than a square root at a…
We consider the adjacency operator $A$ of the Linial-Meshulam model $X(d,n,p)$ for random $d-$dimensional simplicial complexes on $n$ vertices, where each $d-$cell is added independently with probability $p\in[0,1]$ to the complete…
Consider a $N\times n$ random matrix $Z_n=(Z^n_{j_1 j_2})$ where the individual entries are a realization of a properly rescaled stationary gaussian random field. The purpose of this article is to study the limiting empirical distribution…
In this text, we consider an N by N random matrix X such that all but o(N) rows of X have W non identically zero entries, the other rows having lass than $W$ entries (such as, for example, standard or cyclic band matrices). We always…
We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs $(G_n)_{n\geq0}$ converging locally to a Galton--Watson tree $T$ (GWT), we provide an explicit formula for the asymptotic multiplicity…
Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…
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…
Consider a random symmetric matrix with i.i.d.~entries on and above its diagonal that are products of Bernoulli random variables and random variables with sub-Gaussian tails. Such a matrix will be called a sparse Wigner matrix and can be…
We study random k-lifts of large, but otherwise arbitrary graphs G. We prove that, with high probability, all eigenvalues of the adjacency matrix of the lift that are not eigenvalues of G are of the order (D ln (kn))^{1/2}, where D is the…
In this paper we study the diameter of the random graph $G(n,p)$, i.e., the the largest finite distance between two vertices, for a wide range of functions $p=p(n)$. For $p=\la/n$ with $\la>1$ constant, we give a simple proof of an…
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…
In this note, we establish the convergence in distribution of the maxima of i.i.d. random variables to the Gumbel distribution with the associated normalizing sequences for several examples that are related to the normal distribution.…