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

DOI10.1017/apr.2016.31zbMath1348.05188arXiv1404.4757OpenAlexW2963022083WikidataQ57991423 ScholiaQ57991423MaRDI QIDQ2830884

Guillem Perarnau, Dieter Mitsche, Xavier Pérez-Giménez, Josep Diaz

Publication date: 1 November 2016

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4757

zbMATH Keywords

diameterrandom geometric graphgraph distanceEuclidean distance

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Ollivier curvature of random geometric graphs converges to Ricci curvature of their Riemannian manifolds ⋮ Second-order consensus protocols based on transformed \(d\)-path Laplacians ⋮ Burning graphs: a probabilistic perspective ⋮ Detecting a botnet in a network ⋮ Localization game for random geometric graphs

This page was built for publication: On the relation between graph distance and Euclidean distance in random geometric graphs