How to couple from the past using a read-once source of randomness

Random Structures and Algorithms

Volumn 16, Issue 1, 2000, Pages 85-113

  Wilson, David Bruce ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034381555     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200001)16:1<85::AID-RSA6>3.0.CO;2-H     Document Type: Article

References (51)

1. D. Aldous, Random walks on finite groups and rapidly mixing Markov chains, in Séminaire de Probabilités XVII, Lecture Notes in Mathematics No. 986, Springer-Verlag, Berlin, 1983, pp. 243-297.
2. D. Aldous, On simulating a Markov chain stationary distribution when transition probabilities are unknown, in Discrete Probability and Algorithms, David Aldous, Persi Diaconis, Joel Spencer, and J. Michael Steele, Eds., volume 72 of IMA Volumes in Mathematics and its Applications, Springer-Verlag, Berlin, 1995, pp. 1-9.
3. D. J. Aldous, A random walk construction of uniform spanning trees and uniform labelled trees, SIAM J Discrete Math, 3, (1990), 450-465.
4. S. Asmussen, Peter W. Glynn, and Hermann Thorisson, Stationary detection in the initial transient problem, ACM Trans Modeling Comput Simulation, 2, 130-157, (1992).
5. P. Brémaud, R. Kannurpatti, and R. Mazumdar. Event and time averages: a review. Advances in Applied Probability, 24, (1992), 377-411.
6. A. Broder, Generating random spanning trees, in 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 442-447.
7. P. Diaconis and D. Freedman, Iterated random functions, SIAM Review, 41, (1999), 45-76.
8. S. Felsner and L. Wernisch, Markov chains for linear extensions, the two-dimensional case, in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 239-247.
9. J. A. Fill, An interruptible algorithm for perfect sampling via Markov chains. The Annals of Applied Probability, 8, (1998), 131-162.
10. J. A. Fill, M. Machida, D. J. Murdoch, and J. S. Rosenthal, Extension of Fill's perfect rejection sampling algorithm to general chains, 1999, Preprint. Extended abstract to appear in Fields Inst Comm.
11. S. G. Foss and R. L. Tweedie, Perfect simulation and backward coupling, Stochastic Model 14, (1998), 187-203.
12. P. J. Green and D. J. Murdoch, Exact sampling for Bayesian inference: towards general purpose algorithms (with discussion), in Bayesian Statistics 6, J. M. Bernardo, J. O. Berger, A. P. Dawid, and A. F. M. Smith, Eds., Oxford University Press, NY, 1999, pp. 301-321. Presented as an invited paper at the 6th Valencia International Meeting on Bayesian Statistics, Alcossebre, Spain, June 1998.
13. O. Häggström, M. N. M. van Lieshout, and J. Møller, Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes, Bernoulli 5, (1999), 641-658.
14. O. Häggström and K. Nelander, Exact sampling from anti-monotone systems, Statistica Neerlandica, 52, (1998), 360-380.
15. O. Häggström and K. Nelander, On exact simulation of Markov random fields using coupling from the past, Scandinavian J. Statistics, 26, (1999), 395-411.
16. O. Häggström and J. E. Steif, Propp-Wilson algorithms and finitary codings for high noise Markov random fields, Combinatorics, Probability and Computing, 1998, to appear.
17. J. L. Hennessy and D. A. Patterson, Computer Organization and Design: The Hardware/Software Interface, Morgan Kaufmann, San Matso, CA, 1994.
18. M. Huber, Efficient exact sampling from the Ising model using Swendsen-Wang, 1998a. (A two-page version appeared in Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Preprint).
19. M. Huber, Exact sampling and approximate counting techniques, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998b, pp. 31-40.
20. D. Jeulin, Dead leaves models: from space tesselation to random functions, World Scientific, Singapore, 1997, pp. 137-156.
21. B. Jun and P. Kocher, The Intel random number generator, 1999. Available at http://www.cryptography.com/intelRNG.pdf.
22. D. Kandel, Y. Matias, R. Unger, and P. Winkler, Shuffling biological sequences, Discrete Applied Mathematics, 71, (1996), 171-185.
23. W. S. Kendall, On some weighted Boolean models, in Advances in Theory and Applications of Random Sets, D. Jeulin, Ed., World Scientific, Singapore, 1997, pp. 105-120.
24. W. S. Kendall, Perfect simulation for the area-interaction point process, in L. Accardi and C. C. Heyde, editors, Probability Towards 2000, L. Accardi and C. C. Heyde, Eds., Spinger-Verlag, Berlin, 1998, pp. 218-234.
25. W. S. Kendall and J. Møller, Perfect Metropolis-Hastings simulation of locally stable point processes, 1999, Preprint.
26. W. S. Kendall, and E. Thönnes, Perfect simulation in stochastic geometry, J. Pattern Recognition, 1998. Special issue on random sets, to appear.
27. G. Letac, A contraction principle for certain Markov chains and its applications, in Random Matrices and Their Applications, Volume 50 of Contemporary Mathematics, American Mathematical Society, 1986, pp. 263-273.
28. L. Lovász and P. Winkler, Exact mixing in an unknown Markov chain, Electronic J Combin 2 (1995) Paper #R15.
29. M. Luby, D. Randall, and A. Sinclair, Markov chain algorithms for planar lattice structures (extended abstract), in 36th Annual Symposium on Foundations of Computer Science, 1995, pp. 150-159.
30. M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of Las Vegas algorithms, Inform Process Lett 47 (1993) 173-180.
31. M. Luby and E. Vigoda, Approximately counting up to four (extended abstract), in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997, pp. 682-687.
32. R. B. Lund and D. B. Wilson, Exact sampling algorithms for storage systems, 1997, unpublished.
33. B. Melamed and W. Whitt. On arrivals that see time averages, Oper Res. 38 (1990), 156-172.
34. B. Melamed and D. D. Yao, The ASTA property, in Advances in Queueing, J. H. Dshalalow, Ed., Probability and Stochastics, CRC Press, Boca Raton, Fl, 1995, pp. 195-224.
35. A. Mira, J. Møller, and G. O. Roberts, Perfect slice samplers, 1998, Preprint.
36. J. Møller, Perfect simulation of conditionally specified models, J Roy Statist Soc Ser B, 61 (1999), 251-264.
37. J. Møller and K. Schladitz, Extensions of Fill's algorithm for perfect simulation, J Roy Statist Soc Ser B, 61(4) (1999), 955-969.
38. D. J. Murdoch, Exact sampling for Bayesian inference: Unbounded state spaces, Fields Inst Commun, 1999, to appear.
39. D. J. Murdoch and P. J. Green. Exact sampling from a continuous state space, Scandinavian J Statistics, 25 (1998), 483-502.
40. F. Muri, D. Chauveau, and D. Cellier, Convergence assessment in latent variable models: DNA applications, in Discretization and MCMC Convergence Assessment, Christian P. Robert, Ed. Lecture Notes in Statistics # 135, Springer-Verlag, Berlin, 1998, pp. 127-146.
41. K. Nelander, A Markov chain Monte Carlo study of the beach model, 1998, preprint.
42. J. G. Propp and D. B. Wilson, Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures Algorithms 9 (1996), 223-252.
43. J. Propp and D. Wilson, Coupling from the past: a user's guide, in D. Aldous and J. Propp, editors, Microsurveys in Discrete Probability, volume 41 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1998, pp. 181-192.
44. J. G. Propp and D. B. Wilson, How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph, J Algorithms 27 (1998), 170-217.
45. E. Thönnes, Perfect simulation of some point processes for the impatient user, Adv Appl Probability, Stochastic Geometry Statist Appl 31 (1999), 69-87.
46. J. van den Berg and J. E. Steif, On the existence and non-existence of finitary codings for a class of random fields, Ann Probab 1998, to appear.
47. D. B. Wilson, Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP), Fields Inst Commun 1999, to appear.
48. R. W. Wolff, Poisson arrivals see time averages, Oper Res 30 (1982), 223-231.
49. T. Yan, 1998, personal communication.
50. M. Luby and E. Vigoda, Fast convergence of the Glauber dynamics for sampling independent sets, Random Structures Algorithms 15 (1999), 229-241.
51. J. Møller and G. K. Nicholls, Perfect simulation for sample-based inference, 1999, preprint.