University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Homological connectivity of random hypergraphs

## Homological connectivity of random hypergraphsAdd to your list(s) Download to your calendar using vCal - Mihyun Kang (Graz)
- Thursday 19 January 2017, 15:00-16:00
- LTC Watson.
If you have a question about this talk, please contact Dr Andrew Treglown. We consider 2-dimensional 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 zero-th and first homology groups with coefficients in $\mathbb{F}_2$ vanish. Although this is not intrinsically a monotone property, we show that it nevertheless has a single sharp threshold, and indeed prove a hitting time result relating the connectedness to the disappearance of the last minimal obstruction. This talk is part of the Combinatorics and Probability seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsMetamaterials and Nanophotonics Group Seminars Cold atoms Met and Mat Seminar Series## Other talksTBC Control variates for computing transport coefficients Horizontal Mean Curvature Flow and stochastic optimal controls Life : itâ€™s out there, but what and why ? TBA Quantum Sensing in Space |