Component behaviour and excess of random bipartite graphs near the critical point (2105.14883v3)
Abstract: The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar phase transition as that of the binomial random graph $G(n,p)$ as $p$ passes the critical point of $\frac{1}{n}$. We study the component structure of this model near to the critical point. We show that, as with $G(n,p)$, for an appropriate range of $p$ there is a unique `giant' component and we determine asymptotically its order and excess. We also give more precise results for the distribution of the number of components of a fixed order in this range of $p$. These results rely on new bounds for the number of bipartite graphs with a fixed number of vertices and edges, which we also derive.
- Handbook of mathematical functions with formulas, graphs, and mathematical tables. Dover Publications, Inc., New York, 1992. Reprint of the 1972 edition.
- N. Alon and J. H. Spencer. The probabilistic method. Wiley Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., Hoboken, NJ, fourth edition, 2016.
- B. Bollobás. The evolution of random graphs. Trans. Amer. Math. Soc., 286(1):257–274, 1984.
- B. Bollobás. The evolution of sparse graphs. In Graph theory and combinatorics (Cambridge, 1983), pages 35–57. Academic Press, London, 1984.
- B. Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2001.
- The phase transition in inhomogeneous random graphs. Random Structures Algorithms, 31(1):3–122, 2007.
- The evolution of random subgraphs of the cube. Random Structures Algorithms, 3(1):55–90, 1992.
- Planarity and genus of sparse random bipartite graphs. SIAM J. Discrete Math., 36(2):1394–1415, 2022.
- The genus of the Erdős-Rényi random graph and the fragile genus property. Random Structures Algorithms, 56(1):97–121, 2020.
- P. Erdős and A. Rényi. On random graphs. I. Publ. Math. Debrecen, 6:290–297, 1959.
- T. E. Harris. A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc., 56:13–20, 1960.
- Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000.
- Y. Jing and B. Mohar. The genus of a random bipartite graph. Canad. J. Math., 72(6):1607–1623, 2020.
- T. Johansson. The giant component of the random bipartite graph. 2012. Master’s Thesis.
- The phase transition in multitype binomial random graphs. SIAM J. Discrete Math., 29(2):1042–1064, 2015.
- T. Łuczak. Component behavior near the critical point of the random graph process. Random Structures Algorithms, 1(3):287–310, 1990.
- T. Łuczak. Cycles in a random graph near the critical point. Random Structures Algorithms, 2(4):421–439, 1991.
- J. W. Moon. Enumerating labelled trees. In Graph Theory and Theoretical Physics, pages 261–272. Academic Press, London, 1967.
- H. I. Scoins. The number of trees with nodes of alternate parity. Proc. Cambridge Philos. Soc., 58:12–16, 1962.
- J. Spencer. Asymptopia, volume 71 of Student Mathematical Library. American Mathematical Society, Providence, RI, 2014. With Laura Florescu.