The paper presents and compares five different algorithms for generating Bernoulli processes, i.e. sequences of 0's and l's where each digit is a result of an independent experiment with \(P(1)=1-P(0)=p\). The five approaches differ in generators of random numbers employed. They are based on the uniform, geometric, binomial, exponential and Poisson generators. It appears from computational comparisons that the nontraditional methods are more efficient for small p.
Recommendations
- A Random-Bit Generator for use in Simulating the Reliability of a Coherent System
- scientific article; zbMATH DE number 1512196
- Optimal linear Bernoulli factories for small mean problems
- scientific article; zbMATH DE number 4086850
- Efficient conversion of random sequences into equiprobable and independent sequences
Cites work
Cited in
(4)
This page was built for publication: Generation of Bernoulli processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799289)