Related papers: Bulk universality of sparse random matrices

We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world and random networks follow…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erd\H{o}s-Gallai Theorem in random graphs. In particular, we determine, up to a constant…

We consider $N\times N$ random matrices of the form $H=W+V$ where $W$ is a real symmetric or complex Hermitian Wigner matrix and $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume…

Properties of universality have essential relevance for the theory of random matrices usually called the Wigner ensemble. The issue was analysed up to recent years with detailed and relevant results. We present a slightly different view and…

Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

Using the replica method, we develop an analytical approach to compute the characteristic function for the probability $\mathcal{P}_N(K,\lambda)$ that a large $N \times N$ adjacency matrix of sparse random graphs has $K$ eigenvalues below a…

We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

We consider large non-Hermitian real or complex random matrices $X$ with independent, identically distributed centred entries. We prove that their local eigenvalue statistics near the spectral edge, the unit circle, coincide with those of…

We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…

We consider extremal eigenvalues of sparse random matrices, a class of random matrices including the adjacency matrices of Erd\H{o}s-R\'{e}nyi graphs $\mathcal{G}(N,p)$. Recently, it was shown that the leading order fluctuations of extremal…

We study the universality of the eigenvalue statistics of the covariance matrices $\frac{1}{n}M^* M$ where $M$ is a large $p\times n$ matrix obeying condition $\bf{C1}$. In particular, as an application, we prove a variant of universality…

We study the universal properties of distributions of eigenvalues of random matrices in the large $N$ limit. The distributions fall in universality classes characterized entirely by the support of the spectral density.

Recently we proved (EPRSY, ERSTVY, ESY4, ESYY, EYY, EYY2, EYYrigi) that the eigenvalue correlation functions of a general class of random matrices converge, weakly with respect to the energy, to the corresponding ones of Gaussian matrices.…

We study adjacency and Laplacian matrices of Erd\H{o}s-R\'{e}nyi $r$-uniform hypergraphs on $n$ vertices with hyperedge inclusion probability $p$, in the setting where $r$ can vary with $n$ such that $r / n \to c \in [0, 1)$. Adjacency…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

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 invariant random matrix ensembles \begin{equation*} \mathbb{P}_n(d M)=Z_n^{-1}\exp(-n\,tr(V(M)))\,d M \end{equation*} defined on complex Hermitian matrices $M$ of size $n\times n$, where $V$ is real analytic such that the…