Author:
ARRATIA RICHARD,DeSALVO STEPHEN
Abstract
We propose a new method, probabilistic divide-and-conquer, for improving the success probability in rejection sampling. For the example of integer partitions, there is an ideal recursive scheme which improves the rejection cost from asymptotically order n3/4 to a constant. We show other examples for which a non-recursive, one-time application of probabilistic divide-and-conquer removes a substantial fraction of the rejection sampling cost.We also present a variation of probabilistic divide-and-conquer for generating i.i.d. samples that exploits features of the coupon collector's problem, in order to obtain a cost that is sublinear in the number of samples.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference42 articles.
1. On the remainders and convergence of the series for the partition function
2. Asymptotic Formulaae in Combinatory Analysis
3. Engel B. (2014) Log-concavity of the overpartition function. arXiv: 1412.4603
4. Various techniques used in connection with random digits;von Neumann;Journal of Research of the National Bureau of Standards, Appl. Math. Series,1951
5. A method and two algorithms on the theory of partitions
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献