Complexity Questions in Non-Uniform Random Variate Generation
From MaRDI portal
Publication:3298440
DOI10.1007/978-3-7908-2604-3_1zbMath1436.60003OpenAlexW2268137518MaRDI QIDQ3298440
Publication date: 14 July 2020
Published in: Proceedings of COMPSTAT'2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-7908-2604-3_1
Computational methods for problems pertaining to probability theory (60-08) Random number generation in numerical analysis (65C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new class of random number generators
- Simulating the Dickman distribution
- Perfect simulation of Vervaat perpetuities
- On exact simulation algorithms for some distributions related to Jacobi theta functions
- A log-type moment result for perpetuities and its application to martingales in supercritical branching random walks
- On random variate generation when only moments of Fourier coefficients are known
- On the computer generation of random variables with a given characteristic function
- Stable densities under change of scale and total variation inequalities
- An interruptible algorithm for perfect sampling via Markov chains
- Simulating theta random variates
- Perfect simulation from the quicksort limit distribution
- The contraction method for recursive algorithms
- Computer methods for sampling from gamma, beta, Poisson and binomial distributions
- Stability of perpetuities
- Density approximation and exact simulation of random variables that are solutions of fixed-point equations
- On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
- Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
- A Note on the Generation of Random Normal Deviates
- The Series Method for Random Variate Generation and Its Application to the Kolmogorov-Smirnov Distribution
- Computer Generation of Distributions on the m-Sphere
- The complexity of generating an exponentially distributed variate
- On simulation from infinitely divisible distributions
- A Method for Simulating Stable Random Variables
- Exact Sampling from a Continuous State Space
- Polar Generation of Random Variates with the t-Distribution
- An Automatic Method for Generating Random Variates with a Given Characteristic Function
- A Bernoulli factory
- Stationarity detection in the initial transient problem
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Equation of State Calculations by Fast Computing Machines
- A Method for the Construction of Minimum-Redundancy Codes
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Simulating perpetuities
This page was built for publication: Complexity Questions in Non-Uniform Random Variate Generation