On Statistical-Computational Gaps in Graph Combinatorial Testing Problems
We study high-dimensional graph combinatorial hypothesis testing problems in which a signal is supported on the edge set of an unknown subgraph drawn from a class invariant under vertex relabeling.
By Ikjun Choi, Pratik Patil, Alessandro RinaldoarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Nov 2, 2026.
Comments
Sign in to join the discussion.