Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes

Advances in Applied Probability

Volumn 32, Issue 3, 2000, Pages 844-865

  Kendall, Wilfrid S ^a   Møller, Jesper ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MARKOV PROCESSES; MONTE CARLO METHODS;

COUPLING FROM THE PAST (CFTP) SIMULATION; PAPANGELOU CONDITIONAL INTENSITY; SPATIAL BIRTH-AND-DEATH PROCESS; SPATIAL POINT PROCESS; STOCHASTIC MONOTONICITY; STRAUSS PROCESS;

PROBABILITY;

EID: 0034264679     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800010284     Document Type: Article

References (43)

1. BADDELEY, A. J. AND MØLER, J. (1989). Nearest neighbour Markov point processes and random sets. Int. Statist. Rev. 57, 89-121.
2. BADDELEY, A. J. AND VAN LIESHOUT, M. N. M. (1995). Area-interaction point processes. Ann. lnst. Statist. Math. 47, 601-619.
3. BOROVKOV, A. A. AND FOSS, S. G. (1992). Stochastically recursive sequences and their generalizations. Siberian Adv. Math. 2, 16-81.
4. BURDZY, K. AND KENDALL, W. S. (2000). Efficient Markovian couplings: examples and counterexamples. Ann. Appl. Prob. 10, 362-409.
5. CARTER, D. S. AND PRENTER, P. M. (1972). Exponential spaces and counting processes. Z. Wahrscheinlichkeitsth. 21, 1-19.
6. CLIFFORD, P. AND NICHOLLS, G. (1994). Comparison of birth-and-death and Metropolis-Hastings Markov chain Monte Carlo for the Strauss process. Available at http://www.math.auckland.ac.nz/~nicholls/.
7. CORCORAN, J. N. AND TWEEDIE, R. L. (1997). Perfect sampling of Harris recurrent Markov chains. Unpublished manuscript.
8. DARLING, R. W. R. (1987). Constructing Nonhomeomorphic Stochastic Flows. Mem. Amer. Math. Soc. 70, No. 376.
9. FERNÁNDEZ, R., FERRARI, P. A. AND GARCIA, N. L. (1999). Perfect simulation for interacting point processes, loss networks and Ising models. Preprint.
10. FILL, J. (1998). An interruptible algorithm for exact sampling via Markov chains. Ann. Appl. Prob. 8, 131-162.
11. FOSS, S. G. AND TWEEDIE, R. L. (1998). Perfect simulation and backward coupling. Stoch. Models 14, 187-203.
12. GEYER, C. J. (1999). Likelihood inference for spatial point processes. Stochastic Geometry: Likelihood and Computation, eds O. E. Barndorff-Nielsen, W. S. Kendall and M. N. M. van Lieshout. Chapman & Hall/CRC, Boca Raton, pp. 79-140.
13. GEYER, C. J. AND MØLLER, J. (1994). Simulation and likelihood inference for spatial point processes. Scand. J. Statist. 21, 359-373.
14. GREEN, P. J. AND MURDOCH, D. J. (1999). Exact sampling for Bayesian inference: towards general purpose algorithms. In Bayesian Statistics 6, eds J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith. Oxford University Press.
15. HÄGGSTRÖM, O. AND STEIF, J. E. (1999). Propp-Wilson algorithms and finitary codings for high noise Markov random fields. To appear in Combin. Prob. Comput.
16. HÄGGSTRöM, O., VAN LIESHOUT, M. N. M. AND MØLLER, J. (1999). Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Bernoulli 5, 641-659.
17. KELLY, F. P. AND RIPLEY, B. D. (1976). A note on Strauss's model for clustering. Biometrika 63, 357-360.
18. KENDALL, W. S. (1997). On some weighted Boolean models. In Advances in Theory and Applications of Random Sets, ed. D. Jeulin. World Scientific Publishing Company, Singapore, pp. 105-120.
19. KENDALL, W. S. (1997). Perfect simulation for spatial point processes. In Proc. ISI 51st session, Istanbul (August 1997), vol. 3, pp. 163-166.
20. KENDALL, W. S. (1998). Perfect simulation for the area-interaction point process. In Probability Towards 2000 eds L. Accardi and C. C. Heyde. Springer, New York, pp. 218-234.
21. KENDALL, W. S. AND MØLLER, J. (1999). Perfect implementation of a Metropolis-Hastings simulation of Markov point processes. Res. Rept 348, Department of Statistics, University of Warwick.
22. KENDALL, W. S. AND MØLLER, J. (1999). Perfect Metropolis-Hastings simulation of locally stable point processes. Tech. Rept R-99-2001, Department of Mathematical Sciences, Aalborg University, 1999. Available at http://www.statslab.cam.ac.uk/mcmc/.
23. KENDALL, W. S. AND THÖNNES, E. (1999). Perfect simulation in stochastic geometry. Pattern Recognition 32, 1569-1586.
24. KENDALL, W. S., VAN LIESHOUT, M. N. M. AND BADDELEY, A. J. (1999). Quermass-interaction processes: conditions for stability. Adv. Appl. Prob. 31, 315-342.
25. KLEIN, W. (1982). Potts-model formulation of continuum percolation. Phys. Rev. B 26, 2677-2678.
26. LUND, R. B. AND WILSON, D. B. (1997). Exact sampling algorithms for storage systems. In preparation.
27. MEYN, S. P. AND TWEEDIE, R. L. ( 1993). Markov Chains and Stochastic Stability. Springer, New York.
28. MØLLER, J. (1989). On the rate of convergence of spatial birth-and-death processes. Ann. Inst. Statist. Math. 41, 565-581.
29. MØLLER, J. (1994). Discussion contribution. Scand. J. Statist. 21, 346-349.
30. MØLLER, J. ( 1999). Markov chain Monte Carlo and spatial point processes. In Stochastic Geometry: Likelihood and Computation, eds O. E. Barndorff-Nielsen, W. S. Kendall and M. N. M. van Lieshout. Chapman & Hall/CRC, Boca Raton, pp. 141-172.
31. MØLLER, J. AND NICHOLLS, G. (1999). Perfect simulation for sample-based inference. Tech. Rept R-99-2011, Department of Mathematical Sciences, Aalborg University.
32. MØLLER, J. AND SCHLADITZ, K. (1999). Extensions of Fill's algorithm for perfect simulation. J. R. Statist. Soc. Ser. B 61, 955-969.
33. MØLLER, J. AND WAAOEPETERSEN, R. (1998). Markov connected component fields. Adv. Appl. Prob. 30, 1-35.
34. MURDOCH, D. J. AND GREEN, P. J. (1998). Exact sampling from a continuous state space. Scand. J. Statist. 25, 483-502.
35. MURDOCH, D. J. AND ROSENTHAL, J. S. (2000). Efficient use of exact samples. Statist. Comput. 10, 237-243.
36. PRESTON, C. J. (1977). Spatial birth-and-death processes. Bull. Inst. Int. Statist. 46, 371-391.
37. 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.
38. RIPLEY, B. D. (1977). Modelling spatial patterns (with discussion). J. R. Statist. Soc. Ser. B 39, 172-212.
39. RIPLEY, B. D. AND KELLY, F. P. (1977). Markov point processes. J. London Math. Soc. 15, 188-192.
40. STRAUSS, D. J. (1975). A model for clustering. Biometrika 63, 467-475.
41. THÖNNES, E. (1999). Perfect simulation of some point processes for the impatient user. Adv. Appl. Prob. 31, 69-87.
42. VAN DEN BERG, J. AND STEIF, J. E. (1999). On the existence and non-existence of finitary codings for a class of random fields. Ann. Prob. 27, 1501-1522.
43. WILSON, D. B. (2000). Layered multishift coupling for use in perfect sampling algorithms (with a primer on CFTP). In Monte Carlo Methods, ed. N. Madras (Fields Institute Communications 26). AMS, Providence, RI, pp. 141-176.