Sampling elements of a finite group: efficiency of the product replacement algorithm with... @SimonsInstitute
Sampling elements of a finite group: efficiency of the product replacement algorithm with...  @SimonsInstitute
Uploaded September 2026 | Updated November 2026, 3 days ago
Piotr Mizerka (Faculty of Mathematics and Computer Science of Adam Mickiewicz U…
https://simons.berkeley.edu/talks/piotr-mizerka-faculty-mathematics-computer-science-adam-mickiewicz-university-poznan-2026-09
Local to Global Principles

We study a refinement of the product replacement algorithm that is designed to output individual elements of a finite group $G$ in a random way. We show after how many steps, the distribution of the output is close to uniform on $G$. The proof proceeds via spectral gap estimates and uses computer assisted calculations. This is a joint work with Michał Marcinkowski.
Sampling elements of a finite group: efficiency of the product replacement algorithm with...The power of subspace designs: Applications in coding theory, pseudorandomness, and beyondLightning TalksDiffusion in RL and robotics: how expressive policies changed how we use continuous actionsField dynamics and its applicationsOutlier singular values and (de)localized singular vectors of sparse random matricesUnderstanding Language Model Hallucinations through Parametric Knowledge IntegrationParallelism in modern sparse solversUnderstanding the Structure of Reasoning in Language ModelsFunctional Stochastic LocalizationWhy Pretrained Models HallucinatePeaked quantum advantage using error correction
Simons Institute for the Theory of Computing |

Sampling elements of a finite group: efficiency of the product replacement algorithm with...

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER