Home /  PSDS Seminar: Extreme singular values of sparse random bipartite graph

Seminar

PSDS Seminar: Extreme singular values of sparse random bipartite graph April 17, 2025 (11:00 AM PDT - 12:00 PM PDT)
Parent Program:
Location: SLMath: Eisenbud Auditorium, Online/Virtual
Speaker(s) Zhichao Wang (University of California, Berkeley)
Description No Description
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video
No Video Uploaded
Abstract/Media

Zoom Link

Consider the random bipartite Erdos-Renyi graph $\gG(n, m, p)$, where each edge with one vertex in $V_{1}=[n]$ and the other vertex in $V_{2}=[m]$ is connected with probability $p$ with $n \geq m$. For the centered and normalized adjacency matrix $A$, it is well known that the empirical spectral measure of $A$ will converge to the Marchenko-Pastur (MP) distribution. Dumitriu and Zhu proved that almost surely there are no outliers outside the compact support of the MP law when $np = \omega(\log(n))$. In this talk, we consider the critical sparsity regime with $np =O(\log(n))$, where we denote $p = b\log(n)/\sqrt{mn}$, $\kappa = n/m$ for some positive constants $b$ and $\kappa$. We quantitatively characterize the emergence of outlier singular values. When $b > b_{\star}$, there is no outlier outside the bulk; when $b^{\star}< b < b_{\star}$, outlier singular values only appear outside the right edge of the MP law; when $b < b^{\star}$, outliers appear on both sides. Meanwhile, the locations of those outliers are precisely characterized by some function depending on the largest and smallest degrees of the sampled random graph. The thresholds $b^{\star}$ and $b_{\star}$ purely depend on $\kappa$. This is a joint work with Ioana Dumitriu, Haixiao Wang, and Yizhe Zhu.

No Notes/Supplements Uploaded No Video Files Uploaded