Asymptotic normality of the size of the giant component in a random hypergraph

Abstract

Recently, we adapted random walk arguments based on work of Nachmias and Peres, Martin-Löf, Karp and Aldous to give a simple proof of the asymptotic normality of the size of the giant component in the random graph $G(n,p)$ above the phase transition. Here we show that the same method applies to the analogous model of random $k$-uniform hypergraphs, establishing asymptotic normality throughout the (sparse) supercritical regime. Previously, asymptotic normality was known only towards the two ends of this regime.

11 pages

References in corpus (2)

• Clique percolation in random networks
• Component sizes of the random graph outside the scaling window

Cited by in corpus (10)

• Percolation on complex networks: Theory and application
• Exploring hypergraphs with martingales
• Evolution of high-order connected components in random hypergraphs
• Counting connected hypergraphs via the probabilistic method
• The size of the giant component in random hypergraphs
• Asymptotic enumeration of sparse connected 3-uniform hypergraphs
• High-order Phase Transition in Random Hypergrpahs
• Subcritical random hypergraphs, high-order components, and hypertrees
• Moderate deviations for the size of the giant component in a random hypergraph
• On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees