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 proof

Add to your list(s) Download to your calendar using vCal

  • UserChristoph Koch (University of Oxford)
  • ClockTuesday 13 March 2018, 15:00-16:00
  • HouseWatson 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.