Sciweavers

RSA
2010
113views more  RSA 2010»
13 years 11 months ago
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...
Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang