On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs

Abstract

In this paper, we analyze the exact asymptotic behavior of the connectivity probability in a random binomial bipartite graph $G(n,m,p)$ under various regimes of the edge probability $p=p(n)$. To determine this probability, a method based on the analysis of inhomogeneous random walks is proposed.

7 pages. The full proof of the main theorem will be included in a future version. Comments are welcome