Sparse Graphs Coalition

User Tools

Site Tools

Trace:
sessions:2021sessions:2021session2

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
sessions:2021sessions:2021session2 [2021/03/09 08:16] – [Schedule (tentative, all time European)] ross.kangsessions:2021sessions:2021session2 [2023/09/22 15:12] (current) – [Organisers] ross.kang
Line 2: Line 2:
  
 Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques. Lovász local lemma, entropy compression, stochastic local search algorithms, cluster expansion, hard-core model, exponentially many hypergraph colourings, and related topics/techniques.
 +
 +==== Organisers ====
 +
 +[[https://staff.fnwi.uva.nl/j.r.kang/|Ross Kang]] and [[https://lbgi.fr/~sereni/|Jean-Sébastien Sereni]]
 +
  
 ==== Workshop dates ==== ==== Workshop dates ====
Line 8: Line 13:
  
 ==== Confirmed participants ==== ==== Confirmed participants ====
 +
 +{{ 2021_2_progress_report.png?nolink&500|}}
  
 (updated 8 March, registration closed) (updated 8 March, registration closed)
Line 52: Line 59:
 Deadline: 5 March (closed). Deadline: 5 March (closed).
  
-==== Schedule (tentative, all time European) ====+==== Schedule (all times European) ====
  
   1. Monday, 8 March   1. Monday, 8 March
Line 72: Line 79:
     b. Closing drinks     b. Closing drinks
   6. Sunday 14 March   6. Sunday 14 March
-    a. Eat pie+    a. Eat pie in wonder (20:00)
          
 For the open working sessions, we plan/suggest (based on the suggestion of Fiona Skerman) group contact moments once in the morning, once in the early afternoon, and optionally if needed once in the evening to coordinate across the Atlantic. For the open working sessions, we plan/suggest (based on the suggestion of Fiona Skerman) group contact moments once in the morning, once in the early afternoon, and optionally if needed once in the evening to coordinate across the Atlantic.
Line 94: Line 101:
 ===Ewan Davies: The cluster expansion, Lovász local lemma and algorithms=== ===Ewan Davies: The cluster expansion, Lovász local lemma and algorithms===
 The local lemma and its variants are such convenient statements that it is tempting to use them as a black box. We will shine a light into this box and survey deep connections between the cluster expansion from statistical physics, the local lemma, algorithms for finding objects guaranteed by the local lemma, and see how entropy compression emerges. The main goal of this talk is to act as a navigation aid for the extensive and diverse literature on these topics. The local lemma and its variants are such convenient statements that it is tempting to use them as a black box. We will shine a light into this box and survey deep connections between the cluster expansion from statistical physics, the local lemma, algorithms for finding objects guaranteed by the local lemma, and see how entropy compression emerges. The main goal of this talk is to act as a navigation aid for the extensive and diverse literature on these topics.
 +
 +==== Research results ====
 +
 +  * Groenland, Kaiser, Treffers, Wales. Graphs of low average degree without independent transversals. https://arxiv.org/abs/2106.15175
 +  * Davies, Illingworth. The χ-Ramsey problem for triangle-free graphs. https://arxiv.org/abs/2107.12288
 +  * Hurley, Pirot. A first moment proof of the Johansson-Molloy theorem. https://arxiv.org/abs/2109.15215
 +  * Hurley, Pirot. Uniformly Random Colourings of Sparse Graphs. https://arxiv.org/abs/2303.15367
  
  
sessions/2021sessions/2021session2.1615277782.txt.gz · Last modified: 2021/03/09 08:16 by ross.kang