New coins from old, smoothly

DOI10.1007/s00365-010-9108-5zbMath1238.41007arXiv0808.1936OpenAlexW3106273500MaRDI QIDQ658983

Yuval Peres, O. V. Holtz, F. L. Nazarov

Publication date: 9 February 2012

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.1936

zbMATH Keywords

simulationsmoothnessLorentz operatorsBernstein-positive approximation

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Related Items

Probability, minimax approximation, and Nash-equilibrium. Estimating the parameter of a biased coin ⋮ From the Bernoulli factory to a dice enterprise via perfect sampling of Markov chains

Cites Work

• Unnamed Item
• Iterating von Neumann's procedure for extracting random bits
• Fast simulation of new coins from old
• New coins from old: Computing with unknown bias
• The degree of approximation by polynomials with positive coefficients
• A Bernoulli factory