Spelling suggestions: "subject:"MSC 65010, 65005, 11445"" "subject:"MSC 65010, 65005, 11545""
1 |
A Note on the Performance of the "Ahrens Algorithm"Hörmann, Wolfgang January 2001 (has links) (PDF)
This short note discusses performance bounds for "Ahrens" algorithm, that can generate random variates from continuous distributions with monotonically decreasing density. This rejection algorithms uses constant hat-functions and constant squeezes over many small intervals. The choice of these intervals is important. Ahrens has demonstrated that the equal area rule that uses strips of constant area leads to a very simple algorithm. We present bounds on the rejection constant of this algorithm depending only on the number of intervals. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing
|
2 |
A Simple Universal Generator for Continuous and Discrete Univariate T-concave DistributionsLeydold, Josef January 2000 (has links) (PDF)
We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions. The algorithms can be implemented in a few lines of high level language code. In opposition to other black-box algorithms hardly any setup step is required and thus it is superior in the changing parameter case. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing
|
3 |
A Note on Transformed Density RejectionLeydold, Josef January 1999 (has links) (PDF)
In this paper we describe a version of transformed density rejection that requires less uniform random numbers. Random variates below the squeeze are generated by inversion. For the expensive part between squeeze and density an algorithm that uses a coverering with triangles is introduced. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing
|
4 |
Short Universal Generators Via Generalized Ratio-of-Uniforms MethodLeydold, Josef January 2000 (has links) (PDF)
We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions for a particular generator. The algorithms can be implemented in a few lines of high level language code. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing
|
Page generated in 0.0694 seconds