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

Simons Institute for the Theory of Computing
1,275 views •

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.

Keyboard shortcuts

On. Switch them off if they collide with your assistive tools; ? still opens this sheet.

Go to

Press g then the letter.

  • gh Latest
  • gs Sources
  • gm Media
  • gv Videos
  • gp Podcasts
  • gc Calendar
  • gd Decoder
  • gz Dataviz
  • ga Datasets
  • gb Blog
  • gk Markets
  • gj Careers
  • gn Prompt Notebook

On this page

  • / Focus search, where there is one
  • t Back to top
  • ? This list
  • Esc Close