Related papers: Quantitative Edge Eigenvector Universality for Ran…

We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…

This is the first in a series of six articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. Many of…

We study quantum property testing for directed graphs with maximum in-degree and out-degree bounded by some universal constant $d$. For a proximity parameter $\varepsilon$, we show that any property that can be tested with…

The conjectured three generic local bulk statistics amongst all non-Hermitian random matrix symmetry classes have recently been extended to three generic local edge statistics. We study analytically and numerically complex spacing ratios…

We investigate the overlap matrix between the eigenvectors of a Wigner matrix $H_{N+K}$ of size $(N+K)\times(N+K)$ and those of its principal minor $H_N$ of size $N\times N$, for both the real symmetric ($\beta=1$) and complex Hermitian…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

In this article, we obtain explicit bounds on the uniform distance between the cumulative distribution function of a standardized sum $S_n$ of $n$ independent centered random variables with moments of order four and its first-order…

We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…

We prove that the distribution of eigenvectors of generalized Wigner matrices is universal both in the bulk and at the edge. This includes a probabilistic version of local quantum unique ergodicity and asymptotic normality of the…

This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…

We consider Berry's random planar wave model (1977) for a positive Laplace eigenvalue $E>0$, both in the real and complex case, and prove limit theorems for the nodal statistics associated with a smooth compact domain, in the high-energy…

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…

We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra…

This is the fifth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with…

We give the first polynomial-time, differentially node-private, and robust algorithm for estimating the edge density of Erd\H{o}s-R\'enyi random graphs and their generalization, inhomogeneous random graphs. We further prove…

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

The vertex isoperimetric number of a graph $G=(V,E)$ is the minimum of the ratio $|\partial_{V}U|/|U|$ where $U$ ranges over all nonempty subsets of $V$ with $|U|/|V|\le u$ and $\partial_{V}U$ is the set of all vertices adjacent to $U$ but…

We take another look at using Stein's method to establish uniform Berry-Esseen bounds for Studentized nonlinear statistics, highlighting variable censoring and an exponential randomized concentration inequality for a sum of censored…

Given a weakly dependent stationary process, we describe the transition between a Berry-Esseen bound and a second order Edgeworth expansion in terms of the Berry-Esseen characteristic. This characteristic is sharp: We show that Edgeworth…