# A note on a universal random variate generator for integer-valued random variables

@article{Barabesi2014ANO,
title={A note on a universal random variate generator for integer-valued random variables},
author={Lucio Barabesi and Luca Pratelli},
journal={Statistics and Computing},
year={2014},
volume={24},
pages={589-596}
}
• Published 5 November 2012
• Mathematics
• Statistics and Computing
A universal generator for integer-valued square-integrable random variables is introduced. The generator relies on a rejection technique based on a generalization of the inversion formula for integer-valued random variables. This approach allows to create a dominating probability function, whose evaluation solely involves two integrals depending on the characteristic function of the random variable to be generated. The proposal gives rise to a simple algorithm which may be implemented in a few…
Universal methods for generating random variables with a given characteristic function
• Mathematics, Computer Science
• 2015
Universal generators for absolutely-continuous and integer-valued random variables are introduced, based on a generalization of the rejection technique proposed by Devroye, which gives rise to simple algorithms which may be implemented in a few code lines and may show noticeable performance even if some classical families of distributions are considered.
Algorithms for generating random variables with a rational probability-generating function
Two algorithms for generating random variables with a rational probability-generating function are presented. One of them implements the recently developed general range reduction method, and the
The Tempered Discrete Linnik distribution
• Mathematics
Stat. Methods Appl.
• 2018
A new family of integer-valued distributions is introduced by considering a tempered version of the Discrete Linnik law, which is actually a generalization of the well-known Poisson–Tweedie law.
Random variate generation and connected computational issues for the Poisson–Tweedie distribution
• Mathematics, Computer Science
Comput. Stat.
• 2016
A closed form for the probability function, as well as its corresponding integral representation which may be useful for large argument values are introduced.
The computation of the probability density and distribution functions for some families of random variables by means of the Wynn-ρ accelerated Post-Widder formula
The suitable use of the Post-Widder inversion formula for Laplace transforms – coupled with the Wynn’s ρ-algorithm for accelerating sequences – is proposed in order to evaluate the probability density function and the distribution function of a large collection of random variables.
A new family of tempered distributions
• Mathematics
• 2016
Tempered distributions have received considerable attention, both from a theoretical point of view and in several important application fields. The most popular choice is perhaps the Tweedie model,
On the properties of a Takács distribution
• Mathematics
Statistics & Probability Letters
• 2019
Tempered positive Linnik processes and their representations
• Mathematics
• 2021
We study several classes of processes associated with the tempered positive Linnik (TPL) distribution, in both the purely absolutely-continuous and mixed law regimes. We explore four main
Goodness-of-Fit Testing for the Newcomb-Benford Law With Application to the Detection of Customs Fraud
• Computer Science
• 2018
A new way of testing the Newcomb-Benford law for digit sequences is suggested that turns out to be particularly attractive for the detection of frauds in customs data collected from international trade.
Fast Pricing of Energy Derivatives with Mean-reverting Jump Processes
• Mathematics
• 2019
The law of a mean-reverting (Ornstein-Uhlenbeck) process driven by a compound Poisson with exponential jumps is investigated in the context of the energy derivatives pricing. The said distribution

## References

SHOWING 1-10 OF 30 REFERENCES
Automatic Nonuniform Random Variate Generation
• Computer Science
• 2011
It is shown how random variate genration algorithms work and an interface for R is suggested as an example of a statistical library, which could be used for simulation or statistical computing.
A simple universal generator for continuous and discrete univariate T-concave distributions
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
Random variate generation for exponentially and polynomially tilted stable distributions
This work develops exact random variate generators for the polynomially and exponentially tilted unilateral stable distributions and presents a novel double rejection method that is useful whenever densities have an integral representation involving an auxiliary variable.
Non-Uniform Random Variate Generation
This chapter reviews the main methods for generating random variables, vectors and processes in non-uniform random variate generation, and provides information on the expected time complexity of various algorithms before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods.
Generating random numbers from a distribution specified by its Laplace transform
This paper advocates simulation by the inversion method using a modified Newton-Raphson method, with values of the distribution and density functions obtained by numerical transform inversion, and shows that this algorithm performs well in a series of increasingly complex examples.
Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
The author presents and analyzes various algorithms for generating positive integer-valued random variables when the distribution is described either through the generating function \$\sum _{i =
Short universal generators via generalized ratio-of-uniforms method
• J. Leydold
• Mathematics, Computer Science
Math. Comput.
• 2003
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
A simple generator for discrete log-concave distributions
• L. Devroye
• Mathematics, Computer Science
Computing
• 2006
We give a short algorithm that can be used to generate random integers with a log-concave distribution (such as the binomial, Poisson, hypergeometric, negative binomial, geometric, logarithmic series
Parameter Estimation for the Discrete Stable Family
• Mathematics
• 2008
The discrete stable family constitutes an interesting two-parameter model of distributions on the non-negative integers with a Paretian tail. The practical use of the discrete stable distribution is