Related papers: Benjamini-Schramm convergence and limiting eigenva…

We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ graphs on $N$ vertices where every edge is chosen independently and with probability $p \equiv p(N)$. We rescale the matrix so that its bulk…

Consider an $N$ by $N$ matrix $X$ of complex entries with iid real and imaginary parts. We show that the local density of eigenvalues of $X^*X$ converges to the Marchenko-Pastur law on the optimal scale with probability $1$. We also obtain…

This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…

Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…

Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…

In this paper we study entanglement of the reduced density matrix of a bipartite quantum system in a random pure state. It transpires that this involves the computation of the smallest eigenvalue distribution of the fixed trace Laguerre…

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…

Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…

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…

In this paper, we consider the soft geometric block model (SGBM) with a fixed number $k \geq 2$ of homogeneous communities in the dense regime, and we introduce a spectral clustering algorithm for community recovery on graphs generated by…

Local dependence random graph models are a class of block models for network data which allow for dependence among edges under a local dependence assumption defined around the block structure of the network. Since being introduced by…

We consider a versatile matrix model of the form ${\bf A}+i {\bf B}$, where ${\bf A}$ and ${\bf B}$ are real random circulant matrices with independent but, in general, nonidentically distributed Gaussian entries. For this model, we derive…

We prove a general local law for Wigner matrices which optimally handles observables of arbitrary rank and thus it unifies the well-known averaged and isotropic local laws. As an application, we prove that the quadratic forms of a general…

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…

We show how the infinitesimal exchangeable pairs approach to Stein's method combines naturally with the theory of Markov semigroups. We present a multivariate normal approximation theorem for functions of a random variable invariant with…

We define a variant of Benjamini-Schramm convergence for finite simplicial complexes with the action of a fixed finite group G which leads to the notion of random rooted simplicial G-complexes. For every random rooted simplicial G-complex…

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 empirical eigenvalue distribution of random real symmetric matrices with stochastically independent skew-diagonals and study its limit if the matrix size tends to infinity. We allow correlations between entries on the same…

Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…

We develop a unified approach to bounding the largest and smallest singular values of an inhomogeneous random rectangular matrix, based on the non-backtracking operator and the Ihara-Bass formula for general random Hermitian matrices with a…