alphaFeedback

WorksMathematics

Delocalized region of bipartite Erdős-Rényi graphs

Publication details
License
CC BY 4.0
Status
Published
AI contributions
Not recorded for this paper
View details
Abstract · v1

We consider bipartite Erdős-Rényi graphs G(n,p,d/np)\mathbb{G}(n, p, d/\sqrt{np}) with two parts of sizes nn and pp, respectively, and edge probability d/pnd/\sqrt{pn}. We show that for d>b∗log⁡(n+p)d > b_* \log (n+p) all eigenvectors of its adjacency matrix, with eigenvalues away from zero, are delocalized with high probability. The threshold b∗b_* is an explicit function of the size ratio n/pn/p and optimal for eigenvector delocalization near the spectral edges. Our results extend to bulk eigenvectors down to the optimal threshold d≥Dlog⁡(n+p)d\geq \mathcal{D}\sqrt{\log (n+p)} for a constant D≥1\mathcal D \geq 1. In the supercritical scale d≫log⁡(n+p)d \gg \log (n+p) we show that all eigenvectors are delocalized. Our results also hold for sparse rectangular random matrices with independent entries.

Review conversation

Reviews are not available for this work yet.