Complexity of monotone algorithms for the simulation of discrete distributions

MaRDI QIDQ3362473zbMATH OpenFDO

Authors B. B. Pokhodzej

Publication date 1992

zbMATH Keywords

complexitydiscrete monotone methodfinite discrete distributionsinvert methodnon-monotone algorithmsoptimal monotone algorithmsrandom variablessimulation

Mathematics Subject Classification ID

Approximations to statistical distributions (nonasymptotic) (62E17) Probabilistic methods, stochastic differential equations (65C99) Complexity and performance of numerical algorithms (65Y20)

Cited in

(12)

• Complexity of monotone modelling algorithms for discrete distributions
• Remarks on the complexity of simulation of a ``simple geometric distribution
• Generation of discrete random variables in scalable frameworks
• Sharp entropy bounds for discrete statistical simulation
• Applying Buchberger's criteria on Montes's DisPGB algorithm
• Monotone Emulation of Computer Experiments
• scientific article; zbMATH DE number 4129950 (Why is no real title available?)
• scientific article; zbMATH DE number 3954271 (Why is no real title available?)
• scientific article; zbMATH DE number 3982480 (Why is no real title available?)
• scientific article; zbMATH DE number 3982481 (Why is no real title available?)
• scientific article; zbMATH DE number 4048803 (Why is no real title available?)
• scientific article; zbMATH DE number 4110061 (Why is no real title available?)

This page was built for publication: Complexity of monotone algorithms for the simulation of discrete distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3362473)