Notes on perfect simulation

Markov Chain Monte Carlo: Innovations And Applications

Volumn , Issue , 2005, Pages 93-146

  Kendall, Wilfrid ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85115930809     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812700919_0003     Document Type: Chapter

References (97)

1. D. J. Aldous. The random walk construction of uniform spanning trees and uniform labelled trees. SIAM J. Discrete Math., 3(4): 450-465, 1990.
2. G. K. Ambler and B. W. Silverman. Perfect simulation for bayesian wavelet thresholding with correlated coefficients. preprint, University of Bristol Department of Mathematics, 2004. Available at http://www.maths.bris.ac.uk/~magka/research/papers/waveSUB.pdf.
3. G. K. Ambler and B. W. Silverman. Perfect simulation of spatial point processes using dominated coupling from the past with application to a multiscale area-interaction point process. preprint, University of Bristol Department of Mathematics, 2004. Available at http://www.maths.bris.ac.uk/~magka/research/papers/att-rep.pdf.
4. S. Asmussen, P. W. Glynn, and H. Thorisson. Stationarity detection in the initial transient problem. ACM Trans. Model. Comput. Simul., 2(2): 130-157, 1992.
5. K. B. Athreya and P. Ney. A new approach to the limit theory of recurrent Markov chains. Transactions of the American Mathematical Society, 245: 493-501, 1978.
6. K. B. Athreya and O. Stenflo. Perfect sampling for Doeblin chains. Sankhya, 65(4): 763-777, 2003.
7. A. J. Baddeley and M. N. M. van Lieshout. Area-interaction point processes. Annals of the Institute of Statistical Mathematics, 47: 601-619, 1995.
8. K.K. Berthelsen and J. Møller. An efficient MCMC method for Bayesian point process models with intractable normalising constants. In A. Baddeley, P. Gregori, J. Mateu, R. Stoica, and D. Stoyan, editors, Spatial point process modelling and its applications, Publicacions de la Universitat Jaume I, pages 7-15, 2004.
9. A. A. Borovkov. Asymptotic methods in queuing theory. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. John Wiley & Sons Ltd., Chichester, 1984.
10. A. A. Borovkov and S. G. Foss. Stochastically recursive sequences and their generalizations. Siberian Adv. Math., 2(1): 16-81, 1992. Siberian Advances in Mathematics.
11. L. A. Breyer and G. O. Roberts. Catalytic perfect simulation. Methodol. Comput. Appl. Probab., 3(2): 161-177, 2001.
12. L. A. Breyer and G. O. Roberts. A new method for coupling random fields. LMS J. Comput. Math., 5: 77-94 (electronic), 2002.
13. A. Brix and W. S. Kendall. Simulation of cluster point processes without edge effects. Advances in Applied Probability, 34(2): 267-280, June 2002.
14. A. Broder. Generating random spanning trees. In Thirtieth Annual Symposium Foundations Computer Sci., pages 442-447, New York, 1989. IEEE.
15. S.P. Brooks and G.O. Roberts. Assessing convergence ofMarkov Chain Monte Carlo algorithms. Technical report, University of Cambridge, May 1997.
16. K. Burdzy and W. S. Kendall. Efficient Markovian couplings: examples and counterexamples. The Annals of Applied Probability, 10(2): 362-409, May 2000.
17. Y. Cai and W. S. Kendall. Perfect simulation for correlated Poisson random variables conditioned to be positive. Statistics and Computing, 12: 229-243, July 2002.
18. G. Casella, M. Lavine, and C. P. Robert. Explaining the perfect sampler. Amer. Statist., 55(4): 299-305, 2001.
19. P. Clifford and A. Sudbury. A sample path proof of the duality for stochastically monotone Markov processes. Ann. Probab., 13(2): 558-565, 1985.
20. J. N. Corcoran and U. Schneider. Shift and scale coupling methods for perfect simulation. Probab. Engrg. Inform. Sci., 17(3): 277-303, 2003.
21. J. N. Corcoran and R. L. Tweedie. Perfect sampling of ergodic Harris chains. The Annals of Applied Probability, 11(2): 438-451, 2001.
22. M.K. Cowles and B.P. Carlin. Markov Chain Monte Carlo convergence diagnostics: A comparative review. Technical report, University of Minnesota, Div. of Biostatistics, USA, May 1995.
23. R. V. Craiu and X.-L. Meng. Antithetic coupling for perfect sampling. In Bayesian Methods with Applications to Science, Policy, and Official Statistics. Selected papers from ISBA 2000: the sixth world meeting of the International Society for Bayesian Analysis., pages 99-108, 2001.
24. P. Diaconis and J. Fill. Strong stationary times via a new form of duality. The Annals of Probability, 18: 1483-1522, 1990.
25. Persi Diaconis and Daniel Stroock. Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1(1): 36-61, 1991.
26. X. K. Dimakos. A guide to exact simulation. International Statistical Review, 69(1): 27-48, 2001.
27. Robert P. Dobrow and J. A. Fill. Speeding up the FMMR perfect sam pling algorithm: a case study revisited. Random Structures and Algorithms, 23(4): 434-452, 2003.
28. W. Doeblin. Sur les propriétés asymptotiques de mouvement régis par certains types de châines simples. Bull. Math. Soc. Roum. Sci., 39(1, 2): 57-115, 3-61, 1937.
29. Roberto Fernández, Pablo A. Ferrari, and Nancy L. Garcia. Loss network representation of Peierls contours. The Annals of Probability, 29(2): 902-937, 2001.
30. Pablo A. Ferrari, Roberto Fernández, and Nancy L. Garcia. Perfect simulation for interacting point processes, loss networks and Ising models. Stochastic Processes and Their Applications, 102(1): 63-88, 2002.
31. J. A. Fill. An interruptible algorithm for exact sampling via Markov Chains. The Annals of Applied Probability, 8: 131-162, 1998.
32. J. A. Fill and M. Huber. The randomness recycler: a new technique for perfect sampling. In 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), pages 503-511. IEEE Comput. Soc. Press, Los Alamitos, CA, 2000.
33. J. A. Fill, M. Machida, D. J. Murdoch, and J. S. Rosenthal. Extension of Fill’s perfect rejection sampling algorithm to general chains. Random Structures and Algorithms, 17(3-4): 290-316, 2000.
34. S. G. Foss. Ergodicity conditions in multiserver queueing systems with waiting time. Sibirsk. Mat. Zh., 24(6): 168-175, 1983.
35. S. G. Foss and R. L. Tweedie. Perfect simulation and backward coupling. Stochastic Models, 14: 187-203, 1998.
36. Sheldon Goldstein. Maximal coupling. Zeitschrift für Wahrscheinlichkeitstheorie und Verve Gebiete, 46(2): 193-204, 1978 / 1979.
37. P. J. Green and D. J. Murdoch. Exact sampling for Bayesian inference: towards general purpose algorithms (with discussion). In J.M. Bernardo, J.O. Berger, A.P. Dawid, and A.F.M. Smith, editors, Bayesian Statistics 6, pages 301-321. The Clarendon Press Oxford University Press, 1999. Presented as an invited paper at the 6th Valencia International Meeting on Bayesian Statistics, Alcossebre, Spain, June 1998.
38. D. Griffeath. A maximal coupling for Markov chains. Zeitschrift für Wahrscheinlichkeitstheorie und Verve Gebiete, 31: 95-106, 1974 / 1975.
39. O. Häggström. Finite Markov chains and algorithmic applications, volume 52 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 2002.
40. O. Häggström and K. Nelander. Exact sampling from anti-monotone systems. statistica neerlandica, 52(3): 360-380, 1998.
41. O. Häggström and J. E. Steif. Propp-Wilson algorithms and finitary codings for high noise Markov random fields. Combin. Probab. Computing, 9: 425-439, 2000.
42. 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(5): 641-658, 1999. Was: Aalborg Mathematics Department Research Report R-96-2040.
43. J. P. Hobert and C. P. Robert. A mixture representation of π with applications in Markov chain Monte Carlo and perfect sampling. The Annals of Applied Probability, 14(3): to appear, August 2004.
44. C. C. Holmes and B. K. Mallick. Perfect simulation for Bayesian curve and surface fitting. preprint, Texas A&M University Department of Mathematics, 2003. Available at http://stat.tamu.edu/~bmallick/papers/perf.ps.
45. M. Huber. The swap move: a tool for building better Markov chains. In 10th Annual Symposium on Discrete Algorithms, 1999.
46. M. Huber. A bounding chain for Swendsen-Wang. Random Structures and Algorithms, 22(1): 43-59, 2003.
47. V. E. Johnson. Studying convergence of Markov chain Monte Carlo algorithms using coupled sample paths. Journal of the American Statistical Association, 91(433): 154-166, 1996.
48. W. S. Kendall. Coupling methods and the storage equation. Journal of Applied Probability, 20: 436-441, 1983.
49. W. S. Kendall. On some weighted Boolean models. In D. Jeulin, editor, Advances in Theory and Applications of Random Sets, pages 105-120, Singapore, 1997. World Scientific.
50. W. S. Kendall. Perfect simulation for spatial point processes. In Bulletin ISI, 51st session proceedings, Istanbul (August 1997), volume 3, pages 163-166, 1997.
51. W. S. Kendall. Perfect simulation for the area-interaction point process. In L. Accardi and C. C. Heyde, editors, Probability Towards 2000, pages 218-234, New York, 1998. Springer-Verlag.
52. W. S. Kendall. Geometric ergodicity and perfect simulation. Electronic Communications in Probability, 9: to appear, 2004.
53. W. S. Kendall and J. Møller. Perfect simulation using dominating processes on ordered state spaces, with application to locally stable point processes. Advances in Applied Probability, 32(3): 844-865, September 2000.
54. W. S. Kendall and G. Montana. Small sets and Markov transition densities. Stochastic Processes and Their Applications, 99(2): 177-194, May 2002.
55. W. S. Kendall and E. Thönnes. Perfect simulation in stochastic geometry. Pattern Recognition, 32(9): 1569-1586, 1999.
56. W. S. Kendall and R. G.Wilson. Ising models and multiresolution quad-trees. Advances in Applied Probability, 35(1): 96-122, March 2003.
57. Yu. Kifer. Ergodic theory of random transformations, volume 10 of Progress in Probability and Statistics. Birkhäuser Boston Inc., Boston, MA, 1986.
58. R. Kindermann and J. L. Snell. Markov random fields and their applications, volume 1 of Contemporary Mathematics. American Mathematical Society, Providence, R.I., 1980.
59. A. N. Kolmogorov. Zur theorie der markoffschen ketten. Math. Annalen, 112: 155-160, 1936.
60. V. S. Anil Kumar and H. Ramesh. Coupling vs. conductance for the Jerrum-Sinclair chain. Random Structures and Algorithms, 18(1): 1-17, 2001.
61. G. Letac. A contraction principle for certain Markov chains and its applications. In Random matrices and their applications (Brunswick, Maine, 1984), volume 50 of Contemp. Math., pages 263-273. Amer. Math. Soc., Providence, RI, 1986.
62. T. Lindvall. Lectures on the coupling method. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics. John Wiley & Sons Inc., New York, 1992. A Wiley-Interscience Publication.
63. T. Lindvall. Lectures on the coupling method. Dover Publications Inc., Mineola, NY, 2002. Corrected reprint of the 1992 original.
64. R. Loynes. The stability of a queue with non-independent inter-arrival and service times. Math. Proc. Camb. Phil. Soc., 58(3): 497-520, 1962.
65. X.-L. Meng. Towards a more general Propp-Wilson algorithm: multistage backward coupling. In Monte Carlo methods (Toronto, ON, 1998), volume 26 of Fields Inst. Commun., pages 85-93. Amer. Math. Soc., Providence, RI, 2000.
66. S. P. Meyn and R. L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, New York, 1993.
67. A. Mira, J. Møller, and G. O. Roberts. Perfect slice samplers. Journal of the Royal Statistical Society (Series B: Methodological), 63(3): 593-606, 2001. See [68] for corrigendum.
68. A. Mira, J. Møller, and G. O. Roberts. Corrigendum: Perfect slice samplers. Journal of the Royal Statistical Society (Series B: Methodological), 64(3): 581, 2002.
69. J. Møller and J.G. Rasmussen. A note on a perfect simulation algorithm for marked Hawkes processes. In A. Baddeley, P. Gregori, J. Mateu, R. Stoica, and D. Stoyan, editors, Spatial point process modelling and its applications, Publicacions de la Universitat Jaume I, pages 187-192, 2004.
70. J. Møller and K. Schladitz. Extensions of Fill’s algorithm for perfect simulation. Journal of the Royal Statistical Society (Series B: Methodological), 61(4): 955-969, 1999.
71. J. Møller and R. Waagepetersen. Statistical inference and simulation for spatial point processes, volume 100 of Monographs on Statistics and Applied Probability. Chapman and Hall / CRC, Boca Raton, 2004.
72. T. S. Mountford and M. Cranston. Efficient coupling on the circle. In Game theory, optimal stopping, probability and statistics, volume 35 of IMS Lecture Notes Monogr. Ser., pages 191-203. Institute of Mathematical Statistics, Beachwood, OH, 2000.
73. D. Murdoch and J. Rosenthal. Efficient use of exact samples. Statistics and Computing, 10: 237-243, 1999.
74. D. J. Murdoch. Exact sampling for Bayesian inference: unbounded state spaces. In Monte Carlo methods (Toronto, ON, 1998), volume 26 of Fields Inst. Commun., pages 111-121. Amer. Math. Soc., Providence, RI, 2000.
75. P. Mykland, L. Tierney, and B. Yu. Regeneration in Markov chain samplers. Journal of the American Statistical Association, 90(429): 233-241, 1995.
76. E. Nummelin. A splitting technique for Harris-recurrent chains. Zeitschrift für Wahrscheinlichkeitstheorie und Verve Gebiete, 43: 309-318, 1978.
77. E. Nummelin. General irreducible Markov chains and nonnegative operators. Cambridge University Press, Cambridge, 1984.
78. J. G. Propp and D. B. Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms, 9: 223-252, 1996.
79. J. G. Propp and D. B. Wilson. Coupling from the past: a user’s guide. In Microsurveys in discrete probability (Princeton, NJ, 1997), volume 41 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 181-192. American Mathematical Society, Providence, RI, 1998.
80. G. O. Roberts and N. G. Polson. On the geometric convergence of the Gibbs sampler. Journal of the Royal Statistical Society (Series B: Methodological), 56(2): 377-384, 1994.
81. G. O. Roberts and J. S. Rosenthal. Convergence of slice sampler Markov chains. Journal of the Royal Statistical Society (Series B: Methodological), 61(3): 643-660, 1999.
82. G. O. Roberts and J. S. Rosenthal. Small and pseudo-small sets for Markov chains. Stochastic Models, 17(2): 121-145, 2001.
83. G. O. Roberts and R. L. Tweedie. Exponential convergence of Langevin diffusions and their discrete approximations. Bernoulli, 2: 341-364, 1996.
84. G. O. Roberts and R. L. Tweedie. Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika, 83: 96-110, 1996.
85. J. S. Rosenthal. Quantitative convergence rates of Markov chains: A simple account. Electronic Communications in Probability, 7: no. 13, 123-128 (electronic), 2002.
86. D. Siegmund. The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes. The Annals of Probability, 4(6): 914-924, 1976.
87. D. Stoyan. Comparison methods for queues and other stochastic models. Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics. John Wiley & Sons, Chichester, 1983. Translation from the German edited by Daryl J. Daley.
88. M. Sweeny. Monte Carlo study of weighted percolation clusters relevant to the Potts models. Physical Review B, 27(7): 4445-4455, 1983.
89. E. Thönnes. Perfect simulation of some point processes for the impatient user. Advances in Applied Probability, 31(1): 69-87, 1999.
90. E. Thönnes. A primer in perfect simulation. In K. R. Mecke and D. Stoyan, editors, Statistical Physics and Spatial Statistics, number 554 in Lecture Notes in Physics, pages 349-378. Springer-Verlag, 2000.
91. H. Thorisson. Backward limits. The Annals of Probability, 16(2): 914-924, 1988.
92. H. Thorisson. Coupling, stationarity, and regeneration. Springer-Verlag, New York, 2000.
93. B. Widom and J. S. Rowlinson. New model for the study of liquid-vapor phase transitions. Journal of Chemical Physics, 52: 1670-1684, 1970.
94. D. B. Wilson. Generating random spanning trees more quickly than the cover time. In Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), pages 296-303, New York, 1996. ACM.
95. D. B. Wilson. How to couple from the past using a read-once source of randomness. Random Structures and Algorithms, 16(1): 85-113, 2000.
96. D. B. Wilson. Layered Multishift Coupling for use in Perfect Sampling Algorithms (with a primer on CFTP). In N. Madras, editor, Monte Carlo Methods, volume 26 of Fields Institute Communications, pages 143-179. American Mathematical Society, 2000.
97. D. B. Wilson and J. G. Propp. How to get an exact sample from a generic Markov chain and sample a random spanning tree from a directed graph, both within the cover time. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), pages 448-457, New York, 1996. ACM.