An Improved Trickle-Down Theorem for Partite Complexes
Discrete Mathematics
2023-06-21 v3 Data Structures and Algorithms
Combinatorics
Abstract
We prove a strengthening of the trickle down theorem for partite complexes. Given a -partite -dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are -(one-sided) spectral expanders, then the link of any face of co-dimension is an -(one-sided) spectral expander, for all . For an application, using our theorem as a black-box, we show that links of faces of co-dimension in recent constructions of bounded degree high dimensional expanders have spectral expansion at most fraction of the spectral expansion of the links of the worst faces of co-dimension .
Cite
@article{arxiv.2208.04486,
title = {An Improved Trickle-Down Theorem for Partite Complexes},
author = {Dorna Abdolazimi and Shayan Oveis Gharan},
journal= {arXiv preprint arXiv:2208.04486},
year = {2023}
}