Related papers: Edge Universality of Sparse Random Matrices
We study eigenvalue distribution of the adjacency matrix $A^{(N,p,q)}$ of weighted random uniform $q$-hypergraphs $\Gamma= \Gamma_{N,p,q}$. We assume that the graphs have $N$ vertices and the average number of hyperedges attached to one…
The extreme eigenvalues of adjacency matrices are important indicators on the influences of topological structures to collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme…
We study the rate of convergence for the largest eigenvalue distributions in the Gaussian unitary and orthogonal ensembles to their Tracy-Widom limits. We show that one can achieve an $O(N^{-2/3})$ rate with particular choices of the…
We prove the first explicit rate of convergence to the Tracy-Widom distribution for the fluctuation of the largest eigenvalue of sample covariance matrices that are not integrable. Our primary focus is matrices of type $ X^*X $ and the…
We present a general method to obtain the exact rate function $\Psi_{[a,b]}(k)$ controlling the large deviation probability $\text{Prob}[\mathcal{I}_N[a,b]=kN] \asymp e^{-N\Psi_{[a,b]}(k)}$ that a $N \times N$ sparse random matrix has…
In this paper, we first briefly review some recent results on the distribution of the maximal eigenvalue of a $(N\times N)$ random matrix drawn from Gaussian ensembles. Next we focus on the Gaussian Unitary Ensemble (GUE) and by suitably…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
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…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
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…
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…
For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…
We consider $N\times N$ symmetric random matrices where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove that the eigenvalue spacing statistics in the bulk of the…
In this paper we consider the problem of estimating the joint upper and lower tail large deviations of the edge eigenvalues of an Erd\H{o}s-R\'enyi random graph $\mathcal{G}_{n,p}$, in the regime of $p$ where the edge of the spectrum is no…
We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and…
We consider the adjacency matrix $A$ of the Erd\H{o}s-R\'enyi graph on $N$ vertices with edge probability $d/N$. For $(\log \log N)^4 \ll d \lesssim \log N$, we prove that the eigenvalues near the spectral edge form asymptotically a Poisson…
In this paper, we prove a necessary and sufficient condition for the edge universality of sample covariance matrices with general population. We consider sample covariance matrices of the form $\mathcal Q = TX(TX)^{*}$, where the sample $X$…
In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…
We consider the asymptotic fluctuation behavior of the largest eigenvalue of certain sample covariance matrices in the asymptotic regime where both dimensions of the corresponding data matrix go to infinity. More precisely, let $X$ be an…