The MCMC method and High Dimensional Expanders 

I will give a survey on recent connections developed between the rapidly growing area of high dimensional expanders and analysis of mixing time of Markov chains. We will then see application to several classical counting and sampling problems such as sampling spanning trees, independent sets, and proper edge coloring of graphs. I will conclude the talk by explaining several avenues of future research.