Tutte Colloquium - Jonathan Leake-Log-concavity, Sampling, and Lorentzian Polynomials
| Speaker: | Jonathan Leake |
| Affiliation: | University of Waterloo |
| Location: | MC 5501 |
Abstract: In this talk, we demonstrate a connection between log-concavity statements and sampling algorithms via high-dimensional expanders and Lorentzian polynomials. To do this, we first discuss two conjectures which were resolved about 5-10 years ago: one on the log-concavity of independent sets of matroids (due to Brändén-Huh and Anari-Liu-Oveis Gharan-Vinzant), and one on efficiently sampling bases of matroids (due to Anari-Liu-Oveis Gharan-Vinzant). From there we will present some new results on generalized graph colorings which extend these and other previous results. In particular, we will discuss how this can be used to obtain log-concavity statements and sampling algorithms for linear extensions of posets. Joint work with Kasper Lindberg and Shayan Oveis Gharan.