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.
Emma Cohen
1
;
Dhruv Mubayi
2
;
Peter Ralli
3
;
Prasad Tetali
1
Georgia Institute of Technology
2
University of Illinois at Chicago
3
Georgia Tech
Emma Cohen; Dhruv Mubayi; Peter Ralli; Prasad Tetali. Inverse expander mixing for hypergraphs. The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/5283
@article{10_37236_5283,
author = {Emma Cohen and Dhruv Mubayi and Peter Ralli and Prasad Tetali},
title = {Inverse expander mixing for hypergraphs},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {2},
doi = {10.37236/5283},
zbl = {1335.05123},
url = {http://geodesic.mathdoc.fr/articles/10.37236/5283/}
}
TY - JOUR
AU - Emma Cohen
AU - Dhruv Mubayi
AU - Peter Ralli
AU - Prasad Tetali
TI - Inverse expander mixing for hypergraphs
JO - The electronic journal of combinatorics
PY - 2016
VL - 23
IS - 2
UR - http://geodesic.mathdoc.fr/articles/10.37236/5283/
DO - 10.37236/5283
ID - 10_37236_5283
ER -
%0 Journal Article
%A Emma Cohen
%A Dhruv Mubayi
%A Peter Ralli
%A Prasad Tetali
%T Inverse expander mixing for hypergraphs
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/5283/
%R 10.37236/5283
%F 10_37236_5283
