Advances in Applied Probability

On the relation between graph distance and Euclidean distance in random geometric graphs

J. Díaz, D. Mitsche, G. Perarnau, and X. Pérez-Giménez

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) that hold asymptotically almost surely has received quite a bit of attention in the literature. In this paper we improve the known upper bounds for values of r=ω(√logn) (that is, for r above the connectivity threshold). Our result also improves the best known estimates on the diameter of random geometric graphs. We also provide a lower bound on dE(u, v) conditional on dE(u, v).

Article information

Adv. in Appl. Probab., Volume 48, Number 3 (2016), 848-864.

First available in Project Euclid: 19 September 2016

Permanent link to this document

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 05C80: Random graphs [See also 60B20]
Secondary: 68R10: Graph theory (including graph drawing) [See also 05Cxx, 90B10, 90B35, 90C35]

Random geometric graph graph distance Euclidean distance diameter


Díaz, J.; Mitsche, D.; Perarnau, G.; Pérez-Giménez, X. On the relation between graph distance and Euclidean distance in random geometric graphs. Adv. in Appl. Probab. 48 (2016), no. 3, 848--864.

Export citation


  • Bradonjić, M. \et (2010). Efficient broadcast on random geometric graphs. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, pp. 1412–1421.
  • Ellis, R. B., Martin, J. L. and Yan, C. (2007). Random geometric graph diameter in the unit ball. Algorithmica, 47, 421–438.
  • Gilbert, E. N. (1961) Random plane networks. J. Soc. Indust. Appl. Math. 9, 533–543.
  • Friedrich, T., Sauerwald, T. and Stauffer, A. (2011). Diameter and broadcast time of random geometric graphs in arbitrary dimensions. In Algorithms and Computation, Springer, Heidelberg, pp. 190–199.
  • Goel, A. Rai, S. and Krishnamachari, B. (2004). Sharp thresholds for monotone properties in random geometric graphs. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 580–586.
  • Mehrabian, A. and Wormald, N. (2013). On the Stretch Factor of Randomly Embedded Random Graphs. \em Discrete Comput. Geom. 49, 647–658.
  • Muthukrishnan, S. and Pandurangan, G. (2005). The bin-covering technique for thresholding random geometric graph properties. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, pp. 989–998.
  • Penrose, D. M. (1997). The longest edge of the random minimal spanning tree. Ann. Appl. Prob., 7, 340–361.
  • Penrose, M. (2003). Random Geometric Graphs. Oxford University Press.
  • Walters, M. (2011). Random geometric graphs. In Surveys in Combinatorics, 2011, Cambridge University Press, pp. 365–401.