An interruptible algorithm for perfect sampling via Markov chains

Annals of Applied Probability

Volumn 8, Issue 1, 1998, Pages 131-162

  Fill, James Allen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Attractive spin system; Duality; Gibbs sampler; Ising model; Markov chain Monte Carlo; Monotone chain; Partially ordered set; Perfect simulation; Rejection sampling; Separation; Strong stationary time

Indexed keywords

EID: 0032396902     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1027961037     Document Type: Article

References (38)

1. ALDOUS, D. and DIACONIS, P. (1986). Shuffling cards and stopping times. Amer. Math. Monthly 93 333-348.
2. ALDOUS, D. and DIACONIS, P. (1987). Strong uniform times and finite random walks. Adv. in Appl. Math. 8 69-97.
3. ALDOUS, D. and FILL, J. A. (1998). Reversible Markov Chains and Random Walks on Graphs. Unpublished manuscript. First draft of manuscript available via http://www.stat. berkeley.edu/users/aldous.
4. ASMUSSEN, S., GLYNN, P. W. and THORISSON, H. (1992). Stationary detection in the initial transient problem. ACM Trans. Modelling and Comput. Sim. 2 130-157.
5. BESAG, J. E. (1986). On the statistical analysis of dirty pictures. J. Roy. Statist. Soc. Ser. B 48 259-302.
6. BESAG, J. E. and CLIFFORD, P. (1989). Generalized Monte Carlo significance tests. Biometrika 76 633-642.
7. BESAG, J. E. and CLIFFORD, P. (1991). Sequential Monte Carlo p-values. Biometrika 78 301-304.
8. BESAG, J., GREEN, P., HIGDON, D. and MENGERSEN, K. (1995). Bayesian computation and stochastic systems. Statist. Sci. 10 3-66.
9. BOROVKOV, A. A. and FOSS, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math. 2 16-81.
10. BOROVKOV, A. A. and FOSS, S. G. (1994). Two ergodicity criteria for stochastically recursive sequences. Acta Appl. Math. 34 125-134.
11. COWEN, L. J. (1996). Personal communication.
12. DIACONIS, P. (1988). Group Representations in Probability and Statistics. IMS, Hayward, CA.
13. DIACONIS, P. and FILL, J. A. (1990). Strong stationary times via a new form of duality. Ann. Probab. 18 1483-1522.
14. DIACONIS, P. and SALOFF-COSTE, L. (1995). What do we know about the Metropolis algorithm? In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing 112-129.
15. DIACONIS, P. and SALOFF-COSTE, L. (1995). Geometry and randomness. Unpublished lecture notes.
16. FILL, J. A. (1998). The move-to-front rule: a case study for two exact sampling algorithms. Probab. Eng. Info. Sci. To appear.
17. FILL, J. A. and MACHIDA, M. (1998). Stochastic monotonicity and realizable monotonicity. Unpublished notes.
18. FILL, J. A. and MACHIDA, M. (1997). Duality relations for Markov chains on partially ordered state spaces. Unpublished notes.
19. FOSS, S. G. (1983). On ergodicity conditions in multi-server queues. Siberian Math. J. 24 168-175.
20. FOSS, S., TWEEDIE, R. L. and CORCORAN, J. (1997). Simulating the invariant measures of Markov chains using backward coupling at regeneration times. Preprint.
21. GEMAN, S. and GEMAN, D. (1984). Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-6(6).
22. HÄGGSTRÖM, O. and NELANDER, K. (1997). Exact sampling from anti-monotone systems. Preprint.
23. HÄGGSTRÖM, O., VAN LIESHOUT, M. N. M. and MØLLER, J. (1996). Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Preprint.
24. JOHNSON, V. E. (1996). Studying convergence of Markov chain Monte Carlo algorithms using coupled sample paths. J. Amer. Statist. Assoc. 91 154-166.
25. KAMAE, T., KRENGEL, U. and O'BRIEN, G. L. (1977). Stochastic inequalities on partially ordered state spaces. Ann. Probab. 5 899-912.
26. KENDALL, W. S. (1996). Perfect simulation for the area-interaction point process. In Probability Perspective (L. Accardi and C. C. Heyde, eds.). World Scientific Press, Singapore. To appear.
27. KENDALL, W. S. (1996). On some weighted Boolean models. In Advances in Theory and Application of Random Sets (D. Jeulin, ed.) 105-120. World Scientific Press, Singapore.
28. LIGGETT, T. (1985). Interacting Particle Systems. Springer, New York.
29. LOVÁSZ, L. and WINKLER, P. (1995). Exact mixing in an unknown Markov chain. Electron. J. Combin. 2 R15.
30. LUND, R. B., WILSON, D. B., FOSS, S. and TWEEDIE, R. L. (1997). Exact and approximate simulation of the invariant measures of Markov chains. Preprint.
31. PROPP, J. G. and WILSON, D. B. (1996). Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9 223-252.
32. ROSS, S. (1994). A First Course in Probability, 4th ed. Macmillan, New York.
33. SINCLAIR, A. (1993). Algorithms for Random Generation and Counting: A Markov Chain Approach. Birkhäuser, Boston.
34. SPERNER, E. (1928). Ein Satz über Untermengen einer endlichen Menge. Math. Z. 27 544-548.
35. STANLEY, R. P. (1986). Enumerative Combinatorics 1. Wadsworth & Brooks/Cole, Monterey, CA.
36. STRASSEN, V. (1965). The existence of probability measures with given marginals. Ann. Math. Statist. 36 423-439.
37. WILSON, D. B. and PROPP, J. G. (1997). How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. J. Algorithms. To appear.
38. WILSON, D. B. (1995). Personal communication.