University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Edge correlations in random regular hypergraphs

Edge correlations in random regular hypergraphs

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

  • UserAlberto Espuny (University of Birmingham)
  • ClockWednesday 02 May 2018, 15:00-16:00
  • HouseWatson LTA.

If you have a question about this talk, please contact Allan Lo.

The study of random regular $r$-graphs is made more challenging than the study of other classical models by the correlations existing between different edges of the $r$-graph. In this talk we show how an edge switching technique can be used to prove that, under mild conditions, these correlations are in fact very small and do not affect the distribution too much. We use this to derive some counting results in random regular $r$-graphs, including small subgraph counts and some spanning subgraph counts. In particular, we prove a conjecture about the threshold for the appearance of Hamilton cycles. We also show an application for testing subgraph freeness.

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 talks.cam from the University of Cambridge.