Inverse Expander Mixing for Hypergraphs
Combinatorics
2014-07-10 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1407.2285,
title = {Inverse Expander Mixing for Hypergraphs},
author = {Emma Cohen and Dhruv Mubayi and Peter Ralli and Prasad Tetali},
journal= {arXiv preprint arXiv:1407.2285},
year = {2014}
}