Central limit theorems for some graphs in computational geometry

Let Bn be an increasing sequence of regions in d-dimensional space with volume n and with union d. We prove a general central limit theorem for functionals of point sets, obtained either by restricting a homogeneous Poisson process to Bn, or by by taking n uniformly distributed points in Bn. The sets Bn could be all cubes but a more general class of regions Bn is considered. Using this general result we obtain central limit theorems for specific functionals such as total edge length and number of components, defined in terms of graphs such as the k-nearest neighbors graph, the sphere of influence graph and the Voronoi graph.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  D. McLeish.  Dependent Central Limit Theorems and Invariance Principles , 1974 .

[3]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[4]  P. Bickel,et al.  Sums of Functions of Nearest Neighbor Distances, Moment Bounds, Limit Theorems and a Goodness of Fit Test , 1983 .

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  N. Henze.  On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction , 1987, Advances in Applied Probability.

[7]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[8]  Piet Groeneboom,et al.  Limit theorems for convex hulls , 1988 .

[9]  R. Durrett.  Probability: Theory and Examples , 1993 .

[10]  J. W. Jaromczyk.  The Expected Size of the Sphere-of-Influence Graph , 1995 .

[11]  Rex A. Dwyer.  The Expected Size of the Sphere-of-influence Graph , 1995, Comput. Geom..

[12]  Olle Häggström,et al.  Nearest Neighbor and Hard Sphere Models in Continuum Percolation , 1996 .

[13]  Harry Kesten,et al.  The central limit theorem for weighted minimal spanning trees on random points , 1996 .

[14]  Sungchul Lee,et al.  The central limit theorem for Euclidean minimal spanning trees I I , 1997 .

[15]  J. Yukich.  Probability theory of classical Euclidean optimization problems , 1998 .

[16]  Sungchul Lee,et al.  The central limit theorem for Euclidean minimal spanning trees II , 1999, Advances in Applied Probability.

[17]  J. Yukich,et al.  Asymptotics for Voronoi tessellations on random samples , 1999 .

[18]  Svante Janson,et al.  On the variance of the random sphere of influence graph , 1999, Random Struct. Algorithms.

[19]  J. Yukich,et al.  Limit theory for random sequential packing and deposition , 2002 .