On the metric distortion of nearest-neighbour graphs on random point sets

Details On the metric distortion of nearest-neighbour graphs on random point sets On the metric distortion of nearest-neighbour graphs on random point sets

2008-04-23

arxiv.org/abs/0804.3784v2

Computer Science

Networking and Internet Architecture

This work is now subsumed by arXiv:0805.4060v4 [cs.NI]

Scientific paper

We study the graph constructed on a Poisson point process in $d$ dimensions by connecting each point to the $k$ points nearest to it. This graph a.s. has an infinite cluster if $k > k_c(d)$ where $k_c(d)$, known as the critical value, depends only on the dimension $d$. This paper presents an improved upper bound of 188 on the value of $k_c(2)$. We also show that if $k \geq 188$ the infinite cluster of $\NN(2,k)$ has an infinite subset of points with the property that the distance along the edges of the graphs between these points is at most a constant multiplicative factor larger than their Euclidean distance. Finally we discuss in detail the relevance of our results to the study of multi-hop wireless sensor networks.

Affiliated with

Also associated with

No associations

Rating

On the metric distortion of nearest-neighbour graphs on random point sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the metric distortion of nearest-neighbour graphs on random point sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the metric distortion of nearest-neighbour graphs on random point sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-105422