Name
Abstract | ||
|---|---|---|
Given a random 3-uniform hypergraph H=H(n,p) on n vertices where each triple independently appears with probability p, consider the following graph process. We start with the star G0 on the same vertex set, containing all the edges incident to some vertex v0, and repeatedly add an edge xy if there is a vertex z such that xz and yz are already in the graph and xyz∈H. We say that the process propagates if all the edges are added to the graph eventually. In this paper we prove that the threshold probability for propagation is p=12n. We also show that p=12n is an upper bound for the threshold probability that a random 2-dimensional simplicial complex is simply-connected. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.endm.2015.06.028 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
triadic process,random simplicial complexes,differential equation method | Discrete mathematics,Complete graph,Graph,Combinatorics,Monad (category theory),Simply connected space,Vertex (geometry),Upper and lower bounds,Hypergraph,Simplicial complex,Mathematics | Journal |
Volume | Issue | ISSN |
49 | 1 | 1571-0653 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Korándi | 1 | 2 | 3.45 |
| Yuval Peled | 2 | 8 | 3.22 |
| Benny Sudakov | 3 | 7 | 2.25 |