Likelihood-Based inference for matérn type-III repulsive point processes

Advances in Applied Probability

Volumn 41, Issue 4, 2009, Pages 958-977

  Huber, Mark L ^a   Wolpert, Robert L ^b  

^a CLAREMONT MCKENNA COLLEGE   (United States)

^b Duke University   (United States)

Author keywords

Coupling from the past; point process; thinning; underdispersed

Indexed keywords

COUPLING FROM THE PAST; INTENSITY PARAMETERS; PERFECT SIMULATION; POINT PROCESS; POISSON POINT PROCESS; RUNNING TIME; THREE MODELS;

APPROXIMATION ALGORITHMS;

EID: 77949277355     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1261669580     Document Type: Article

References (35)

1. Berger, J. O. and Wolpert, R. L. (1984). The Likelihood Principle (IMS Lecture Notes Monogr. Ser. 6), 2nd edn. Institute of Mathematical Statistics, Hayward, CA.
2. Beskos, A., Papaspiliopoulos, O. and Roberts, G. O. (2006). Retrospective exact simulation of diffusion sample paths with applications. Bernoulli 12, 1077-1098.
3. Brown, T. (1979). Position dependent and stochastic thinning of point processes. Stoch. Process. Appl. 9, 189-193.
4. Chernoff, H. (1952). A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23, 493-507.
5. Doge, G. (2001). Perfect simulation for random sequential adsorption of d-dimensional spheres with random radii. J. Statist. Comput. Simul. 69, 141-156.
6. Dyer, M. and Frieze, A. (1991). Computing the volume of convex bodies: a case where randomness provably helps. In Probabilistic Combinatorics and its Applications (Proc. Symp. Appl. Math. 44), ed. B. Bollobás, American Mathematical Society, RI, pp. 123-169.
7. Feder, J. (1980). Random sequential adsorption. J. Theoret. Biol. 87, 273-254.
8. Finegold, L. and Donnell, J. T. (1979). Maximum density of random placing of membrane particles. Nature 278, 443-445.
9. Fishman, G. E. (1996). Monte Carlo. Springer, New York.
10. Foss, S. G. and Tweedie, R. L. (1998). Perfect simulation and backward coupling. Commun. Statist. Stoch. Models 14, 187-203.
11. Glass, L. and Tobler, W. R. (1971). Uniform distribution of objects in a homogeneous field: cities on a plain. Nature 233, 67-68.
12. Haggstrom, O. and Nelander, K. (1999). On exact simulation of Markov random fields using coupling from the past. Scand. J. Statist. 26, 395-411.
13. Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97-109.
14. Huber, M. (2004). Perfect sampling using bounding chains. Ann. Appl. Prob. 14, 734-753.
15. Kelly, F. P. and Ripley, B. D. (1976). A note on Strauss's model for clustering. Biometrika, 63, 357-360.
16. Kendall, W. S. (1998). Perfect simulation for the area-interaction point process. In Probability Towards 2000 (New York, 1995; Lecture Notes Statist. 128), eds L. Accardi and C. C. Heyde, Springer, NewYork, pp. 218-234.
17. Matern, B. (1986). Spatial Variation (Lecture Notes Statist. 36), 2nd edn. Springer, New York.
18. Metropolis, N. C. et al. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087-1092.
19. Moller, J. (1999). Perfect simulation of conditionally specified models. J. R. Statist. Soc. B 61, 251-264.
20. Moller, J., Pettitt, A. N., Reeves, R. and Berthelsen, K. K. (2006). An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants. Biometrika, 93, 451-458.
21. Murray, I., Ghahramani, Z. and MacKay, D. J. C. (2006). MCMC for doubly-intractable distributions. In Proc. 22nd Ann. Conf. on Uncertainty in Artificial Intelligence, eds R. Dechter and T. Richardson, AUAI Press, Arlington, VA, pp. 359-366.
22. Palasti, I. (1960). On some random space filling problems. Publ. Math. Inst. Hung. Acad. Sci. 5, 353-359.
23. Ripley, B. D. and Kelly, F. P. (1977). Markov point processes. J. London Math. Soc. 15, 188-192.
24. Schaaf, P., Voegel, J.-C. and Senger, B. (1998). Irreversible deposition/adsorption processes on solid surfaces. Annales de Physique 23, 1-89.
25. Solomon, H. (1967). Random packing density. In Proc. 5th Berkeley Symp. Math. Statist. Prob. Vol. 3, eds L. M. Le Cam and J. Neyman, University of California Press, Berkeley, CA, pp. 119-134.
26. Štefankovǐc, D., Vempala, S. and Vigoda, E. (2009). Adaptive simulated annealing: a near-optimal connection between sampling and counting. J. Assoc. Comput. Mach. 56, 36 pp.
27. Stoyan, D. (1979). Interrupted point processes. Biometrical J. 21, 607-610.
28. Stoyan, D. and Stoyan, H. (1985). On one of Matérn's hard-core point process models. Math. Nachr. 122, 205-214.
29. Stoyan, D., Kendall, W. S. and Mecke, J. (1995). Stochastic Geometry and its Applications, 2nd edn. John Wiley, Chichester.
30. Strand, L. (1972). A model for stand growth. In IUFRO 3rd Conf. Advisory Group of Forest Statisticians, Institut National de la Recherche Agronomique, Paris, pp. 207-216.
31. Strauss, D. J. (1975). A model for clustering. Biometrika, 62, 467-475.
32. Tanemura, M. (1979). On random complete packing by discs. Ann. Inst. Statist. Math. B 31, 351-365.
33. Van Lieshout, M. N.M. (2006). Maximum likelihood estimation for random sequential adsorption. Adv. Appl. Prob. 38, 889-898.
34. Von Neumann, J. (1951). Various techniques used in connection with random digits. NBS Appl. Math. Ser. 12, 36-38.
35. Wilson, D. B. (2000). How to couple from the past using a read-once source of randomness. Random Structures Algorithms 16, 85-113.