Fast simulation of new coins from old (Q1774211): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1975763279 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0309222 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4023085 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Efficient Construction of an Unbiased Random Sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonexistence of a class of variate generation schemes. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4758141 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Bernoulli factory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4178385 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4549185 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterating von Neumann's procedure for extracting random bits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3351923 / rank | |||
Normal rank |
Latest revision as of 10:43, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast simulation of new coins from old |
scientific article |
Statements
Fast simulation of new coins from old (English)
0 references
29 April 2005
0 references
The paper is devoted to the problem of fast simulation of new coins from old. In particular, the case of using independent tosses of a coin with probabilities of heads \(p\) to simulate a coin with probabilities of heads \(f(p)\) is constructed, where \(f\) is some unknown function. It is proven that there is a dependence between the properties of the simulation algorithms and classes of functions \(f\). It is shown that the simulation of the given class of functions is equivalent to finding sequences of certain Bernstein polynomials which approximate it from above and below. This construct is used, because the Bernstein polynomials provide exponentially convergent approximations for linear functions. A proof of the fact that any continuous real analytic function bounded away from 0 and 1 has a simulation is given. Necessary conditions for fast simulations are described. A very simple algorithm is given to illustrate the achieved theoretical results. Some open problems are mentioned in the end of the paper.
0 references
probabilistic methods
0 references
fast simulation of new coins from old
0 references
simulation algorithms
0 references
Bernstein polynomials
0 references