Optimal random bit complexity in efficient sampling of set partition-like structures
From MaRDI portal
Cites work
- A Mathematical Theory of Communication
- A note on generating random variables with log-concave densities
- A simple generator for discrete log-concave distributions
- Analytic combinatorics
- Bell numbers in Matsunaga's and Arima's Genjikō combinatorics: modern perspectives and local limit theorems
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Combinatorial models of creation-annihilation
- Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy
- Generation of a random partition of a finite set by an urn model
- scientific article; zbMATH DE number 3112944 (Why is no real title available?)
- scientific article; zbMATH DE number 3663224 (Why is no real title available?)
- scientific article; zbMATH DE number 3468861 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- Lah-Bell numbers and polynomials
- New approximations to the principal real-valued branch of the Lambert W-function
- On convergence rates in the central limit theorems for combinatorial structures
- On the complexity of calculating factorials
- Statistical mechanics of complex networks
- Sum of the series \(\sum \frac {n^m}{n!}\) for \(m=1, 2, 3\ldots\).
- Uniform random generation of decomposable structures using floating-point arithmetic
This page was built for publication: Optimal random bit complexity in efficient sampling of set partition-like structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876375)
