The order of the giant component of random hypergraphs
M Behrisch, A Coja‐Oghlan… - Random Structures & …, 2010 - Wiley Online Library
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/\left(n-
1\crd-1\right), 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
component of a random d‐uniform hypergraph Hd (n, p) with edge probability p= c/\left(n-
1\crd-1\right), 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
以上显示的是最相近的搜索结果。 查看全部搜索结果