Weak laws of large numbers in geometric probability

Annals of Applied Probability

Volumn 13, Issue 1, 2003, Pages 277-303

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

^a DURHAM UNIVERSITY   (United Kingdom)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

Boolean model; Computational geometry; Minimal spanning tree; Nearest neighbors graph; Objective method; Proximity graph; Sphere of influence graph; Voronoi graph; Weak law of large numbers

Indexed keywords

EID: 0037274513     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1042765669     Document Type: Article

References (30)

1. ALDOUS, D. and STEHLE, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Related Fields 92 247-258.
2. Alexander, K. S. (1995). Simultaneous uniqueness of infinite clusters in stationary random labeled graphs. Comm. Math. Phys. 168 39-55.
3. BEZUIDENHOUT, C., GRIMMETT, G. and LÖFFLER, A. (1998). Percolation and minimal spanning trees. J. Statist. Phys. 92 1-34.
4. BORG, I. and GROENEN, P. (1997). Modern Multidimensional Scaling: Theory and Applications. Springer, New York.
5. BRITO, M., QUIROZ, A. and YUKICH, J. E. (2002). Graph theoretic procedures for dimension identification. J. Multivariate Anal. 81 67-84.
6. DEVROYE, L. (1988). The expected size of some graphs in computational geometry. Comput. Math. Appl. 15 53-64.
7. EPPSTEIN, D., PATERSON, M. S. and YAO, F. F. (1997). On nearest-neighbor graphs. Discrete Comput. Geom. 17 263-282.
8. FÜREDI, Z. (1997). The expected size of a random sphere of influence graph. In Intuitive Geometry (I. Bárány and K. Böröczky, eds.) 319-326. János Bolyai Math. Society, Budapest, Hungary.
9. GRIMMETT, G. (1989, 1999). Percolation. Springer, New York.
10. HALL, P. (1988). Introduction to the Theory of Coverage Processes. Wiley, New York.
11. HAYEN, A. and QUINE, M. P. (2000). The proportion of triangles in a Poisson-Voronoi tessellation of the plane. Adv. in Appl. Probab. 32 67-74.
12. HENZE, N. (1987). On the fraction of random points with specified nearest neighbor interrelations and degree of attraction. Adv. in Appl. Probab. 19 873-895.
13. 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.
14. JAROMCZYK, J. W. and TOUSSAINT, G. T. (1992). Relative neighborhood graphs and their relatives. Proc. IEEE 80 1502-1517.
15. JIMENEZ, R. and YUKICH, J. E. (2002). Strong laws for Euclidean graphs with general edge weights. Statist. Probab. Lett. 56 251-259.
16. KESTEN, H. and LEE, S. (1996). The central limit theorem for weighted minimal spanning trees on random points. Ann. Appl. Probab. 6 495-527.
17. MATHERON, G. (1975). Random Sets and Integral Geometry. Wiley, New York.
18. McGIVNEY, K. (1997). Probabilistic limit theorems for combinatorial optimization problems. Ph.D. dissertation, Lehigh Univ.
19. McGIVNEY, K. and YUKICH, J. E. (1999). Asymptotics for Voronoi tessellations on random samples. Stochastic Process. Appl. 83 273-288.
20. MOLCHANOV, I. (1997). Statistics of the Boolean Model for Practitioners and Mathematicians. Wiley, New York.
21. PENROSE, M. D. (1996). The random minimal spanning tree in high dimensions. Ann. Probab. 24 1903-1925.
22. PENROSE, M. D. (2001). Random parking, sequential adsorption, and the jamming limit. Comm. Math. Phys. 218 153-176.
23. PENROSE, M. D. and YUKICH, J. E. (2001). Central limit theorems for some graphs in computational geometry. Ann. Appl. Probab. 11 1005-1041.
24. PENROSE, M. D. and YUKICH, J. E. (2001). Limit theory for random sequential packing and deposition. Ann. Appl. Probab. 12 272-301.
25. RUDIN, W. (1987). Real and Complex Analysis, 3rd ed. McGraw-Hill, New York.
26. SMITH, W. D. (1989). Studies in computational geometry motivated by mesh generation. Ph.D. dissertation, Princeton Univ.
27. STEELE, J. M. (1997). Probability Theory and Combinatorial Optimization. SIAM, Philadelphia.
28. STEELE, J. M., SHEPP, L. and EDDY, W. (1987). On the number of leaves of a Euclidean minimal spanning tree. J. Appl. Probab. 24 809-826.
29. YUKICH, J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Math. 1675. Springer, Berlin.
30. YUKICH, J. E. (1999). Asymptotics for weighted minimal spanning trees on random points. Stochastic Process. Appl. 85 123-138.