Inverse expander mixing for hypergraphs.
journal contributionposted on 13.06.2016 by E Cohen, D Mubayi, P Ralli, P Tetali
Any type of content formally published in an academic journal, usually following a peer-review process.
We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and k-uniform hypergraphs. In the hypergraph setting, we extend results of Bilu and Linial for graphs. In the simplicial complex setting, our results answer a question of Parzanchevski et al.