Source: Adv. in Appl. Probab. Volume 41, Number 4
(2009), 958-977.
In a repulsive point process, points act as if they are repelling one
another, leading to underdispersed configurations when compared to a
standard Poisson point process. Such models are useful when competition
for resources exists, as in the locations of towns and trees.
Bertil Matérn introduced three models for repulsive point processes,
referred to as types I, II, and III. Matérn used types I and II, and
regarded type III as intractable.
In this paper an algorithm is developed that allows for arbitrarily accurate
approximation of the likelihood for data modeled by the Matérn type-III
process. This method relies on a perfect simulation method that is shown
to be fast in practice, generating samples in time that grows nearly
linearly in the intensity parameter of the model, while the running times
for more naive methods grow exponentially.
References
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.
Mathematical Reviews (MathSciNet):
MR773665
Beskos, A., Papaspiliopoulos, O. and Roberts, G. O. (2006). Retrospective exact simulation of diffusion sample paths with applications. Bernoulli 12, 1077--1098.
Brown, T. (1979). Position dependent and stochastic thinning of point processes. Stoch. Process. Appl. 9, 189--193.
Mathematical Reviews (MathSciNet):
MR548838
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.
Mathematical Reviews (MathSciNet):
MR57518
Döge, G. (2001). Perfect simulation for random sequential adsorption of $d$-dimensional spheres with random radii. J. Statist. Comput. Simul. 69, 141--156.
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.
Feder, J. (1980). Random sequential adsorption. J. Theoret. Biol. 87, 273--254.
Finegold, L. and Donnell, J. T. (1979). Maximum density of random placing of membrane particles. Nature 278, 443--445.
Fishman, G. E. (1996). Monte Carlo. Springer, New York.
Foss, S. G. and Tweedie, R. L. (1998). Perfect simulation and backward coupling. Commun. Statist. Stoch. Models 14, 187--203.
Glass, L. and Tobler, W. R. (1971). Uniform distribution of objects in a homogeneous field: cities on a plain. Nature 233, 67--68.
Häggström, O. and Nelander, K. (1999). On exact simulation of Markov random fields using coupling from the past. Scand. J. Statist. 26, 395--411.
Hastings, W. K. (1970). Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57, 97--109.
Huber, M. (2004). Perfect sampling using bounding chains. Ann. Appl. Prob. 14, 734--753.
Kelly, F. P. and Ripley, B. D. (1976). A note on Strauss's model for clustering. Biometrika, 63, 357--360.
Mathematical Reviews (MathSciNet):
MR431375
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, New York, pp. 218--234.
Matérn, B. (1986). Spatial Variation (Lecture Notes Statist. 36), 2nd edn. Springer, New York.
Mathematical Reviews (MathSciNet):
MR867886
Metropolis, N. C. et al. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21, 1087--1092.
Møller, J. (1999). Perfect simulation of conditionally specified models. J. R. Statist. Soc. B 61, 251--264.
Møller, 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.
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.
Pálasti, I. (1960). On some random space filling problems. Publ. Math. Inst. Hung. Acad. Sci. 5, 353--359.
Mathematical Reviews (MathSciNet):
MR146947
Ripley, B. D. and Kelly, F. P. (1977). Markov point processes. J. London Math. Soc. 15, 188--192.
Mathematical Reviews (MathSciNet):
MR436387
Schaaf, P., Voegel, J.-C. and Senger, B. (1998). Irreversible deposition/adsorption processes on solid surfaces. Annales de Physique 23, 1--89.
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.
Mathematical Reviews (MathSciNet):
MR256531
Štefankovič, 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.
Stoyan, D. (1979). Interrupted point processes. Biometrical J. 21, 607--610.
Mathematical Reviews (MathSciNet):
MR566033
Stoyan, D. and Stoyan, H. (1985). On one of Matérn's hard-core point process models. Math. Nachr. 122, 205--214.
Mathematical Reviews (MathSciNet):
MR871204
Stoyan, D., Kendall, W. S. and Mecke, J. (1995). Stochastic Geometry and Its Applications, 2nd edn. John Wiley, Chichester.
Mathematical Reviews (MathSciNet):
MR895588
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.
Strauss, D. J. (1975). A model for clustering. Biometrika, 62, 467--475.
Mathematical Reviews (MathSciNet):
MR383493
Tanemura, M. (1979). On random complete packing by discs. Ann. Inst. Statist. Math. B 31, 351--365.
Van Lieshout, M. N. M. (2006). Maximum likelihood estimation for random sequential adsorption. Adv. Appl. Prob. 38, 889--898.
Von Neumann, J. (1951). Various techniques used in connection with random digits. NBS Appl. Math. Ser. 12, 36--38.
Wilson, D. B. (2000). How to couple from the past using a read-once source of randomness. Random Structures Algorithms 16, 85--113.