Asymptotic normality of the giant component size in a random bipartite graph

2026/07/17 by Dmitry Shabanov, Pavel Zakharov
#math.CO

paper · pdf

Abstract

This paper studies the giant component of the sparse random bipartite graph G(n, n, p), where p = c/n for a fixed constant c > 1. We prove that its size is asymptotically normal.

Related

• The size of the giant component in random hypergraphs
• A new approach to the giant component problem
• Asymptotics for the size of the largest component scaled to "log n" in inhomogeneous random graphs
• Giant Component in Random Multipartite Graphs with Given Degree Sequences
• The size of the largest component below phase transition in inhomogeneous random graphs