Learning random points from geometric graphs or orderings

DOI10.1002/rsa.20922zbMath1493.68370arXiv1809.09879MaRDI QIDQ5136918

Dieter Mitsche, Colin J. H. McDiarmid, Josep Diaz

Publication date: 30 November 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random geometric graphs; approximate embedding; vertex orders; unit-disk graphs

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Localization in 1D non-parametric latent space models from pairwise affinities, Projective, sparse and learnable latent position network models