Shuangping Li

Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth

A correspondence between the subgraph-count and automorphism factors in the Fourier expansion and counts of isomorphism triples is uncovered, and the low-degree assumption rules out short cycles, while noise destroys the remaining long cycles.