Related papers: Log-concavity and concentration bounds for a singl…
We calculate the probability to find exactly $n$ eigenvalues in a spectral interval of a large random $N \times N$ matrix when this interval contains $s \ll N$ eigenvalues on average. The calculations exploit an analogy to the problem of…
We study sums of absolute values of Hecke eigenvalues of $\textrm{GL}(2)$ representations that are tempered at all finite places. We show that these sums exhibit logarithmic savings over the trivial bound if and only if the representation…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce…
Let $G$ be a connected graph of order $n$ with girth $g$. For $k=1,\dots,\min\{g-1, n-g\}$, let $n(G,k)$ be the number of Laplacian eigenvalues (counting multiplicities) of $G$ that fall inside the interval $[n-g-k+4,n]$. We prove that if…
We extend classical time-frequency limiting analysis, historically applied to one-dimensional finite signals, to the multidimensional discrete setting. This extension is relevant for images, videos, and other multidimensional signals, as it…
Let $L$ be a big invertible sheaf on a complex projective variety, equipped with two continuous metrics. We prove that the distribution of the eigenvalues of the transition matrix between the $L^2$ norms on $H^0(X,nL)$ with respect to the…
We study the distribution of the minimum spacing between eigenvalues of a random n by n unitary matrix. The minimum spacing scales as $n^{-4/3}$, not $n^{-2}$ as would be the case for n independent points on the unit circle, illustrating…
We prove that the distribution function of the largest eigenvalue in the Gaussian Unitary Ensemble (GUE) in the edge scaling limit is expressible in terms of Painlev\'e II. Our goal is to concentrate on this important example of the…
The paper deals with the distribution of singular values of the input-output Jacobian of deep untrained neural networks in the limit of their infinite width. The Jacobian is the product of random matrices where the independent rectangular…
In this paper, we obtain the central limit theorem of Hecke eigenvalues in very general setting of split simple algebraic groups over $\mathbb{Q}$, using irreducible characters of compact Lie groups.
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
In this article, we study the smallest gaps of the log-gas $\beta$-ensemble on the unit circle (C$\beta$E), where $\beta$ is any positive integer. The main result is that the smallest gaps, after being normalized by $n^{\frac…
We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the…
Under suitable hypotheses, a symplectic map can be quantized as a sequence of unitary operators acting on the $N$th powers of a positive line bundle over a K\"{a}hler manifold. We show that if the symplectic map has polynomial decay of…
We prove a local law for the adjacency matrix of the Erd\H{o}s-R\'enyi graph $G(N, p)$ in the supercritical regime $ pN \geq C\log N$ where $G(N,p)$ has with high probability no isolated vertices. In the same regime, we also prove the…
Sufficient conditions are developed, under which the compound Poisson distribution has maximal entropy within a natural class of probability measures on the nonnegative integers. Recently, one of the authors [O. Johnson, {\em Stoch. Proc.…
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…
In this expository note, we give a modern proof of Hanson-Wright inequality for quadratic forms in sub-gaussian random variables. We deduce a useful concentration inequality for sub-gaussian random vectors. Two examples are given to…
We consider quadratic forms of deterministic matrices $A$ evaluated at the random eigenvectors of a large $N \times N$ GOE or GUE matrix, or equivalently evaluated at the columns of a Haar-orthogonal or Haar-unitary random matrix. We prove…