Related papers: The Tracy--Widom law for some sparse random matric…
In this paper we study the local law for eigenvalues of large random regular bipartite graphs with degree growing arbitrarily fast. We prove that the empirical spectral distribution of the adjacency matrix converges to a scaled down copy of…
We determine the limiting distribution of the largest eigenvalue of products from the $\beta$-Laguerre ensemble. This limiting distribution is given by a Tracy-Widom law with parameter $\beta_0>0$ depending on the ratio of the parameters of…
The greatest root distribution occurs everywhere in classical multivariate analysis, but even under the null hypothesis the exact distribution has required extensive tables or special purpose software. We describe a simple approximation,…
We consider fluctuations of the largest eigenvalues of the random matrix model $A+UBU^{*}$ where $A$ and $B$ are $N \times N$ deterministic Hermitian (or symmetric) matrices and $U$ is a Haar-distributed unitary (or orthogonal) matrix. We…
The classical infinite divisibility of distributions related to eigenvalues of some random matrix ensembles is investigated. It is proved that the $\beta$-Tracy-Widom distribution, which is the limiting distribution of the largest…
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\'enyi graph $G(N,p)$. Tracy-Widom fluctuations of the extreme…
This paper proves universality of the distribution of the smallest and largest gaps between eigenvalues of generalized Wigner matrices, under some smoothness assumption for the density of the entries. The proof relies on the Erd{\H…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
The universality phenomenon asserts that the distribution of the eigenvalues of random matrix with i.i.d. zero mean, unit variance entries does not depend on the underlying structure of the random entries. For example, a plot of the…
We analyze a random projection method for adjacency matrices, studying its utility in representing sparse graphs. We show that these random projections retain the functionality of their underlying adjacency matrices while having extra…
We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…
We establish the relation between two objects: an integrable system related to Painlev\'e II equation, and the symplectic invariants of a certain plane curve S(TW). This curve describes the average eigenvalue density of a random hermitian…
The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…
In this paper, we obtain a precise estimate of the probability that the sparse binomial random graph contains a large number of vertices in a triangle. The estimate of log of this probability is correct up to second order, and enables us to…
We show that the fluctuations of the largest eigenvalue of any generalized Wigner matrix $H$ converge to the Tracy-Widom laws at a rate nearly $O(N^{-1/3})$, as the matrix dimension $N$ tends to infinity. We allow the variances of the…
We study a family of distributions that arise in critical unitary random matrix ensembles. They are expressed as Fredholm determinants and describe the limiting distribution of the largest eigenvalue when the dimension of the random…
Random-matrix theory is applied to transition-rate matrices in the Pauli master equation. We study the distribution and correlations of eigenvalues, which govern the dynamics of complex stochastic systems. Both the cases of identical and of…
We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of adjacency matrix of various model networks, namely, random,…
Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…
We consider the spectral properties of sparse stochastic block models, where $N$ vertices are partitioned into $K$ balanced communities. Under an assumption that the intra-community probability and inter-community probability are of similar…