Inverse Expander.pdf (356.12 kB)
Inverse expander mixing for hypergraphs.
journal contribution
posted on 2016-06-13, 00:00 authored by E Cohen, D Mubayi, P Ralli, P TetaliWe 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.
Funding
Research supported in part by the NSF grants DMS 1101447 and 1407657. Research supported in part by the NSF grants DMS 0969092 and 1300138.
History
Publisher Statement
This is a copy of an article published in the Electronic Journal of Combinatorics © 2016 Electronic Journal of Combinatorics Publications.Publisher
Electronic Journal of CombinatoricsLanguage
- en_US