Related papers: Bulk eigenvalue statistics for random regular grap…

Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…

We give a delocalization estimate for eigenfunctions of the discrete Laplacian on large $d+1$-regular graphs, showing that any subset of the graph supporting $\epsilon$ of the $L^2$ mass of an eigenfunction must be large. For graphs…

This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d…

We prove that for Gaussian random normal matrices the correlation function has universal behavior. Using the technique of orthogonal polynomials and identities similar to the Christoffel-Darboux formula, we find that in the limit, as the…

We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides…

We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…

We develop a thorough analytical study of the $O(1/N)$ correction to the spectrum of regular random graphs with $N \rightarrow \infty$ nodes. The finite size fluctuations of the resolvent are given in terms of a weighted series over the…

We extend a recent theory of parametric correlations in the spectrum of random matrices to study the response to an external perturbation of eigenvalues near the soft edge of the support. We demonstrate by explicit non-perturbative…

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…

The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…

We study the adjacency matrices of random $d$-regular graphs with large but fixed degree $d$. In the bulk of the spectrum $[-2\sqrt{d-1}+\varepsilon, 2\sqrt{d-1}-\varepsilon]$ down to the optimal spectral scale, we prove that the Green's…

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 consider $N\times N$ symmetric or hermitian random matrices with independent, identically distributed entries where the probability distribution for each matrix element is given by a measure $\nu$ with a subexponential decay. We prove…

Basing on our recent results on the $1/n$-expansion in unitary invariant random matrix ensembles, known as matrix models, we prove that the local eigenvalue statistic, arising in a certain neighborhood of the edges of the support of the…

We compute exact asymptotic of the statistical density of random matrices belonging to the Generalized Gaussian orthogonal, unitary and symplectic ensembles such that there no eigenvalues in the interval $[\sigma, +\infty[$. In particular,…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

We consider the ensemble of random Gaussian Laplace eigenfunctions on $\mathbb{T}^3=\mathbb{R}^3/\mathbb{Z}^3$ (`$3d$ arithmetic random waves'), and study the distribution of their nodal surface area. The expected area is proportional to…

In this paper we construct a class of random matrix ensembles labelled by a real parameter $\alpha \in (0,1)$, whose eigenvalue density near zero behaves like $|x|^\alpha$. The eigenvalue spacing near zero scales like $1/N^{1/(1+\alpha)}$…

Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…