Asset Details
Do you wish to reserve the book?
Central Limit Theorems for Some Graphs in Computational Geometry
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Central Limit Theorems for Some Graphs in Computational Geometry
Do you wish to request the book?
Central Limit Theorems for Some Graphs in Computational Geometry
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Central Limit Theorems for Some Graphs in Computational Geometry
2001
Overview
Let (Bn) be an increasing sequence of regions in d-dimensional space with volume n and with union Rd. 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 Bncould be all cubes but a more general class of regions Bnis 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.
Publisher
Institute of Mathematical Statistics,The Institute of Mathematical Statistics
Subject
