Session 6B - Efficient sampling and counting algorithms for the Potts model

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Presents efficient sampling and counting algorithms for the Potts model, a problem in statistical physics and approximate counting. Teaches Monte Carlo and deterministic approximation methods.

A 33-minute video from Association for Computing Machinery (ACM): “Session 6B - Efficient sampling and counting algorithms for the Potts model”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020