Related papers: Random matrices with row constraints and eigenvalu…
We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…
This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…
We consider $N\times N$ self-adjoint Gaussian random matrices defined by an arbitrary deterministic sparsity pattern with $d$ nonzero entries per row. We show that such random matrices exhibit a canonical localization-delocalization…
We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…
In this note, we show that the norm of an $n\times n$ random jointly exchangeable matrix with zero diagonal can be estimated in terms of the norm of its $n/2\times n/2$ submatrix located in the top right corner. As a consequence, we prove a…
Consider an $N\times N$ hermitian random matrix with independent entries, not necessarily Gaussian, a so called Wigner matrix. It has been conjectured that the local spacing distribution, i.e. the distribution of the distance between…
We introduce a powerful analytic method to study the statistics of the number $\mathcal{N}_{\textbf{A}}(\gamma)$ of eigenvalues inside any contour $\gamma \in \mathbb{C}$ for infinitely large non-Hermitian random matrices ${\textbf A}$. Our…
We investigate the level spacing distribution for three ensembles of real symmetric matrices having additional structural constraint to reduce the number of independent entries to only $ (n+1)/2 $ in contrast to the $ n(n+1)/2 $ for a real…
We study the nodal intersections number of random Gaussian toral Laplace eigenfunctions ("arithmetic random waves") against a fixed smooth reference curve. The expected intersection number is proportional to the the square root of the…
We consider the statistics of extreme eigenvalues of random $d$-regular graphs, with $N^{\mathfrak c}\leq d\leq N^{1/3-{\mathfrak c}}$ for arbitrarily small ${\mathfrak c}>0$. We prove that in this regime, the fluctuations of extreme…
Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…
The properties of eigenvalues of large dimensional random matrices have received considerable attention. One important achievement is the existence and identification of the limiting spectral distribution of the empirical spectral…
Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
We use the idea of a Wigner surmise to compute approximate distributions of the first eigenvalue in chiral Random Matrix Theory, for both real and complex eigenvalues. Testing against known results for zero and maximal non-Hermiticity in…
The paper deals with the distribution of singular values of the input-output Jacobian of deep untrained neural networks in the limit of their infinite width. The Jacobian is the product of random matrices where the independent rectangular…
We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
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…
Random matrix theory is a powerful way to describe universal correlations of eigenvalues of complex systems. It also may serve as a schematic model for disorder in quantum systems. In this review, we discuss both types of applications of…