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

Josep Díaz, Dieter Mitsche, Guillem Perarnau +1

Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_…