A rejection technique for sampling from T-concave distributions
ACM Transactions on Mathematical Software (TOMS)
The patchwork rejection technique for sampling from unimodal distributions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A simple universal generator for continuous and discrete univariate T-concave distributions
ACM Transactions on Mathematical Software (TOMS)
Multicasting vs. unicasting in mobile communication systems
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
Short universal generators via generalized ratio-of-uniforms method
Mathematics of Computation
Quantitative performance comparison of different content distribution modes
Performance Evaluation
Inverse transformed density rejection for unbounded monotone densities
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Dynamic searchable symmetric encryption
Proceedings of the 2012 ACM conference on Computer and communications security
| Hi-index | 0.00 |
For discrete distributions a variant of reject from a continuous hat function is presented. The main advantage of the new method, called rejection-inversion, is that no extra uniform random number to decide between acceptance and rejection is required, which means that the expected number of uniform variates required is halved. Using rejection-inversion and a squeeze, a simple universal method for a large class of monotone discrete distributions is developed. It can be used to generate variates from the tails of most standard discrete distributions. Rejection-inversion applied to the Zipf (or zeta) distribution results in algorithms that are short and simple and at least twice as fast as the fastest methods suggested in the literature.