Planted clique detection and recovery from the hypergraph adjacency matrix

Kalle Alaluusua, B. R. Vinay Kumar

Hypergraph data are often projected onto a weighted graph by constructing an adjacency matrix whose $(i,j)$ entry counts the number of hyperedges containing both nodes $i$ and $j$.…