On the eigenvalues of Erdos-Renyi random bipartite graphs
Abstract
We analyse the eigenvalues of Erd\"os--R\'enyi random bipartite graphs. In particular, we consider p satisfying n1p=(n1p3(n1)), n2p=(n2p3(n2)), and let G G(n1,n2,p). We show that with probability tending to 1 as n1 tends to infinity: μ2 (A(G))≤ 2[1+o(1)](n1p+n2p+(n1+n2)p).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.