Learning random points from geometric graphs or orderings

DOI10.1002/rsa.20922zbMath1493.68370arXiv1809.09879OpenAlexW3017544965MaRDI 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 graphsapproximate embeddingvertex ordersunit-disk graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

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

This page was built for publication: Learning random points from geometric graphs or orderings