Name
Abstract | ||
|---|---|---|
The phase transition in the size of the giant component in random graphs is one of the most well-studied phenomena in random graph theory. For hypergraphs, there are many possible generalizations of the notion of a connected component. We consider the following: two j-sets (sets of j vertices) are j-connected if there is a walk of edges between them such that two consecutive edges intersect in at least j vertices. A hypergraph is j-connected if all j-sets are pairwise j-connected. In this paper, we determine the asymptotic size of the unique giant j-connected component in random k-uniform hypergraphs for any k3 and 1j <= k-1. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1002/rsa.20761 | RANDOM STRUCTURES & ALGORITHMS |
Keywords | Field | DocType |
branching process,degree,giant component,high-order connectedness,phase transition,random hypergraphs | Discrete mathematics,Combinatorics,Constraint graph,Mathematics | Journal |
Volume | Issue | ISSN |
53.0 | 2.0 | 1042-9832 |
Citations | PageRank | References |
1 | 0.39 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Cooley | 1 | 3 | 2.13 |
| Mihyun Kang | 2 | 163 | 29.18 |
| Christoph Koch | 3 | 1 | 0.72 |