DeepAI AI Chat
Log In Sign Up

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

by   Nima Anari, et al.
NC State University
University of Washington
Stanford University

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.


page 1

page 2

page 3

page 4


Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees

We prove tight mixing time bounds for natural random walks on bases of m...

Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids

We give a deterministic polynomial time 2^O(r)-approximation algorithm f...

On Optimization and Counting of Non-Broken Bases of Matroids

Given a matroid M=(E, I), and a total ordering over the elements E, a br...

High-Dimensional Expanders from Expanders

We present an elementary way to transform an expander graph into a simpl...

Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases

We define a notion of isotropy for discrete set distributions. If μ is a...

Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model

We say a probability distribution μ is spectrally independent if an asso...

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games

Higher order random walks (HD-walks) on high dimensional expanders have ...