Grid methods in simulation and random variate generation (Q1069659): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161647
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Luc P. Devroye / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: spatial / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5664617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of some spatial hard core models, and the complete packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating discrete random variables in a computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer program for the generation of random variables from any discrete distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mixture Methods for the Computer Generation of Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for Generating Discrete Random Variables with General Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844537 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02252735 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W197807693 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article
Language Label Description Also known as
English
Grid methods in simulation and random variate generation
scientific article

    Statements

    Grid methods in simulation and random variate generation (English)
    0 references
    0 references
    1986
    0 references
    Points can be generated uniformly in a compact set A of \(R^ d\) by constructing a fine rectangular grid covering A, selecting a grid rectangle, and performing an acceptance test if the rectangle in question is not entirely contained in A. For very fine grids, the acceptance test is needed with very small probability. We look at the storage requirements and expected time performance of this method, and apply it in avoidance problems and in the design of fast generators for random variates with a bounded density on [0,1].
    0 references
    grid generation
    0 references
    car parking problem
    0 references
    compact set
    0 references
    storage requirements
    0 references
    expected time performance
    0 references
    avoidance problems
    0 references
    design of fast generators for random variates
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references