Name
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-$\left(\matrix{n-1 \cr d-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 |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1002/rsa.v36:2 | Random Struct. Algorithms |
Keywords | Field | DocType |
stein s method,giant component,convergence in distribution,asymptotic distribution,random graph | Discrete mathematics,Convergence of random variables,Combinatorics,Random graph,Vertex (geometry),Matrix (mathematics),Hypergraph,Constraint graph,Giant component,Probabilistic logic,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 2 | 1042-9832 |
Citations | PageRank | References |
7 | 0.73 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Behrisch | 1 | 49 | 8.77 |
| Amin Coja-Oghlan | 2 | 543 | 47.25 |
| Mihyun Kang | 3 | 163 | 29.18 |