Inverse expander mixing for hypergraphs.
journal contributionposted on 2016-06-13, 00:00 authored by E Cohen, D Mubayi, P Ralli, P Tetali
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.
Research supported in part by the NSF grants DMS 1101447 and 1407657. Research supported in part by the NSF grants DMS 0969092 and 1300138.
Publisher StatementThis is a copy of an article published in the Electronic Journal of Combinatorics © 2016 Electronic Journal of Combinatorics Publications.
PublisherElectronic Journal of Combinatorics