The expected size of the sphere-of-influence graph
โ Scribed by Rex A. Dwyer
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 409 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0925-7721
No coin nor oath required. For personal study only.
โฆ Synopsis
The sphere-of-influence graph of a set of point sites in R a is constructed by identifying the nearest neighbor of each site, centering a ball at each site so that its nearest neighbor lies on the boundary, and joining two sites by an edge if and only if their balls intersect. The asymptotic behavior of the expected number of edges of this graph is investigated when the sites are independent and uniformly distributed and their number grows without bound.
๐ SIMILAR VOLUMES
We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R d , grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of i