Dominated rejection algorithms for generating random variates
Abstract
References
Recommendations
Generating random variates for stable sub-Gaussian processes with memory
We present a computationally efficient method to generate random variables from a univariate conditional probability density function (PDF) derived from a multivariate α-sub-Gaussian (αSG) distribution. The approach may be used to sequentially generate ...
Generating gamma variates
An algorithm to generate variates having a gamma distribution with shape parameter greater than one is presented in this paper. This algorithm is faster than Schmeiser and Lal's G4PE, which is the fastest one currently available, yet is equally simple ...
Rejection-inversion to generate variates from monotone discrete distributions
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, ...
Comments
Information & Contributors
Information
Published In
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in