Journal ArticleDOI
An Efficient Method for Generating Discrete Random Variables with General Distributions
Reads0
Chats0
TLDR
The fast generation of discrete random variables with arbitrary frequency distributions is discussed, related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution.Abstract:
The fast generation of discrete random variables with arbitrary frequency distributions is discussed. The proposed method is related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution. The software implementation of the method requires at most two memory references and a comparison. The method features good accuracy and modest storage requirements. I t is particularly useful in small computers with limited memory capacity.read more
Citations
More filters
Book ChapterDOI
Random Number Generation
TL;DR: The main goal is to reproduce the statistical properties on which these methods are based, so that the Monte Carlo estimators behave as expected, whereas for gambling machines and cryptology, observing the sequence of output values for some time should provide no practical advantage for predicting the forthcoming numbers better than by just guessing at random.
Journal ArticleDOI
Semistochastic Heat-Bath Configuration Interaction Method: Selected Configuration Interaction with Semistochastic Perturbation Theory
TL;DR: The recently proposed heat-bath configuration interaction (HCI) method is extended, by introducing a semistochastic algorithm for performing multireference Epstein-Nesbet perturbation theory, in order to completely eliminate the severe memory bottleneck of the original method.
Journal ArticleDOI
Randomized Extended Kaczmarz for Solving Least Squares
TL;DR: A randomized iterative algorithm that exponentially converges in the mean square to the minimum $\ell_2$-norm least squares solution of a given linear system of equations.
Proceedings ArticleDOI
Reducing the sampling complexity of topic models
TL;DR: An algorithm which scales linearly with the number of actually instantiated topics kd in the document, for large document collections and in structured hierarchical models kd ll k, yields an order of magnitude speedup.
Proceedings ArticleDOI
Sample-based non-uniform random variate generation
TL;DR: Several issues related to the problem or generating a new sample of lid random variables with almost the same density are discussed, including sample independence, consistency, sample indistinguishability, moment matching and generator efficiency.
References
More filters
Journal ArticleDOI
An approximate method for generating asymmetric random variables
TL;DR: A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed.
Journal ArticleDOI
New fast method for generating discrete random numbers with arbitrary frequency distributions
TL;DR: A new method for generating discrete random numbers with arbitrary amplitude/frequency distributions is presented, which consists essentially of amplitude manipulation of uniformly distributed, statistically independent sequential numbers.
Journal ArticleDOI
Fast generation of uniformly distributed pseudorandom numbers with floating-point representation
TL;DR: A new method is presented for generating uniformly distributed pesudorandom numbers with a floating-point representation that features fast single-clock-pulse operation.
Journal ArticleDOI
Pseudonoise with Arbitrary Amplitude Distribution--Part I: Theory
John S. Sobolewski,W. H. Payne +1 more
TL;DR: A new sampling method, conditional bit sampling, which is suited for hardwired sampling devices because of its generality, simplicity, and accuracy, and agreement between actual and theoretical performance was excellent.