The order of the giant component of random hypergraphs

Abstract

We establish central and local limit theorems for the number of vertices (n th) largest component of a random d-uniform hypergraph H d (n,p) with edge probability p = c/ n-1 d-1, where c gt; (d-1)-1 is a constant. The proof relies on a new, purely probabilistic approach. © 2009 Wiley Periodicals, Inc.