A Note on Interference in Random Point Sets

Details A Note on Interference in Random Point Sets A Note on Interference in Random Point Sets

2012-02-27

arxiv.org/abs/1202.5945v3

Computer Science

Computational Geometry

Updated for journal submission

Scientific paper

The (maximum receiver-centric) interference of a geometric graph (von Rickenbach etal (2005)) is studied. It is shown that, with high probability, the following results hold for a set, V, of n points independently and uniformly distributed in the unit d-cube, for constant dimension d: (1) there exists a connected graph with vertex set V that has interference O((log n)^{1/3}); (2) no connected graph with vertex set V has interference o((log n)^{1/4}); and (3) the minimum spanning tree of $V$ has interference Theta((\log n)^{1/2}).

Affiliated with

Also associated with

No associations

Rating

A Note on Interference in 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 A Note on Interference in Random Point Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Interference in Random Point Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263654