Testing thresholds for high-dimensional sparse random geometric graphs

DOI10.1145/3519935.3519989arXiv2111.11316MaRDI QIDQ6083521

Tselil Schramm, Sidhanth Mohanty, Si-Qi Liu, Elizabeth Yang

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

random graphsoptimal transportcavity methodrandom geometric graphsbelief propagation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Phase transition in noisy high-dimensional random geometric graphs ⋮ Threshold for detecting high dimensional geometry in anisotropic random geometric graphs

This page was built for publication: Testing thresholds for high-dimensional sparse random geometric graphs