Random Geometric Graph Diameter in the Unit Disk with ℓp Metric

  • Robert B. Ellis
  • Jeremy L. Martin
  • Catherine Yan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)


Let n be a positive integer, λ> 0 a real number, and 1≤ p≤ ∞. We study the unit disk random geometric graphGp(λ,n), defined to be the random graph on n vertices, independently distributed uniformly in the standard unit disk in \({\mathbb R}^2\), with two vertices adjacent if and only if their ℓp-distance is at most λ. Let \(\lambda=c\sqrt{\ln n/n}\), and let ap be the ratio of the (Lebesgue) areas of the ℓp- and ℓ2-unit disks. Almost always, Gp(λ,n) has no isolated vertices and is also connected if c>ap− − 1/2, and has \(n^{1-a_pc^2}(1+o(1))\) isolated vertices if c<ap− − 1/2. Furthermore, we find upper bounds (involving λ but independent of p) for the diameter of Gp(λ,n), building on a method originally due to M. Penrose.


  1. 1.
    Chen, X., Jia, X.: Package routing algorithms in mobile ad-hoc wireless networks. In: 2001 International Conference on Parallel Processing Workshops, pp. 485–490 (2001)Google Scholar
  2. 2.
    Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor eliminationbased broadcasting algorithms in wireless networks. IEEE Trans. Parallel Distrib. Syst. 13, 14–25 (2002)CrossRefGoogle Scholar
  3. 3.
    Wu, J., Li, H.: A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems 18, 13–36 (2001)MATHCrossRefGoogle Scholar
  4. 4.
    Ellis, R.B., Jia, X., Yan, C.H.: On random points in the unit disk (preprint)Google Scholar
  5. 5.
    Whittaker, E.T., Watson, G.N.: A course of modern analysis. Cambridge University Press, Cambridge (1996)MATHGoogle Scholar
  6. 6.
    Penrose, M.D.: On k-connectivity for a geometric random graph. Random Structures Algorithms 15, 145–164 (1999)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. John Wiley, Chichester (2000)MATHCrossRefGoogle Scholar
  8. 8.
    Klarner, D.A.: Cell growth problems. Canad. J. Math. 19, 851–863 (1967)MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Robert B. Ellis
    • 1
  • Jeremy L. Martin
    • 2
  • Catherine Yan
    • 1
  1. 1.Department of MathematicsTexas A&M UniversityCollege StationUSA
  2. 2.School of MathematicsUniversity of MinnesotaMinneapolisUSA

Personalised recommendations