Eric Vigoda University of Chicago
We will examine rapidly mixing Markov chains for sampling independent sets and colorings of bounded-degree graphs. The talk will focus on recent progress for graphs with high-girth.