Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid

11/05/2018

∙

by   Nima Anari, et al.

∙

0

∙

share

We use recent developments in the area of high dimensional expanders and corresponding high dimensional walks to design an FPRAS to count the number of bases of any matroid given by an independent set oracle, and to estimate the partition function of the random cluster model of any matroid in the regime where 0<q<1. Consequently, we can sample random spanning forests in a graph and (approximately) compute the reliability polynomial of any matroid. We also prove the thirty year old conjecture of Mihail and Vazirani that the bases exchange graph of any matroid has expansion at least 1.