Testing thresholds for high-dimensional sparse random geometric graphs
Publication
, Conference
Liu, S; Mohanty, S; Schramm, T; Yang, E
Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
June 9, 2022
Duke Scholars
Published In
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
DOI
Publication Date
June 9, 2022
Start / End Page
672 / 677
Publisher
ACM
Conference Name
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
APA
Chicago
ICMJE
MLA
NLM
Liu, S., Mohanty, S., Schramm, T., & Yang, E. (2022). Testing thresholds for high-dimensional sparse random geometric graphs. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (pp. 672–677). ACM. https://doi.org/10.1145/3519935.3519989
Liu, Siqi, Sidhanth Mohanty, Tselil Schramm, and Elizabeth Yang. “Testing thresholds for high-dimensional sparse random geometric graphs.” In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 672–77. ACM, 2022. https://doi.org/10.1145/3519935.3519989.
Liu S, Mohanty S, Schramm T, Yang E. Testing thresholds for high-dimensional sparse random geometric graphs. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM; 2022. p. 672–7.
Liu, Siqi, et al. “Testing thresholds for high-dimensional sparse random geometric graphs.” Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, ACM, 2022, pp. 672–77. Crossref, doi:10.1145/3519935.3519989.
Liu S, Mohanty S, Schramm T, Yang E. Testing thresholds for high-dimensional sparse random geometric graphs. Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. ACM; 2022. p. 672–677.
Published In
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
DOI
Publication Date
June 9, 2022
Start / End Page
672 / 677
Publisher
ACM
Conference Name
STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing