Rapidly mixing random walks on matroids and related objectsidly mixing random walks on matroids and related objects
Probability Seminar
May 1, 2019, 03:00 PM - 04:00 PM | 1011 Evans Hall | Happening As Scheduled
Nima Anari, Stanford University
A central question in randomized algorithm design is what kind of distributions can we sample from efficiently? On the continuous side, uniform distributions over convex sets and more generally log-concave distributions constitute the main tractable class. We will build a parallel theory on the discrete side, that yields tractability for a large class of discrete distributions. We will use this...