Related papers: Local law and Tracy-Widom limit for sparse sample …
Sparse graphs with bounded average degree form a rich class of discrete structures where local geometry strongly influences global behavior. The Benjamini-Schramm (BS) convergence offers a natural framework to describe their asymptotic…
We studied the universality of Wishart ensembles whose covariance matrix has 2 distinct eigenvalues. We studied the asymptotic limit when the number of both eigenvalues goes to infinity and obtained universality results. In this case, the…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…
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.…
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 prove a local law and eigenvector delocalization for general Wigner-type matrices. Our methods allow us to get the best possible interval length and optimal eigenvector delocalization in the dense case, and the first results of such kind…
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 consider the sum of two large Hermitian matrices $A$ and $B$ with a Haar unitary conjugation bringing them into a general relative position. We prove that the eigenvalue density on the scale slightly above the local eigenvalue spacing is…
In this note, we give a precise description of the limiting empirical spectral distribution (ESD) for the non-backtracking matrices for an Erd\H{o}s-R\'{e}nyi graph assuming $np/\log n$ tends to infinity. We show that derandomizing part of…
We study the spectrum of a random multigraph with a degree sequence ${\bf D}_n=(D_i)_{i=1}^n$ and average degree $1 \ll \omega_n \ll n$, generated by the configuration model, and also the spectrum of the analogous random simple graph. We…
We develop a new method for deriving local laws for a large class of random matrices. It is applicable to many matrix models built from sums and products of deterministic or independent random matrices. In particular, it may be used to…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
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…
We compute the Tracy-Widom distribution describing the asymptotic distribution of the largest eigenvalue of a large random matrix by solving a boundary-value problem posed by Bloemendal in his Ph.D. Thesis (2011). The distribution is…
We study the large-deviation properties of minimum spanning trees for two ensembles of random graphs with $N$ nodes. First, we consider complete graphs. Second, we study Erd\H{o}s-R\'{e}nyi (ER) random graphs with edge probability $p=c/N$…
The eigendecomposition of the coupling matrix of large biological networks is central to the study of the dynamics of these networks. For neural networks, this matrix should reflect the topology of the network and conform with Dale's law…
In random matrix theory (RMT), the Tracy-Widom (TW) distribution describes the behavior of the largest eigenvalue. We consider here two models in which TW undergoes transformations. In the first one disorder is introduced in the Gaussian…
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…