University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > The size of the giant component in random hypergraphs: a short proof

## The size of the giant component in random hypergraphs: a short proofAdd to your list(s) Download to your calendar using vCal - Christoph Koch (University of Oxford)
- Tuesday 13 March 2018, 15:00-16:00
- Watson LTA.
If you have a question about this talk, please contact Allan Lo. We consider connected components in k-uniform hypergraphs for the following notion of connectedness: given integers k> 1 and 0< j < k, two j-sets (j-tuples of distinct vertices) lie in the same j-component if there is a sequence of edges from one to the other such that consecutive edges intersect in at least j vertices. We prove that certain collections of j-sets constructed during a breadth-first search process on j-components in a random k-uniform hypergraph are reasonably regularly distributed with high probability. As an application we provide a short proof of the asymptotic size of the giant j-component shortly after it appears. This is joint work with Oliver Cooley and Mihyun Kang. 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 listsChemical Engineering Research Seminar Series Nanoscale Physics Seminars Computer Science Distinguished Seminars## Other talksThe Small Mathieu Groups Evaluation of sources of intelligence using a multi-armed bandit framework Post-mortem privacy – theory, law and technology Operator Preconditioning and Some Recent Developments for Boundary Integral Equations The Griess Algebra and the Monster Rage against the dying of the light: Type Ia supernovae at 1000 days and beyond |