Infinite random geometric graphs

Details Infinite random geometric graphs Infinite random geometric graphs

2009-08-18

arxiv.org/abs/0908.2590v1

Mathematics

Combinatorics

17 pages, 4 figures

Scientific paper

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given threshold. If the vertex set is a countable dense set in R^n equipped with the metric derived from the L_{\infty}-norm, then it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR_n, is characterized by a geometric analogue of the existentially closed adjacency property, and we give a deterministic construction of GR_n. In contrast, we show that infinite random geometric graphs in R^2 with the Euclidean metric are not necessarily isomorphic.

Affiliated with

Also associated with

No associations

Rating

Infinite random geometric graphs 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 Infinite random geometric graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite random geometric graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8842