Preprint
Aug 2026
Algorithms, Complexity, and Entropy of the Bernard-Letac Fair-Sampling Construction
This study extends the computational and information-theoretic analysis of Bernard and Letac's method for uniform random sampling among $m$ outcomes by presenting five algorithms with formal correctness guarantees and comprehensive complexity analyses.
Claude Gravel
· 0 citations