We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such graphs. We illustrate our results on the uniform regular graphs, Erdos-Renyi graphs and preferential attachment graphs. We sketch examples of application for weighted graphs, bipartite graphs and the uniform spanning tree of n vertices.
We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix entries. Our results generalize the previous results of [5,16,17] which constituted a key step in the proof of the local semicircle law with optimal error bound in mean-field random matrix models. Our bounds apply to random band matrices, and improve previous estimates from order 2 to order 4 in the cases relevant for applications. In particular, they lead t…
This is the second part of a three part series abut delocalization for band matrices. In this paper, we consider a general class of $N\times N$ random band matrices $H=(H_{ij})$ whose entries are centered random variables, independent up to a symmetry constraint. We assume that the variances $\mathbb E |H_{ij}|^2$ form a band matrix with typical band width $1\ll W\ll N$. We consider the generalized resolvent of $H$ defined as $G(Z):=(H - Z)^{-1}$, where $Z$ is a deterministic diagonal matrix such that $Z_{ij}=\left(z 1_{1\leq i \leq W}+\widetilde z 1_{ i > W} \right) δ_{ij}$, with two distinct…
Random tensors can be used to produce random matrices. This idea is, for instance, very natural when one studies random quantum states with the aim of exploring properties that are generically true, or true with some probability. We hereby study the moments generating function, in the sense of the Stieltjes transform - i.e. the resolvent -, of a random matrix defined as a product of two different marginals of the same random tensor. We study the resolvent in two different asymptotical regimes. In the first regime, the resolvent is easily computed thanks to freeness results for the two differen…
We obtain the recursive identities for the joint moments of the traces of the powers of the resolvent for Gaussian ensembles of random matrices at the soft and hard edges of the spectrum. We also discuss the possible ways to extend these results to the non-Gaussian case.
We study the spectral properties of the dilute Wigner random real symmetric n-dimensional matrices H such that the entries H(i,j) take zero value with probability 1-p/n. We prove that under rather general conditions on the probability distribution of H(i,j) the semicircle law is valid for the dilute Wigner ensemble in the limit of infinite n and p. In the second part of the paper we study the leading term of the correlation function of the resolvent G(z) of H with large enough Im z in the limit of infinite n and p such that 3/5 log n <log p < log n. We show that this leading term, when conside…
We consider real symmetric or complex hermitian random matrices with correlated entries. We prove local laws for the resolvent and universality of the local eigenvalue statistics in the bulk of the spectrum. The correlations have fast decay but are otherwise of general form. The key novelty is the detailed stability analysis of the corresponding matrix valued Dyson equation whose solution is the deterministic limit of the resolvent.
Consider a matrix $Σ_n$ with random independent entries, each non-centered with a separable variance profile. In this article, we study the limiting behavior of the random bilinear form $u_n^* Q_n(z) v_n$, where $u_n$ and $v_n$ are deterministic vectors, and Q_n(z) is the resolvent associated to $Σ_n Σ_n^*$ as the dimensions of matrix $Σ_n$ go to infinity at the same pace. Such quantities arise in the study of functionals of $Σ_n Σ_n^*$ which do not only depend on the eigenvalues of $Σ_n Σ_n^*$, and are pivotal in the study of problems related to non-centered Gram matrices such as central limi…
The spectral and localization properties of heterogeneous random graphs are determined by the resolvent distributional equations, which have so far resisted an analytic treatment. We solve analytically the resolvent equations of random graphs with an arbitrary degree distribution in the high-connectivity limit, from which we perform a thorough analysis of the impact of degree fluctuations on the spectral density, the inverse participation ratio, and the distribution of the local density of states. We show that all eigenvectors are extended and that the spectral density exhibits a logarithmic o…
In this paper, we study the product of two complex Ginibre matrices and the loop equations satisfied by their resolvents (i.e. the Stieltjes transform of the correlation functions). We obtain using Schwinger-Dyson equation (SDE) techniques the general loop equations satisfied by the resolvents. In order to deal with the product structure of the random matrix of interest, we consider SDEs involving the integral of higher derivatives. One of the advantage of this technique is that it bypasses the reformulation of the problem in terms of singular values. As a byproduct of this study we obtain the…
Considering random matrix $X \in \mathcal M_{p,n}$ with independent columns satisfying the convex concentration properties issued from a famous theorem of Talagrand, we express the linear concentration of the resolvent $Q = (I_p - \frac{1}{n}XX^T) ^{-1}$ around a classical deterministic equivalent with a good observable diameter for the nuclear norm. The general proof relies on a decomposition of the resolvent as a series of powers of $X$.
This paper is about the relation of random matrix theory and the subordination phenomenon in complex analysis. We find that the resolvent of the sum of two random matrices is approximately subordinated to the resolvents of the original matrices. We estimate the error terms in this relation and in the subordination relation for the traces of the resolvents. This allows us to prove a local limit law for eigenvalues and a delocalization result for eigenvectors of the sum of two random matrices. In addition, we use subordination to determine the limit of the largest eigenvalue for the rank-one def…
In this work, we investigate the asymptotic spectral density of the random feature matrix $M = Y Y^\ast$ with $Y = f(WX)$ generated by a single-hidden-layer neural network, where $W$ and $X$ are random rectangular matrices with i.i.d. centred entries and $f$ is a non-linear smooth function which is applied entry-wise. We prove that the Stieltjes transform of the limiting spectral distribution approximately satisfies a quartic self-consistent equation, which is exactly the equation obtained by [Pennington, Worah] and [Benigni, Péché] with the moment method. We extend the previous results to the…
We study the spectral properties of matrices of long-range percolation model. These are N\times N random real symmetric matrices H=\{H(i,j)\}_{i,j} whose elements are independent random variables taking zero value with probability 1-ψ((i-j)/b), b\in \mathbb{R}^{+}, where $ψ$ is an even positive function with ψ(t)\le{1} and vanishing at infinity. We study the resolvent G(z)=(H-z)^{-1}, Imz\neq{0} in the limit N,b\to\infty, b=O(N^α), 1/3<α<1 and obtain the explicit expression T(z_{1},z_{2}) for the leading term of the correlation function of the normalized trace of resolvent g_{N,b}(z)=N^{-1}Tr …
We consider two classical ensembles of the random matrix theory: the Wigner matrices and sample covariance matrices, and prove Central Limit Theorem for linear eigenvalue statistics under rather weak (comparing with results known before) conditions on the number of derivatives of the test functions and also on the number of the entries moments. Moreover, we develop a universal method which allows one to obtain automatically the bounds for the variance of differentiable test functions, if there is a bound for the variance of the trace of the resolvent of random matrix. The method is applicable …
We describe the resolvent approach for the rigorous study of the mescoscopic regime of Hermitian matrix spectra. We present results reflecting the universal behavior of the smoothed density of eigenvalue distribution of large random matrices
The soft and hard edge scaling limits of $β$-ensembles can be characterized as the spectra of certain random Sturm-Liouville operators. It has been shown that by tuning the parameter of the hard edge process one can obtain the soft edge process as a scaling limit. We prove that this limit can be realized on the level of the corresponding random operators. More precisely, the random operators can be coupled in a way so that the scaled versions of the hard edge operators converge to the soft edge operator a.s. in the norm resolvent sense.
We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further characterization via equality of the Royden boundary and the harmonic boundary and show that the Dirichlet problem has a unique solution for such graphs. The Markov semigroups and resolvents (with Dirichlet boundary conditions) on these graphs are shown to be ultracontractive. Moreover, if the underlying measure is finite, the semigroups and resolvents are trace class …
We provide a rather explicit formula for the resolvent of a~concatenation of $N$ processes in terms of their exit laws and certain probability measures characterizing the way the processes are concatenated. As an application, we prove an averaging principle saying that by concatenating asymptotically splittable processes one can approximate Markov chains.
We consider random matrices of the form $H_N=A_N+U_N B_N U^*_N$, where $A_N$, $B_N$ are two $N$ by $N$ deterministic Hermitian matrices and $U_N$ is a Haar distributed random unitary matrix. We establish a universal Central Limit Theorem for the linear eigenvalue statistics of $H_N$ on all mesoscopic scales inside the regular bulk of the spectrum. The proof is based on studying the characteristic function of the linear eigenvalue statistics, and consists of two main steps: (1) generating Ward identities using the left-translation-invariance of the Haar measure, along with a local law for the r…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense. Then we prove that a subspace of the effective domain of the quadratic form is naturally isomorphic to a core of a regular Dirichlet form on a locally compact separable metric space. We also show that any Dirichlet form on a countably generated measure space can be approximated by essentially discrete Dirichlet forms, i.e. energy forms on finite weighted gra…
On a countable tree $T$, allowing vertices with infinite degree, we consider an arbitrary stochastic irreducible nearest neighbour transition operator $P$. We provide a boundary integral representation for general eigenfunctions of $P$ with eigenvalue $λ\in \mathbb{C}$. This is possible whenever $λ$ is in the resolvent set of $P$ as a self-adjoint operator on a suitable $\ell^2$-space and the on-diagonal elements of the resolvent ("Green function") do not vanish at $λ$. We show that when $P$ is invariant under a transitive (not necessarily fixed-point-free) group action, the latter condition h…
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 contributions coming from loops of all possible lengths, from which we obtain the isolated eigenvalue as well as an analytical expression for the $O(1/N)$ correction to the continuous part of the spectrum. The comparison between this analytical formula and direct diagonalization results exhibits an excellent agreement, confirming the correctness of our expressi…
We confirm the long-standing prediction that $c=e\approx 2.718$ is the threshold for the emergence of a non-vanishing absolutely continuous part (extended states) at zero in the limiting spectrum of the Erdős-Renyi random graph with average degree $c$. This is achieved by a detailed second-order analysis of the resolvent $(A-z)^{-1}$ near the singular point $z=0$, where $A$ is the adjacency operator of the Poisson-Galton-Watson tree with mean offspring $c$. More generally, our method applies to arbitrary unimodular Galton-Watson trees, yielding explicit criteria for the presence or absence of …
