{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:39:39Z","timestamp":1781109579677,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CCF-1940205"],"award-info":[{"award-number":["CCF-1940205"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649676","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"549-560","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Fourier Coefficients of High-Dimensional Random Geometric Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7131-956X","authenticated-orcid":false,"given":"Kiril","family":"Bangachev","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1303-582X","authenticated-orcid":false,"given":"Guy","family":"Bresler","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030308"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.78"},{"key":"e_1_3_2_1_4_1","unstructured":"Kiril Bangachev and Guy Bresler. 2023. Detection of L_\u221e Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion. arxiv:2310.14501."},{"key":"e_1_3_2_1_5_1","unstructured":"Kiril Bangachev and Guy Bresler. 2023. Random Algebraic Graphs and Their Convergence to Erdos-Renyi. arxiv:2305.04802."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Kiril Bangachev and Guy Bresler. 2024. On The Fourier Coefficients of High-Dimensional Random Geometric Graphs. arxiv:2402.12589.","DOI":"10.1145\/3618260.3649676"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1138236"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0370164600015637"},{"key":"e_1_3_2_1_9_1","volume-title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. Conference on Learning Theory.","author":"Brennan Matthew","year":"2021","unstructured":"Matthew Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, and Tselil Schramm. 2021. Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent. Conference on Learning Theory."},{"key":"e_1_3_2_1_10_1","unstructured":"Matthew Brennan Guy Bresler and Brice Huang. 2021. De Finetti-Style Results for Wishart Matrices: Combinatorial Structure and Phase Transitions. arxiv:2103.14011."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Matthew Brennan Guy Bresler and Brice Huang. 2022. Threshold for Detecting High Dimensional Geometry in Anisotropic Random Geometric Graphs. 10.48550\/arXiv.2206.14896 To appear in Random Structures and Algorithms","DOI":"10.1002\/rsa.21178"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-020-00998-3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234564"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20633"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1760"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v16-967"},{"key":"e_1_3_2_1_17_1","volume-title":"Wein","author":"Dhawan Abhishek","year":"2023","unstructured":"Abhishek Dhawan, Cheng Mao, and Alexander S. Wein. 2023. Detection of Dense Subhypergraphs by Low-Degree Polynomials. arxiv:2304.08135."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36020-7_13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519981"},{"key":"e_1_3_2_1_20_1","unstructured":"Tobias Friedrich Andreas G\u00f6bel Maximilian Katzmann and Leon Schiller. 2023. A simple statistic for determining the dimensionality of complex networks. arxiv:2302.06357."},{"key":"e_1_3_2_1_21_1","unstructured":"Samuel Hopkins. 2018. STATISTICAL INFERENCE AND THE SUM OF SQUARES METHOD."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.42"},{"key":"e_1_3_2_1_23_1","volume-title":"Annual Conference Computational Learning Theory. https:\/\/api.semanticscholar.org\/CorpusID:257255498","author":"Kothari Pravesh","year":"2023","unstructured":"Pravesh Kothari, Santosh S. Vempala, Alexander S. Wein, and Jeff Xu. 2023. Is Planted Coloring Easier than Planted Clique? In Annual Conference Computational Learning Theory. https:\/\/api.semanticscholar.org\/CorpusID:257255498"},{"key":"e_1_3_2_1_24_1","unstructured":"Shuangping Li and Tselil Schramm. 2023. Spectral clustering in the Gaussian mixture block model. arxiv:2305.00979."},{"key":"e_1_3_2_1_25_1","unstructured":"Suqi Liu and Morgane Austern. 2024. Random Geometric Graph Alignment with Graph Neural Networks. arxiv:2402.07340."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519989"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585106"},{"key":"e_1_3_2_1_28_1","unstructured":"Suqi Liu and Miklos Racz. 2021. Phase transition in noisy high-dimensional random geometric graphs. arxiv:2103.15249."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.3150\/22-BEJ1547"},{"key":"e_1_3_2_1_30_1","first-page":"1","article-title":"Universal Latent Space Model Fitting for Large Networks with Edge Covariates","volume":"21","author":"Ma Zhuang","year":"2020","unstructured":"Zhuang Ma, Zongming Ma, and Hongsong Yuan. 2020. Universal Latent Space Model Fitting for Large Networks with Edge Covariates. J. Mach. Learn. Res., 21 (2020), 4:1\u20134:67. https:\/\/api.semanticscholar.org\/CorpusID:211529745","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_31_1","unstructured":"Cheng Mao Alexander S. Wein and Shenduo Zhang. 2024. Information-Theoretic Thresholds for Planted Dense Cycles. arxiv:2402.00305."},{"key":"e_1_3_2_1_32_1","volume-title":"Kabir Aladin Verchand, and Alexander S. Wein","author":"Mardia Jay","year":"2024","unstructured":"Jay Mardia, Kabir Aladin Verchand, and Alexander S. Wein. 2024. Low-degree phase transitions for detecting a planted clique in sublinear time. arxiv:2402.05451."},{"key":"e_1_3_2_1_33_1","first-page":"101","article-title":"Probabilistic Characteristics of Graphs with Large Connectivity","volume":"10","author":"Margulis G. A.","year":"1974","unstructured":"G. A. Margulis. 1974. Probabilistic Characteristics of Graphs with Large Connectivity. Probl. Peredachi Inf., 10 (1974), 101\u2013108.","journal-title":"Probl. Peredachi Inf."},{"key":"e_1_3_2_1_34_1","volume-title":"Wein","author":"Montanari Andrea","year":"2022","unstructured":"Andrea Montanari and Alexander S. Wein. 2022. Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation. arxiv:2212.06996."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5975"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139814782"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2023.94"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535742"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of Thirty Fifth Conference on Learning Theory (Proceedings of Machine Learning Research","volume":"3488","author":"Wang Haoyu","year":"2022","unstructured":"Haoyu Wang, Yihong Wu, Jiaming Xu, and Israel Yolou. 2022. Random Graph Matching in Geometric Models: the Case of Complete Graphs. In Proceedings of Thirty Fifth Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 178). PMLR, 3441\u20133488. https:\/\/proceedings.mlr.press\/v178\/wang22a.html"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":39,"alternative-id":["10.1145\/3618260.3649676","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649676","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}