Central limit theorems for some graphs in computational geometry

Annals of Applied Probability

Volumn 11, Issue 4, 2001, Pages 1005-1041

  Penrose, Mathew D ^a   Yukich, J E ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

Central limit theorems; Computational geometry; k nearest neighbors graph; Sphere of influence graph; Voronoi graph

Indexed keywords

EID: 0035497809     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1015345393     Document Type: Article

References (23)

1. AVRAM, F. and BERTSIMAS, D. (1993). On central limit theorems in geometrical probability. Ann. Appl. Probab. 3 1033-1046.
2. BICKEL, P. J. and BREIMAN, L. (1983). Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. Ann. Probab. 11 185-214.
3. DEVROYE, L. (1988). The expected size of some graphs in computational geometry. Comput. Math. Appl. 15 53-64.
4. DURRETT, R. (1991). Probability: Theory and Examples. Wadsworth & Brooks/Cole, Pacific Grove, CA.
5. FÜREDI, Z. (1997). The expected size of the sphere of influence graph. Bolyai Soc. Math. Stud. 6 ("Intuitive Geometry Budapest 1995") 319-326.
6. GROENEBOOM, P. (1988). Limit theorems for convex hulls. Probab. Theory Related Fields 79 327-368.
7. HÄGGSTRÖM, O. and MEESTER, R. (1996). Nearest neighbor and hard sphere models in continuum percolation. Random Structures Algorithms 9 295-315.
8. HEINRICH, L. (1994). Normal approximation for some mean value estimates of absolutely regular tessellations. Math. Methods Statist. 3 1-24.
9. HENZE, N. (1987). On the fraction of random points with specified nearest-neighbour interactions and degree of attraction. Adv. in Appl. Probab. 19 873-895.
10. HITCZENKO, P., JANSON, S. and YUKICH, J. E. (1999). On the variance of the random sphere of influence graph. Random Structures Algorithms 14 139-152.
11. KESTEN, H. and LEE, S. (1996). The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Probab. 6 495-527.
12. LEE, S. (1997). The central limit theorem for Euclidean minimal spanning trees I. Ann. Appl. Probab. 7 996-1020.
13. LEE, S. (1999). The central limit theorem for Euclidean minimal spanning trees II. Adv. in Appl. Probab. 31 969-984.
14. MCGIVNEY, K. and YUKICH, J. E. (1999). Asymptotics for Voronoi tessellations on random samples. Stochastic Process. Appl. 83 273-288.
15. MCLEISH, D. L. (1974). Dependent central limit theorems and invariance principles. Ann. Probab. 2 620-628.
16. MEESTER, R. and ROY, R. (1996). Continuum Percolation. Cambridge Univ. Press.
17. MICHAEL, T. S. and QUINT, T. (1994). Sphere of influence graphs: a survey. Congr. Numer. 105 153-160.
18. OKABE, A., BOOTS, B. and SUGIHARA, K. (1992). Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester.
19. PENROSE, M. D. (2001). A spatial central limit theorem with applications to percolation, epidemics and Boolean models. Ann. Probab. 29.
20. PENROSE, M. D. and YUKICH, J. E. Limit theory for random sequential packing and deposition. Ann. Appl. Probab. 12.
21. PREPARATA, F. P. and SHAMOS, M. I. (1985). Computational Geometry: an Introduction. Springer, New York.
22. TOUSSAINT, G. T. (1982). Computational geometric problems in pattern recognition. In Pattern Recognition Theory and Applications (J. Kittler, K. S. Fu and L. F. Pau, eds.), Reidel, Dordrecht. 73-91.
23. YUKICH, J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Math. 1675. Springer, Berlin.