Nearest neighbor and hard sphere models in continuum percolation

Random Structures and Algorithms

Volumn 9, Issue 3, 1996, Pages 295-315

  Häggström, Olle ^a   Meester, Ronald ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039056192     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199610)9:3<295::aid-rsa3>3.3.co;2-3     Document Type: Article

References (12)

1. D. Aldous and J. M. Steele, Asymptotics for Euclidean minimal spanning forests in infinite graphs, Prob. Theor. Rel. Fields, 92, 247-258 (1992).
2. F. Avram and D. Bertsimas, On central limit theorems in geometrical probability, Ann. Appl. Probab., 3, 1033-1046 (1993).
3. M. Bramson, P. Ney, and J. Tao, The population composition of a multitype branching random walk, Ann. Appl. Probab., 2, 575-596 (1992).
4. R. M. Burton and M. S. Keane, Density and uniqueness in percolation, Commun. Math. Phys., 121, 501-505 (1989).
5. R. Durrett, Oriented percolation in two dimensions, Ann. Probab., 12, 999-1040.
6. R. Durrett, Lecture Notes on Particle Systems and Percolation, Wadsworth and Brooks/Cole, CA, 1988.
7. G. R. Grimmett, Percolation, Springer-Verlag, New York, 1989.
8. R. W. J. Meester, M. D. Penrose, and A. Sarkar, The random connection model in high dimensions, preprint, 1995.
9. R. W. J. Meester and R. Roy, Uniqueness of unbounded occupied and vacant components in Boolean models, Ann. Appl. Probab., 4, 933-951 (1994).
10. R. W. J. Meester and R. Roy, Continuum Percolation, Cambridge University Press, Cambridge, 1996.
11. C. M. Newman, Y. Rinott, and A. Tversky, Nearest neighbors and Voronoi regions in certain point processes, Adv. Appl. Probab., 15, 726-751 (1983).
12. M. D. Penrose, Continuum percolation and Euclidean minimal spanning trees in high dimensions, Appl. Probab. (1996), to appear.