Grid methods in simulation and random variate generation
From MaRDI portal
Publication:1069659
DOI10.1007/BF02252735zbMath0584.65002MaRDI QIDQ1069659
Publication date: 1986
Published in: Computing (Search for Journal in Brave)
grid generation; compact set; storage requirements; car parking problem; avoidance problems; design of fast generators for random variates; expected time performance
65C20: Probabilistic models, generic numerical methods in probability and statistics
65C10: Random number generation in numerical analysis
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
Related Items
Optimal ellipsoids and decomposition of positive definite matrices, A new measure of association for bivariate survival data, Generalized exponential distribution: Bayesian estimations, On random variate generation when only moments of Fourier coefficients are known, Analytic and asymptotic properties of generalized Linnik probability densities, Automated rejection sampling from product of distributions, A random number generator based on unpredictable chaotic functions, Quasi-Monte Carlo algorithms for unbounded, weighted integration problems, A mixture representation of the Linnik distribution, A family of enhanced Lehmer random number generators, with hyperplane suppression, and direct support for certain physical applications, Probability density estimation in stochastic environmental models using reverse representa\-tions, On the density of log-spot in the Heston volatility model
Uses Software
Cites Work
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- Generating discrete random variables in a computer
- On Mixture Methods for the Computer Generation of Random Variables
- Simulation of some spatial hard core models, and the complete packing problem
- A computer program for the generation of random variables from any discrete distribution
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
