Aditya Chandran Arvind

Exact Cascade Uncertainty Under Pairwise Compression

Higher-order data are often compressed into pairwise co-occurrence counts, but this can hide how pairs are assembled into triples. We ask for the largest possible difference in deterministic cascade size between simple 3-uniform hypergraphs with the same labeled exact pair-codegree matrix. Starting from two active vert...