The order of the giant component of random hypergraphs |
| |
| Authors: | Michael Behrisch Amin Coja‐Oghlan Mihyun Kang |
| |
| Affiliation: | 1. Humboldt‐Universit?t zu Berlin, Institut für Informatik, 10099 Berlin, Germany;2. University of Edinburgh, School of Informatics, Edinburgh EH8 9AB, UK;3. Technische Universit?t Berlin, Institut für Mathematik, 10623 Berlin, Germany |
| |
| Abstract: | 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/ , where c > (d ‐ 1)‐1 is a constant. The proof relies on a new, purely probabilistic approach. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010 |
| |
| Keywords: | random graphs and hypergraphs limit theorems giant component |
|
|
