All Title Author
Keywords Abstract

Mathematics  2014 

Inverse Expander Mixing for Hypergraphs

Full-Text   Cite this paper   Add to My Lib


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.


comments powered by Disqus