English

On the eigenvalues of Erdos-Renyi random bipartite graphs

Combinatorics 2021-03-16 v1 Probability

Abstract

We analyse the eigenvalues of Erd\"os--R\'enyi random bipartite graphs. In particular, we consider pp satisfying n1p=Ω(n1plog3(n1)),n_{1}p=\Omega(\sqrt{n_{1}p}\log^{3}(n_{1})), n2p=Ω(n2plog3(n2)),n_{2}p=\Omega(\sqrt{n_{2}p}\log^{3}(n_{2})), and let GG(n1,n2,p)G\sim G(n_{1},n_{2},p). We show that with probability tending to 11 as n1n_{1} tends to infinity: μ2(A(G))2[1+o(1)](n1p+n2p+(n1+n2)p).\mu_{2} (A(G))\leq 2[1+o(1)](\sqrt{n_{1}p}+\sqrt{n_{2}p}+\sqrt{(n_{1}+n_{2})p}).

Keywords

Cite

@article{arxiv.2103.07918,
  title  = {On the eigenvalues of Erdos-Renyi random bipartite graphs},
  author = {Calum J. Ashcroft},
  journal= {arXiv preprint arXiv:2103.07918},
  year   = {2021}
}

Comments

5 pages; comments welcome

R2 v1 2026-06-24T00:07:36.195Z