Which Connected Spatial Networks on Random Points have Linear Route-Lengths?

Details Which Connected Spatial Networks on Random Points have Linear Route-Lengths? Which Connected Spatial Networks on Random Points have Linear Route-Lengths?

2009-11-27

arxiv.org/abs/0911.5296v1

Mathematics

Probability

Scientific paper

In a model of a connected network on random points in the plane, one expects that the mean length of the shortest route between vertices at distance $r$ apart should grow only as $O(r)$ as $r \to \infty$, but this is not always easy to verify. We give a general sufficient condition for such linearity, in the setting of a Poisson point process. In a $L \times L$ square, define a subnetwork $\GG_L$ to have the edges which are present regardless of the configuration outside the square; the condition is that the largest component of $\GG_L$ should contain a proportion $1 - o(1)$ of the vertices, as $L \to \infty$. The proof is by comparison with oriented percolation. We show that the general result applies to the relative neighborhood graph, and establishing the linearity property for this network immediately implies it for a large family of proximity graphs.

Affiliated with

Also associated with

No associations

Rating

Which Connected Spatial Networks on Random Points have Linear Route-Lengths? 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 Which Connected Spatial Networks on Random Points have Linear Route-Lengths?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Which Connected Spatial Networks on Random Points have Linear Route-Lengths? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195842