The connectivity threshold of random geometric graphs with Cantor distributed vertices

Abstract: For connectivity of emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider

n

i.i.d. emph{Cantor} distributed points on

[0, 1]

. We show that for this random geometric graph, the connectivity threshold

R_{n}

, converges almost surely to a constant

1 - 2 p h i

where

0 < p h i < 1 / 2

, which for the standard Cantor distribution is 1/3. We also show that

| R_{n} - (1 - 2 p h i) |_{1} s i m 2, C (p h i), n^{- 1 / d_{p h i}}

where

C (p h i) > 0

is a constant and

d_{p h i} := - l o g 2 / l o g p h i

is the emph{Hausdorff dimension} of the generalized Cantor set with parameter

p h i

.

Recommendations

Cites Work

Cited In (5)

This page was built for publication: The connectivity threshold of random geometric graphs with Cantor distributed vertices