Name
Abstract | ||
|---|---|---|
We consider simplicial complexes that are generated from the binomial random 3-uniform hypergraph by taking the downward-closure. We determine when this simplicial complex is homologically connected, meaning that its first homology group with coefficients in F2 vanishes and the zero-th homology group is isomorphic to F2. Although this is not intrinsically a monotone property, we show that it has a single sharp threshold, and indeed prove a hitting time result relating the connectedness to the disappearance of the last minimal obstruction. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.06.049 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Random hypergraphs,connectedness,simplicial complexes,phase transition,hitting time | Discrete mathematics,Combinatorics,Social connectedness,Simplicial approximation theorem,Simplicial homology,Simplicial complex,h-vector,Hitting time,Homology (mathematics),Mathematics,Abstract simplicial complex | Journal |
Volume | ISSN | Citations |
61 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oliver Cooley | 1 | 39 | 9.15 |
| P. E. Haxell | 2 | 212 | 26.40 |
| Mihyun Kang | 3 | 163 | 29.18 |
| Philipp Sprüssel | 4 | 46 | 8.52 |