Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices

  title={Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices},
  author={Antar Bandyopadhyay and Farkhondeh Sajadi},
For connectivity of random geometric graphs, where there is no density for underlying distribution of the vertices, we consider n i.i.d. Cantor distributed points on [0, 1]. We show that for this random geometric graph, the connectivity threshold Rn, converges almost surely to a constant 1−2φ where 0 < φ < 1/2, which for standard Cantor distribution is 1/3. We also show that ‖Rn − (1− 2φ)‖1 ∼ 2C (φ) n−1/dφ where C (φ) > 0 is a constant and dφ := −log 2/log φ is a the Hausdorff dimension of the… CONTINUE READING

From This Paper

Topics from this paper.
1 Citations
9 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

The connectivity of a graph on uniform points on [0, 1]d

  • Martin J.B. Appel, Ralph P. Russo
  • Statist. Probab. Lett.,
  • 2002
Highly Influential
9 Excerpts

Connectivity distance in random geometric graph

  • A. Sarkar, B. Saurabh
  • Unpublished results,
  • 2010
1 Excerpt

A strong law for the largest nearest-neighbour link between random points

  • Mathew D. Penrose
  • J. London Math. Soc. (2),
  • 1999
1 Excerpt

Penrose . A strong law for the largest nearestneighbour link between random points

  • D. Mathew
  • J . London Math . Soc .
  • 1999

Moments of order statistics of the Cantor distribution

  • J.R.M. Hosking
  • Statist. Probab. Lett., 19(2):161–165,
  • 1994
2 Excerpts

Über unendliche, lineare punktmannigfaltigkeiten v, [on infinite, linear pointmanifolds (sets)

  • G. Cantor
  • Math. Ann., 21:545–591,
  • 1883
1 Excerpt

On the integration of discontinuous functions

  • Henry J. S. Smith
  • Proc . Lond . Math . Soc .

Similar Papers

Loading similar papers…