# On the Generalized Ratio of Uniforms as a Combination of Transformed Rejection and Extended Inverse of Density Sampling

@article{Martino2012OnTG, title={On the Generalized Ratio of Uniforms as a Combination of Transformed Rejection and Extended Inverse of Density Sampling}, author={Luca Martino and D. Luengo and Joaqu'in M'iguez}, journal={arXiv: Computation}, year={2012} }

In this work we investigate the relationship among three classical sampling techniques: the inverse of density (Khintchine's theorem), the transformed rejection (TR) and the generalized ratio of uniforms (GRoU). Given a monotonic probability density function (PDF), we show that the transformed area obtained using the generalized ratio of uniforms method can be found equivalently by applying the transformed rejection sampling approach to the inverse function of the target density. Then we… Expand

#### Figures and Tables from this paper

#### References

SHOWING 1-10 OF 62 REFERENCES

The transformed rejection method for generating random variables, an alternative to the ratio of uniforms method

- Mathematics
- 1994

Theoretical considerations and empirical results show that the one-dimensional quality of non-uniform random numbers is bad and the discrepancy is high when they are generated by the ratio of… Expand

A generalization of the adaptive rejection sampling algorithm

- Mathematics, Computer Science
- Stat. Comput.
- 2011

This paper introduces a generalized adaptive rejection sampling procedure that can be applied with a broad class of target probability distributions, possibly non-log-concave and exhibiting multiple modes, and yields a sequence of proposal densities that converge toward the target pdf, thus achieving very high acceptance rates. Expand

Ratios of Normal Variables and Ratios of Sums of Uniform Variables

- Mathematics
- 1965

Abstract The principal part of this paper is devoted to the study of the distribution and density functions of the ratio of two normal random variables. It gives several representations of the… Expand

Transformations and random variate generation:generalised ratio-of-uniforms methods

- Mathematics
- 1996

The basic ingredient of random variate generation is, of course, the uniform random number and, in particular, the ability to generate points uniformly over some twodimensional region. One can, for… Expand

Efficient generation of random vectors by using the ratio-of-uniforms method with ellipsoidal envelopes

- Mathematics, Computer Science
- Stat. Comput.
- 2008

A new algorithm to generate random vectors from multivariate distributions from densities known up to a multiplicative constant, for example, from those arising in Bayesian computation is proposed and its efficiency is shown for some classes of distributions. Expand

Two adaptive rejection sampling schemes for probability density functions log-convex tails

- Mathematics
- 2011

Monte Carlo methods are often necessary for the implementation of optimal Bayesian estimators. A fundamental technique that can be used to generate samples from virtually any target probability… Expand

Automatic sampling with the ratio-of-uniforms method

- Mathematics, Computer Science
- TOMS
- 2000

It is shown, that the ratio-of-uniforms method is also useful for the design of a black-box algorithm suitable for a large class of distributions, including all with log-concave densities. Expand

The transformed rejection method for generating Poisson random variables

- Mathematics
- 1993

The transformed rejection method, a combination of the inversion and the rejection method, which is used to generate non-uniform random numbers from a variety of continuous distributions can be… Expand

On Khintchine's Theorem and its Place in Random Variate Generation

- Mathematics
- 2002

It is well known that if X and Y are uniformly distributed over the region between the horizontal axis and a density function f, then X is distributed according to density f. The algorithm “generate… Expand

The patchwork rejection technique for sampling from unimodal distributions

- Mathematics, Computer Science
- TOMC
- 1999

Experiments show that patchwork rejection algorithms are in general faster than their competitors at the cost of higher set-up times. Expand