The order of the giant component of random hypergraphs

We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1 , where c > 1/(d − 1) is a constant. The proof relies on a new, purely probabilistic approach.

• Type: Journal
• Year: 2010
• Where: RSA
• Authors: Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang
• Keywords: Edge Probability, Local Limit, Random D-uniform Hypergraph, RSA 2010