University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Counting hypergraph colorings in the local lemma regime

Counting hypergraph colorings in the local lemma regime

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

  • UserHeng Guo (University of Edinburgh)
  • ClockThursday 31 January 2019, 13:00-14:00
  • HouseWatson LTB.

If you have a question about this talk, please contact Richard Montgomery.

I will present a fully polynomial-time approximation scheme (FPTAS) to count the number of q-colorings for k-uniform hypergraphs with maximum degree D if k>=28 and q>315D^{14/(k−14)}, as well as an accompanying sampling algorithm with slightly worse conditions. These are the first approximate counting and sampling algorithms in the regime q\ll Δ (for large Δ and k) without any additional assumptions. In these regimes, frozen colourings are present, forming an obstacle to the standard Markov chain Monte Carlo approach. Instead, our method is based on the recent work of Moitra (STOC, 2017), in which Lovasz Local Lemma is the key ingredient.

Joint work with Chao Liao, Pinyan Lu, Chihao Zhang

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.