Affiliation:
1. Department of Computer Science, Baylor University, USA
Abstract
Differential search trees can be used for selection with replacement and for a form of selection without replacement. We show that they can be extended to many different types of selection, both with and without replacement. In addition, virtually every aspect of a differential search tree can be modified dynamically. We provide algorithms for making these modifications. Virtually all differential search tree algorithms are straightforward and easy to implement, especially with our preferred implementation, which is both simple and efficient. Differential search tree operations are virtually all logarithmic with the exception of building the tree and dynamically adding leaves to the tree, which are both linear.
Reference19 articles.
1. Maurer PM. Finite random variates using differential search trees. In: SummerSim ’17. Proceedings of the summer simulation multi-conference, 9–12 July 2017, Article no. 28, pp. 1–12, https://dl.acm.org/doi/abs/10.5555/3140065.3140093
2. Efficient Sampling Methods for Discrete Distributions
3. Non-Uniform Random Variate Generation
4. Maintaining discrete probability distributions optimally