TY - GEN A1 - Behrisch, Michael A1 - Coja-Oghlan, Amin A1 - Kang, Mihuyn T1 - The order of the giant component of random hypergraphs N2 - We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph. The proof relies on a new, purely probabilistic approach, and is based on Stein’s method as well as exposing the edges of H_d(n, p) in several rounds. KW - random graphs and hypergraphs KW - limit theorems KW - giant component KW - Stein’s method Y1 - 2007 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/370 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-3705 ER -