Lectures by Nima Anari on Rapidly Mixing Random Walks

Contact
No contact information submitted.
Sidebar Content
No sidebar content submitted.
Summaries

Summary Sentence:

Lectures by Nima Anari on Rapidly Mixing Random Walks via Log-concave Polynomials

Full Summary:

No summary paragraph submitted.

Media
  • Nima Anari Talk Nima Anari Talk
    (image/jpeg)

A fundamental tool used in sampling, counting, and inference problems is the Markov Chain Monte Carlo method, which uses random walks to solve computational problems. The main parameter defining the efficiency of this method is how quickly the random walk mixes (converges to the stationary distribution). Prof. Anari from Stanford University gave a series of lectures on using log concave polynomials in analysis of random walks to sample and count bases of a matroid. The results have resolved multiple conjectures in combinatorics, probability theory and algorithms.

Additional Information

Groups

ARC

Categories
No categories were selected.
Related Core Research Areas
No core research areas were selected.
Newsroom Topics
No newsroom topics were selected.
Keywords
No keywords were submitted.
Status
  • Created By: Mohit Singh
  • Workflow Status: Published
  • Created On: Mar 18, 2020 - 9:53pm
  • Last Updated: Mar 19, 2020 - 7:14am